結果
問題 | No.1017 Reiwa Sequence |
ユーザー | maroon_kuri |
提出日時 | 2020-04-03 22:24:50 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,481 bytes |
コンパイル時間 | 2,174 ms |
コンパイル使用メモリ | 195,288 KB |
実行使用メモリ | 20,736 KB |
最終ジャッジ日時 | 2024-07-03 04:21:03 |
合計ジャッジ時間 | 32,136 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
11,148 KB |
testcase_01 | AC | 5 ms
11,184 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 5 ms
11,120 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 4 ms
11,216 KB |
testcase_06 | AC | 6 ms
11,180 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 5 ms
11,240 KB |
testcase_10 | AC | 5 ms
11,272 KB |
testcase_11 | AC | 5 ms
11,172 KB |
testcase_12 | AC | 5 ms
11,484 KB |
testcase_13 | AC | 5 ms
11,256 KB |
testcase_14 | AC | 5 ms
11,420 KB |
testcase_15 | AC | 5 ms
11,316 KB |
testcase_16 | AC | 6 ms
11,252 KB |
testcase_17 | AC | 7 ms
11,832 KB |
testcase_18 | AC | 5 ms
11,204 KB |
testcase_19 | AC | 90 ms
20,540 KB |
testcase_20 | AC | 99 ms
20,736 KB |
testcase_21 | AC | 96 ms
20,300 KB |
testcase_22 | AC | 99 ms
20,684 KB |
testcase_23 | AC | 91 ms
20,196 KB |
testcase_24 | AC | 93 ms
20,300 KB |
testcase_25 | AC | 94 ms
20,224 KB |
testcase_26 | AC | 89 ms
20,156 KB |
testcase_27 | AC | 16 ms
13,160 KB |
testcase_28 | AC | 9 ms
11,840 KB |
testcase_29 | AC | 5 ms
11,248 KB |
testcase_30 | AC | 15 ms
12,988 KB |
testcase_31 | AC | 6 ms
11,728 KB |
testcase_32 | AC | 25 ms
14,000 KB |
testcase_33 | AC | 27 ms
14,192 KB |
testcase_34 | AC | 2 ms
6,944 KB |
testcase_35 | AC | 2 ms
6,944 KB |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 17 ms
13,068 KB |
testcase_38 | AC | 17 ms
13,200 KB |
testcase_39 | AC | 17 ms
13,080 KB |
testcase_40 | AC | 61 ms
18,300 KB |
testcase_41 | AC | 59 ms
18,176 KB |
testcase_42 | AC | 60 ms
18,136 KB |
testcase_43 | AC | 58 ms
18,180 KB |
testcase_44 | AC | 57 ms
18,168 KB |
testcase_45 | AC | 59 ms
18,168 KB |
testcase_46 | AC | 58 ms
18,008 KB |
testcase_47 | AC | 62 ms
17,976 KB |
testcase_48 | AC | 26 ms
7,936 KB |
testcase_49 | AC | 91 ms
17,280 KB |
testcase_50 | AC | 28 ms
7,936 KB |
testcase_51 | AC | 5 ms
11,300 KB |
testcase_52 | WA | - |
testcase_53 | WA | - |
ソースコード
#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 #define si(x) int(x.size()) #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__,##__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<<"}"; } template<class t> void print(t 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"<<"\n"; #else cout<<"Yes"<<"\n"; #endif if(ex)exit(0); } void no(bool ex=true){ #ifdef CAPITAL cout<<"NO"<<"\n"; #else cout<<"No"<<"\n"; #endif if(ex)exit(0); } void possible(bool ex=true){ #ifdef CAPITAL cout<<"POSSIBLE"<<"\n"; #else cout<<"Possible"<<"\n"; #endif if(ex)exit(0); } void impossible(bool ex=true){ #ifdef CAPITAL cout<<"IMPOSSIBLE"<<"\n"; #else cout<<"Impossible"<<"\n"; #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; } ll mask(int i){ return (ll(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 mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count()); #endif return uniform_int_distribution<ll>(l, r)(gen); } template<class t> void myshuffle(vc<t>&a){ rep(i,si(a))swap(a[i],a[rand_int(0,i)]); } template<class t> int lwb(const vc<t>&v,const t&a){ return lower_bound(all(v),a)-v.bg; } int n; vi raw; void answer(vi x){ dmp(x); /*assert(x!=vi(n)); rep(i,n)assert(x[i]==0||abs(x[i])==raw[i]); assert(accumulate(all(x),int(0))==0);*/ yes(0); print(x); exit(0); } signed main(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20); cin>>n; vi a=readvi(n); raw=a; { map<int,int> pre; rep(i,n){ if(pre.count(a[i])){ vi ans(n); ans[pre[a[i]]]=a[i]; ans[i]=-a[i]; answer(ans); } pre[a[i]]=i; } } sort(all(a)); const int Vmax=ten(6); vi dp(Vmax,-1); dp[0]=-2; auto restore=[&](int t){ vi r; while(t){ int u=dp[t]; r.pb(u); t-=u; } return r; }; auto getans=[&](vi r){ sort(all(r)); vi buf(n); rep(i,n)if(binary_search(all(r),raw[i])){ buf[i]=raw[i]; } return buf; }; auto getdif=[&](vi x,vi y){ vi z(n); rep(i,n)z[i]=x[i]-y[i]; return z; }; vi cur{0}; for(auto x:a){ vi tmp; for(auto v:cur){ if(v+x<Vmax){ if(dp[v+x]==-1){ dp[v+x]=x; tmp.pb(v+x); }else{ vi waf=restore(v+x); vi relka=restore(v); relka.pb(x); answer(getdif(getans(waf),getans(relka))); } tmp.pb(v); } } sort(all(tmp),greater<int>()); cur.swap(tmp); } vc<pi> buf(1<<n); rep(bit,1<<n){ int s=0; rep(i,n)if((bit>>i)&1)s+=a[i]; buf[bit]=pi(s,bit); } sort(all(buf)); rep(i,(1<<n)-1){ if(buf[i].a==buf[i+1].a){ int u=buf[i].b^buf[i+1].b; vi ans(n); rep(j,n)ans[j]=(u>>j)&1; answer(ans); } } no(); }