#404833 (C++14) No.941 商とあまり

提出ソース

結果

問題	No.941 商とあまり
ユーザー	maroon_kuri
提出日時	2019-12-04 23:38:00
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	299 ms / 2,000 ms
コード長	4,590 bytes
コンパイル時間	1,889 ms
コンパイル使用メモリ	174,980 KB
実行使用メモリ	17,972 KB
最終ジャッジ日時	2024-05-08 11:24:36
合計ジャッジ時間	11,960 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	47 ms 17,480 KB
testcase_01	AC	6 ms 7,880 KB
testcase_02	AC	5 ms 7,096 KB
testcase_03	AC	5 ms 8,220 KB
testcase_04	AC	3 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,948 KB
testcase_07	AC	22 ms 17,524 KB
testcase_08	AC	21 ms 17,500 KB
testcase_09	AC	21 ms 17,660 KB
testcase_10	AC	26 ms 16,872 KB
testcase_11	AC	24 ms 16,968 KB
testcase_12	AC	23 ms 17,852 KB
testcase_13	AC	256 ms 15,320 KB
testcase_14	AC	103 ms 16,212 KB
testcase_15	AC	114 ms 15,996 KB
testcase_16	AC	84 ms 15,000 KB
testcase_17	AC	299 ms 16,140 KB
testcase_18	AC	109 ms 14,612 KB
testcase_19	AC	104 ms 14,708 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	3 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	43 ms 17,740 KB
testcase_27	AC	39 ms 15,996 KB
testcase_28	AC	112 ms 17,504 KB
testcase_29	AC	128 ms 16,336 KB
testcase_30	AC	127 ms 16,412 KB
testcase_31	AC	101 ms 17,356 KB
testcase_32	AC	14 ms 17,520 KB
testcase_33	AC	3 ms 6,944 KB
testcase_34	AC	110 ms 14,424 KB
testcase_35	AC	67 ms 14,192 KB
testcase_36	AC	29 ms 17,588 KB
testcase_37	AC	32 ms 17,476 KB
testcase_38	AC	20 ms 15,296 KB
testcase_39	AC	8 ms 14,156 KB
testcase_40	AC	3 ms 6,944 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	3 ms 6,940 KB
testcase_43	AC	14 ms 14,732 KB
testcase_44	AC	14 ms 14,576 KB
testcase_45	AC	62 ms 16,236 KB
testcase_46	AC	60 ms 17,496 KB
testcase_47	AC	48 ms 15,412 KB
testcase_48	AC	2 ms 6,940 KB
testcase_49	AC	36 ms 14,560 KB
testcase_50	AC	11 ms 13,972 KB
testcase_51	AC	9 ms 13,980 KB
testcase_52	AC	9 ms 13,996 KB
testcase_53	AC	9 ms 13,868 KB
testcase_54	AC	65 ms 15,956 KB
testcase_55	AC	53 ms 14,892 KB
testcase_56	AC	57 ms 15,240 KB
testcase_57	AC	16 ms 13,936 KB
testcase_58	AC	36 ms 14,428 KB
testcase_59	AC	22 ms 17,612 KB
testcase_60	AC	21 ms 17,684 KB
testcase_61	AC	20 ms 17,564 KB
testcase_62	AC	24 ms 17,752 KB
testcase_63	AC	24 ms 17,800 KB
testcase_64	AC	35 ms 17,356 KB
testcase_65	AC	35 ms 17,544 KB
testcase_66	AC	35 ms 17,608 KB
testcase_67	AC	36 ms 17,968 KB
testcase_68	AC	34 ms 17,680 KB
testcase_69	AC	48 ms 17,636 KB
testcase_70	AC	49 ms 17,552 KB
testcase_71	AC	49 ms 17,964 KB
testcase_72	AC	49 ms 17,972 KB
testcase_73	AC	50 ms 17,972 KB
testcase_74	AC	68 ms 17,664 KB
testcase_75	AC	65 ms 17,760 KB
testcase_76	AC	68 ms 17,920 KB
testcase_77	AC	64 ms 17,808 KB
testcase_78	AC	68 ms 17,772 KB
testcase_79	AC	85 ms 17,536 KB
testcase_80	AC	83 ms 17,468 KB
testcase_81	AC	88 ms 17,804 KB
testcase_82	AC	84 ms 17,460 KB
testcase_83	AC	82 ms 17,764 KB
testcase_84	AC	113 ms 17,672 KB
testcase_85	AC	111 ms 17,412 KB
testcase_86	AC	112 ms 17,760 KB
testcase_87	AC	109 ms 17,496 KB
testcase_88	AC	108 ms 17,604 KB
testcase_89	AC	135 ms 17,588 KB
testcase_90	AC	138 ms 17,608 KB
testcase_91	AC	145 ms 17,512 KB
testcase_92	AC	141 ms 17,424 KB
testcase_93	AC	135 ms 17,248 KB
testcase_94	AC	33 ms 14,356 KB
testcase_95	AC	134 ms 16,464 KB
testcase_96	AC	143 ms 17,032 KB
testcase_97	AC	159 ms 17,420 KB
testcase_98	AC	2 ms 6,940 KB
testcase_99	AC	47 ms 14,476 KB
testcase_100	AC	119 ms 15,996 KB
testcase_101	AC	3 ms 6,940 KB
testcase_102	AC	3 ms 6,944 KB
testcase_103	AC	105 ms 15,332 KB
testcase_104	AC	5 ms 13,112 KB
testcase_105	AC	6 ms 13,172 KB
testcase_106	AC	2 ms 6,940 KB
testcase_107	AC	6 ms 13,136 KB
testcase_108	AC	6 ms 13,220 KB
testcase_109	AC	7 ms 13,148 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,"Line:",__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<endl;
	#else
	cout<<"Possible"<<endl;
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<endl;
	#else
	cout<<"Impossible"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

const int xmax=500010;
const int nmax=20;

bool dp[xmax][nmax];

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int n,x;cin>>n>>x;
	int base=1;
	vi a=readvi(n);
	rep(i,n){
		base*=a[i]+1;
		if(base-1>x){
			cout<<string(x,'0')<<endl;
			return 0;
		}
	}
	base--;
	int s=x-base+1;
	vi ok(s);
	if(n==1){
		ok[0]=1;
	}else{
		rep(r,n){
			zero(dp);
			rep(i,n)if(i!=r)dp[0][i]=1;
			rep(i,s){
				bool has=0;
				rep(j,n)if(j!=r)if(dp[i][j]){
					ok[i]=1;
					has=true;
					if(i+a[j]<s)dp[i+a[j]][j]=1;
				}
				if(has){
					rep(j,n)if(j!=r){
						int k=i*(a[j]+1);
						if(k<s)dp[k][j]=1;
					}
				}
			}
		}
	}
	string ans(base-1,'0');
	rep(i,s)ans+='0'+ok[i];
	cout<<ans<<endl;
}

yukicoder

結果

テストケース

ソースコード