#14142 (C++11) No.158 奇妙なお使い

提出ソース

結果

問題	No.158 奇妙なお使い
ユーザー	shimomire
提出日時	2015-02-27 00:12:24
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	450 ms / 5,000 ms
コード長	7,180 bytes
コンパイル時間	1,271 ms
コンパイル使用メモリ	128,296 KB
実行使用メモリ	46,976 KB
最終ジャッジ日時	2024-06-28 22:21:39
合計ジャッジ時間	3,763 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	35 ms 46,592 KB
testcase_01	AC	38 ms 46,464 KB
testcase_02	AC	35 ms 46,592 KB
testcase_03	AC	35 ms 46,464 KB
testcase_04	AC	450 ms 46,976 KB
testcase_05	AC	34 ms 46,592 KB
testcase_06	AC	34 ms 46,464 KB
testcase_07	AC	34 ms 46,464 KB
testcase_08	AC	34 ms 46,592 KB
testcase_09	AC	35 ms 46,592 KB
testcase_10	AC	35 ms 46,592 KB
testcase_11	AC	35 ms 46,464 KB
testcase_12	AC	34 ms 46,464 KB
testcase_13	AC	34 ms 46,464 KB
testcase_14	AC	36 ms 46,464 KB
testcase_15	AC	43 ms 46,720 KB
testcase_16	AC	39 ms 46,464 KB
testcase_17	AC	74 ms 46,592 KB
testcase_18	AC	41 ms 46,592 KB
testcase_19	AC	35 ms 46,464 KB
testcase_20	AC	39 ms 46,720 KB
testcase_21	AC	36 ms 46,720 KB
testcase_22	AC	36 ms 46,848 KB
testcase_23	AC	37 ms 46,464 KB
testcase_24	AC	35 ms 46,464 KB
testcase_25	AC	35 ms 46,592 KB
testcase_26	AC	38 ms 46,720 KB
testcase_27	AC	35 ms 46,464 KB
testcase_28	AC	65 ms 46,720 KB
testcase_29	AC	35 ms 46,592 KB
testcase_30	AC	75 ms 46,464 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <list>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(c) c.begin(),c.end()
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
// #define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define LINE()    cerr<< " (L" << __LINE__ << ")"
 
class range{
private:
	struct Iter{
		int v;
		int operator*(){return v;}
		bool operator!=(Iter& itr) {return v < itr.v;}
		void operator++() {++v;}
	};
	Iter i, n;
public:
	range(int n) : i({0}), n({n}) {}
	range(int i, int n) : i({i}), n({n}) {}
	Iter& begin() {return i;}
	Iter& end() {return n;}
};
 
//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
 
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}
 
// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};
 
template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};
 
// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){
	T res=1;while(res<n)res<<=1;return res;
}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){
	int d=30;while((1<<d)>n)d--;return d;
}
 
template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}


class Main{
	public:

	int enc(int a0,int a1,int a2){
		return a0*101*10001+a1*10001+a2;
	}
	tuple<int,int,int> dec(int bit){
		return make_tuple(bit/10001/101,(bit/10001)%101,bit%10001);
	}

	int B;vector<int> bs;
	int C;vector<int> cs;
	vector<int> memo;
	void run(){
		vector<int> as(3);cin >> as;

		memo=vector<int>(11*101*10001,-20);
		cin >> B;bs=vector<int>(3);cin >> bs;
		cin >> C;cs=vector<int>(3);cin >> cs;

		int Mv=0;
		memo[enc(as[0],as[1],as[2])]=0;
		priority_queue<pair<int,int>> st;st.push({0,enc(as[0],as[1],as[2])});
		while(!st.empty()){
			int c,t;tie(c,t)=st.top();st.pop();
			if(c<memo[t])continue;
			int a1000,a100,a1;tie(a1000,a100,a1) = dec(t);
			for(int b1000=0;1000*b1000<=B && b1000<=a1000;b1000++)
			for(int b100=0;100*b100+1000*b1000<=B && b100<=a100;b100++){
				int b1=B-1000*b1000-100*b100;
				if(b1>a1)continue;
				int nt=enc(a1000-b1000+bs[0],a100-b100+bs[1],a1-b1+bs[2]);
				if(memo[nt] >= memo[t]+1)continue;
				memo[nt] = memo[t]+1;
				Mv=max(Mv,memo[nt]);
				st.push({memo[nt],nt});
			}
			for(int c1000=0;1000*c1000<=C && c1000<=a1000;c1000++)
			for(int c100=0;100*c100+1000*c1000<=C && c100<=a100;c100++){
				int c1=C-1000*c1000-100*c100;
				if(c1>a1)continue;
				int nt=enc(a1000-c1000+cs[0],a100-c100+cs[1],a1-c1+cs[2]);
				if(memo[nt] >= memo[t]+1)continue;
				memo[nt]=memo[t]+1;
				Mv=max(Mv,memo[nt]);
				st.push({memo[nt],nt});
			}
		}
		cout << Mv <<endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード