結果

問題 No.941 商とあまり
ユーザー maroon_kurimaroon_kuri
提出日時 2019-12-04 23:38:00
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 319 ms / 2,000 ms
コード長 4,590 bytes
コンパイル時間 1,812 ms
コンパイル使用メモリ 171,368 KB
実行使用メモリ 17,800 KB
最終ジャッジ日時 2023-08-21 05:51:42
合計ジャッジ時間 13,523 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
17,280 KB
testcase_01 AC 5 ms
7,940 KB
testcase_02 AC 5 ms
7,076 KB
testcase_03 AC 6 ms
7,888 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 3 ms
4,376 KB
testcase_07 AC 24 ms
17,288 KB
testcase_08 AC 22 ms
17,388 KB
testcase_09 AC 21 ms
17,628 KB
testcase_10 AC 30 ms
16,928 KB
testcase_11 AC 28 ms
16,832 KB
testcase_12 AC 26 ms
17,560 KB
testcase_13 AC 284 ms
15,204 KB
testcase_14 AC 113 ms
15,848 KB
testcase_15 AC 127 ms
15,732 KB
testcase_16 AC 96 ms
14,928 KB
testcase_17 AC 319 ms
15,912 KB
testcase_18 AC 130 ms
14,472 KB
testcase_19 AC 122 ms
14,516 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 3 ms
4,384 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 1 ms
4,380 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 52 ms
17,476 KB
testcase_27 AC 48 ms
15,844 KB
testcase_28 AC 126 ms
17,228 KB
testcase_29 AC 142 ms
16,252 KB
testcase_30 AC 141 ms
16,120 KB
testcase_31 AC 114 ms
17,200 KB
testcase_32 AC 15 ms
17,480 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 129 ms
14,404 KB
testcase_35 AC 78 ms
14,092 KB
testcase_36 AC 32 ms
17,456 KB
testcase_37 AC 37 ms
17,520 KB
testcase_38 AC 23 ms
15,148 KB
testcase_39 AC 10 ms
13,808 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,388 KB
testcase_43 AC 15 ms
14,412 KB
testcase_44 AC 16 ms
14,460 KB
testcase_45 AC 73 ms
16,156 KB
testcase_46 AC 73 ms
17,260 KB
testcase_47 AC 58 ms
15,320 KB
testcase_48 AC 2 ms
4,384 KB
testcase_49 AC 45 ms
14,340 KB
testcase_50 AC 11 ms
13,828 KB
testcase_51 AC 10 ms
13,812 KB
testcase_52 AC 10 ms
13,808 KB
testcase_53 AC 10 ms
13,872 KB
testcase_54 AC 74 ms
15,760 KB
testcase_55 AC 58 ms
14,884 KB
testcase_56 AC 70 ms
15,212 KB
testcase_57 AC 17 ms
13,832 KB
testcase_58 AC 45 ms
14,176 KB
testcase_59 AC 24 ms
17,368 KB
testcase_60 AC 24 ms
17,392 KB
testcase_61 AC 21 ms
17,396 KB
testcase_62 AC 28 ms
17,640 KB
testcase_63 AC 25 ms
17,600 KB
testcase_64 AC 42 ms
17,396 KB
testcase_65 AC 43 ms
17,428 KB
testcase_66 AC 42 ms
17,388 KB
testcase_67 AC 42 ms
17,800 KB
testcase_68 AC 39 ms
17,348 KB
testcase_69 AC 60 ms
17,344 KB
testcase_70 AC 60 ms
17,452 KB
testcase_71 AC 60 ms
17,732 KB
testcase_72 AC 59 ms
17,696 KB
testcase_73 AC 59 ms
17,772 KB
testcase_74 AC 80 ms
17,268 KB
testcase_75 AC 79 ms
17,584 KB
testcase_76 AC 79 ms
17,732 KB
testcase_77 AC 78 ms
17,708 KB
testcase_78 AC 80 ms
17,672 KB
testcase_79 AC 101 ms
17,312 KB
testcase_80 AC 101 ms
17,236 KB
testcase_81 AC 104 ms
17,648 KB
testcase_82 AC 101 ms
17,372 KB
testcase_83 AC 99 ms
17,608 KB
testcase_84 AC 130 ms
17,560 KB
testcase_85 AC 126 ms
17,236 KB
testcase_86 AC 127 ms
17,632 KB
testcase_87 AC 125 ms
17,344 KB
testcase_88 AC 128 ms
17,376 KB
testcase_89 AC 153 ms
17,452 KB
testcase_90 AC 153 ms
17,552 KB
testcase_91 AC 157 ms
17,544 KB
testcase_92 AC 153 ms
17,496 KB
testcase_93 AC 147 ms
17,220 KB
testcase_94 AC 37 ms
14,240 KB
testcase_95 AC 146 ms
16,248 KB
testcase_96 AC 151 ms
16,764 KB
testcase_97 AC 176 ms
17,368 KB
testcase_98 AC 3 ms
4,376 KB
testcase_99 AC 57 ms
14,440 KB
testcase_100 AC 132 ms
15,732 KB
testcase_101 AC 2 ms
4,376 KB
testcase_102 AC 2 ms
4,380 KB
testcase_103 AC 120 ms
15,280 KB
testcase_104 AC 7 ms
13,012 KB
testcase_105 AC 7 ms
13,020 KB
testcase_106 AC 1 ms
4,384 KB
testcase_107 AC 7 ms
13,016 KB
testcase_108 AC 7 ms
13,096 KB
testcase_109 AC 7 ms
13,092 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;
}
0