#606876 (C++17) No.1355 AND OR GAME

提出ソース

結果

問題	No.1355 AND OR GAME
ユーザー	👑 tute7627
提出日時	2021-01-17 17:32:18
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	278 ms / 2,000 ms
コード長	3,798 bytes
コンパイル時間	2,372 ms
コンパイル使用メモリ	211,092 KB
実行使用メモリ	108,612 KB
最終ジャッジ日時	2024-05-07 07:03:48
合計ジャッジ時間	18,853 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	3 ms 6,948 KB
testcase_03	AC	3 ms 6,944 KB
testcase_04	AC	3 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	4 ms 6,948 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	4 ms 6,944 KB
testcase_09	AC	3 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	1 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 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	2 ms 6,944 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,940 KB
testcase_33	AC	1 ms 6,940 KB
testcase_34	AC	29 ms 13,696 KB
testcase_35	AC	278 ms 108,480 KB
testcase_36	AC	253 ms 100,212 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	274 ms 108,476 KB
testcase_39	AC	96 ms 44,416 KB
testcase_40	AC	132 ms 54,064 KB
testcase_41	AC	274 ms 108,480 KB
testcase_42	AC	256 ms 108,484 KB
testcase_43	AC	157 ms 71,168 KB
testcase_44	AC	43 ms 18,688 KB
testcase_45	AC	276 ms 108,480 KB
testcase_46	AC	103 ms 42,484 KB
testcase_47	AC	277 ms 108,612 KB
testcase_48	AC	197 ms 78,912 KB
testcase_49	AC	276 ms 108,480 KB
testcase_50	AC	2 ms 6,940 KB
testcase_51	AC	141 ms 56,056 KB
testcase_52	AC	244 ms 96,752 KB
testcase_53	AC	170 ms 67,420 KB
testcase_54	AC	275 ms 108,608 KB
testcase_55	AC	235 ms 106,228 KB
testcase_56	AC	235 ms 106,340 KB
testcase_57	AC	196 ms 76,888 KB
testcase_58	AC	55 ms 23,424 KB
testcase_59	AC	2 ms 6,944 KB
testcase_60	AC	185 ms 73,572 KB
testcase_61	AC	2 ms 6,944 KB
testcase_62	AC	117 ms 53,632 KB
testcase_63	AC	276 ms 108,484 KB
testcase_64	AC	236 ms 106,320 KB
testcase_65	AC	4 ms 6,940 KB
testcase_66	AC	80 ms 37,888 KB
testcase_67	AC	88 ms 36,352 KB
testcase_68	AC	86 ms 36,016 KB
testcase_69	AC	2 ms 6,944 KB
testcase_70	AC	103 ms 43,024 KB
testcase_71	AC	276 ms 108,476 KB
testcase_72	AC	274 ms 108,604 KB
testcase_73	AC	276 ms 108,604 KB
testcase_74	AC	277 ms 108,480 KB
testcase_75	AC	275 ms 108,484 KB
testcase_76	AC	277 ms 108,604 KB
testcase_77	AC	275 ms 108,480 KB
testcase_78	AC	2 ms 6,944 KB
testcase_79	AC	2 ms 6,948 KB
testcase_80	AC	275 ms 108,480 KB
testcase_81	AC	276 ms 108,608 KB
testcase_82	AC	274 ms 108,476 KB
testcase_83	AC	234 ms 106,108 KB
testcase_84	AC	42 ms 34,944 KB
testcase_85	AC	122 ms 82,916 KB
testcase_86	AC	78 ms 52,700 KB
testcase_87	AC	70 ms 46,944 KB
testcase_88	AC	7 ms 6,944 KB
testcase_89	AC	5 ms 6,944 KB
testcase_90	AC	152 ms 103,256 KB
testcase_91	AC	17 ms 14,336 KB
testcase_92	AC	9 ms 8,064 KB
testcase_93	AC	109 ms 86,828 KB
testcase_94	AC	64 ms 52,480 KB
testcase_95	AC	50 ms 38,272 KB
testcase_96	AC	36 ms 29,952 KB
testcase_97	AC	7 ms 7,552 KB
testcase_98	AC	136 ms 106,068 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,x,y;cin>>n>>x>>y;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  ll sz=61;
  auto dp=make_v(n+1,sz,-1LL);
  dp[0][popcount(x)]=x;
  rep(i,0,n){
    dp[i+1][popcount(a[i])]=a[i];
    rep(j,0,sz){
      if(dp[i][j]==-1)continue;
      dp[i+1][popcount(dp[i][j]|a[i])]=dp[i][j]|a[i];
      dp[i+1][popcount(dp[i][j]&a[i])]=dp[i][j]&a[i];
    }
  }
  //debug(dp,n+1,sz);
  if(dp[n][popcount(y)]!=y)cout<<-1<<endl;
  else{
    ll now=y;
    vector<ll>v;
    rrep(i,0,n){
      if(now==a[i]){
        v.PB(3);
        rep(j,0,sz){
          if(dp[i][j]!=-1)now=dp[i][j];
        }
        continue;
      }
      rep(j,0,sz){
        if(dp[i][j]==-1)continue;
        if((dp[i][j]&a[i])==now){
          v.PB(1);
          now=dp[i][j];
          break;
        }
        if((dp[i][j]|a[i])==now){
          v.PB(2);
          now=dp[i][j];
          break;
        }
      }
    }
    reverse(ALL(v));
    debug(v,n);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード