結果
問題 | No.1355 AND OR GAME |
ユーザー | blackyuki |
提出日時 | 2021-01-12 18:00:18 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 141 ms / 2,000 ms |
コード長 | 3,236 bytes |
コンパイル時間 | 3,628 ms |
コンパイル使用メモリ | 201,492 KB |
実行使用メモリ | 8,036 KB |
最終ジャッジ日時 | 2023-08-19 18:35:57 |
合計ジャッジ時間 | 20,899 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 3 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,508 KB |
testcase_09 | AC | 2 ms
4,388 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,384 KB |
testcase_13 | AC | 1 ms
4,384 KB |
testcase_14 | AC | 1 ms
4,384 KB |
testcase_15 | AC | 1 ms
4,384 KB |
testcase_16 | AC | 1 ms
4,384 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,388 KB |
testcase_19 | AC | 1 ms
4,388 KB |
testcase_20 | AC | 2 ms
4,384 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,384 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 1 ms
4,384 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 1 ms
4,384 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,384 KB |
testcase_31 | AC | 1 ms
4,380 KB |
testcase_32 | AC | 2 ms
4,384 KB |
testcase_33 | AC | 2 ms
4,384 KB |
testcase_34 | AC | 15 ms
4,384 KB |
testcase_35 | AC | 141 ms
8,012 KB |
testcase_36 | AC | 129 ms
7,256 KB |
testcase_37 | AC | 1 ms
4,380 KB |
testcase_38 | AC | 141 ms
7,732 KB |
testcase_39 | AC | 52 ms
4,572 KB |
testcase_40 | AC | 68 ms
5,120 KB |
testcase_41 | AC | 140 ms
7,792 KB |
testcase_42 | AC | 141 ms
7,804 KB |
testcase_43 | AC | 85 ms
5,148 KB |
testcase_44 | AC | 22 ms
4,384 KB |
testcase_45 | AC | 140 ms
7,796 KB |
testcase_46 | AC | 53 ms
4,856 KB |
testcase_47 | AC | 141 ms
7,772 KB |
testcase_48 | AC | 101 ms
6,512 KB |
testcase_49 | AC | 141 ms
8,036 KB |
testcase_50 | AC | 2 ms
4,388 KB |
testcase_51 | AC | 71 ms
5,472 KB |
testcase_52 | AC | 126 ms
7,304 KB |
testcase_53 | AC | 87 ms
5,952 KB |
testcase_54 | AC | 141 ms
7,848 KB |
testcase_55 | AC | 128 ms
6,252 KB |
testcase_56 | AC | 128 ms
6,188 KB |
testcase_57 | AC | 98 ms
6,180 KB |
testcase_58 | AC | 29 ms
4,384 KB |
testcase_59 | AC | 1 ms
4,380 KB |
testcase_60 | AC | 93 ms
6,196 KB |
testcase_61 | AC | 1 ms
4,384 KB |
testcase_62 | AC | 64 ms
4,688 KB |
testcase_63 | AC | 141 ms
7,772 KB |
testcase_64 | AC | 128 ms
6,328 KB |
testcase_65 | AC | 3 ms
4,384 KB |
testcase_66 | AC | 45 ms
4,572 KB |
testcase_67 | AC | 46 ms
4,700 KB |
testcase_68 | AC | 45 ms
4,380 KB |
testcase_69 | AC | 2 ms
4,512 KB |
testcase_70 | AC | 54 ms
4,884 KB |
testcase_71 | AC | 141 ms
7,908 KB |
testcase_72 | AC | 141 ms
7,840 KB |
testcase_73 | AC | 141 ms
7,788 KB |
testcase_74 | AC | 141 ms
7,732 KB |
testcase_75 | AC | 140 ms
7,788 KB |
testcase_76 | AC | 141 ms
7,832 KB |
testcase_77 | AC | 141 ms
7,768 KB |
testcase_78 | AC | 2 ms
4,388 KB |
testcase_79 | AC | 1 ms
4,384 KB |
testcase_80 | AC | 140 ms
7,908 KB |
testcase_81 | AC | 141 ms
7,792 KB |
testcase_82 | AC | 141 ms
7,768 KB |
testcase_83 | AC | 127 ms
6,268 KB |
testcase_84 | AC | 36 ms
4,380 KB |
testcase_85 | AC | 97 ms
6,396 KB |
testcase_86 | AC | 61 ms
5,220 KB |
testcase_87 | AC | 54 ms
4,932 KB |
testcase_88 | AC | 6 ms
4,384 KB |
testcase_89 | AC | 5 ms
4,504 KB |
testcase_90 | AC | 121 ms
7,592 KB |
testcase_91 | AC | 14 ms
4,384 KB |
testcase_92 | AC | 7 ms
4,380 KB |
testcase_93 | AC | 93 ms
5,620 KB |
testcase_94 | AC | 55 ms
4,692 KB |
testcase_95 | AC | 41 ms
4,388 KB |
testcase_96 | AC | 31 ms
4,384 KB |
testcase_97 | AC | 6 ms
4,508 KB |
testcase_98 | AC | 115 ms
6,200 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(long long i=0;i<(long long)(n);i++) #define REP(i,k,n) for(long long i=k;i<(long long)(n);i++) #define all(a) a.begin(),a.end() #define rsort(a) {sort(all(a));reverse(all(a));} #define pb emplace_back #define eb emplace_back #define lb(v,k) (lower_bound(all(v),(k))-v.begin()) #define ub(v,k) (upper_bound(all(v),(k))-v.begin()) #define fi first #define se second #define pi M_PI #define PQ(T) priority_queue<T> #define SPQ(T) priority_queue<T,vector<T>,greater<T>> #define dame(a) {out(a);return 0;} #define decimal cout<<fixed<<setprecision(15); #define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());} typedef long long ll; typedef pair<ll,ll> P; typedef tuple<ll,ll,ll> PP; typedef tuple<ll,ll,ll,ll> PPP; typedef multiset<ll> S; using vi=vector<ll>; using vvi=vector<vi>; using vvvi=vector<vvi>; using vvvvi=vector<vvvi>; using vp=vector<P>; using vvp=vector<vp>; using vb=vector<bool>; using vvb=vector<vb>; const ll inf=1001001001001001001; const ll INF=1001001001; const ll mod=1000000007; const double eps=1e-10; template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;} template<class T> void out(T a){cout<<a<<'\n';} template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';} template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';} template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);} template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';} template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);} template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);} template<class T> void yesno(T b){if(b)out("yes");else out("no");} template<class T> void YesNo(T b){if(b)out("Yes");else out("No");} template<class T> void YESNO(T b){if(b)out("YES");else out("NO");} template<class T> void noyes(T b){if(b)out("no");else out("yes");} template<class T> void NoYes(T b){if(b)out("No");else out("Yes");} template<class T> void NOYES(T b){if(b)out("NO");else out("YES");} void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);} ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);} ll modpow(ll a,ll b,ll MOD){ll res=1;a%=MOD;while(b){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;} int main(){ ll n,x,y;cin>>n>>x>>y; vi v(n);rep(i,n)cin>>v[i]; assert(1<=n&&n<=200000); assert(0<=x&&x<=1000000000000000000); assert(0<=y&&y<=1000000000000000000); rep(i,n)assert(0<=v[i]&&v[i]<=1000000000000000000); vi md(62); rep(i,62)md[i]=y>>i&1; vi ans(n,1); for(ll i=n-1;i>=0;i--){ bool s=false,t=false; rep(j,62)if((v[i]>>j&1)==1&&md[j]==0)s=true; rep(j,62)if((v[i]>>j&1)==0&&md[j]==1)t=true; if(s&&t)dame(-1); if((!s)&&(!t)){ ans[i]=3; outv(ans);return 0; } if(s){ ans[i]=1; rep(j,62)if(md[j]==0&&(v[i]>>j&1)==0)md[j]=2; } else{ ans[i]=2; rep(j,62)if(md[j]==1&&(v[i]>>j&1)==1)md[j]=2; } } rep(i,62)if(md[i]!=2&&(x>>i&1)!=md[i])dame(-1); outv(ans); }