結果

問題 No.1355 AND OR GAME
ユーザー LayCurse
提出日時 2021-01-17 15:10:52
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 6,244 bytes
コンパイル時間 3,540 ms
コンパイル使用メモリ 216,980 KB
最終ジャッジ日時 2025-01-18 01:03:50
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 95
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S> inline void arrInsert(const int k, int &sz, S a[], const S aval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  a[k] = aval;
}
template<class S, class T> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  a[k] = aval;
  b[k] = bval;
}
template<class S, class T, class U> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
}
template<class S, class T, class U, class V> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U 
    cval, V d[], const V dval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  for(i=sz-1;i>k;i--){
    d[i] = d[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
  d[k] = dval;
}
int N;
long long X;
long long Y;
long long A[200000+1];
int tar[60];
int cur[60];
int res[200000+1];
int main(){
  int i, k;
  int f_and;
  int f_or;
  rd(N);
  rd(X);
  rd(Y);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  arrInsert(0, N, A, X);
  for(i=(0);i<(60);i++){
    if(Y&(1LL<<i)){
      tar[i] =1;
    }
    else{
      tar[i] =0;
    }
  }
  for(k=(N)-1;k>=(0);k--){
    for(i=(0);i<(60);i++){
      if(A[k]&(1LL<<i)){
        cur[i] =1;
      }
      else{
        cur[i] =0;
      }
    }
    f_and = f_or = 1;
    for(i=(0);i<(60);i++){
      if(cur[i] == 1 && tar[i] == 0){
        f_or = 0;
      }
    }
    for(i=(0);i<(60);i++){
      if(cur[i] == 0 && tar[i] == 1){
        f_and = 0;
      }
    }
    if(f_or == f_and  &&  f_and == 0){
      wt_L(-1);
      wt_L('\n');
      return 0;
    }
    if(f_or == f_and  &&  f_and == 1){
      for(i=(1);i<(k);i++){
        res[i-1] = 1;
      }
      res[k-1] = 3;
      {
        int V9aVTaxx;
        if(N-1==0){
          wt_L('\n');
        }
        else{
          for(V9aVTaxx=(0);V9aVTaxx<(N-1-1);V9aVTaxx++){
            wt_L(res[V9aVTaxx]);
            wt_L(' ');
          }
          wt_L(res[V9aVTaxx]);
          wt_L('\n');
        }
      }
      return 0;
    }
    if(k == 0){
      wt_L(-1);
      wt_L('\n');
      return 0;
    }
    if(f_or){
      res[k-1] = 2;
      for(i=(0);i<(60);i++){
        if(cur[i]==0 && tar[i]==0){
          tar[i] = 0;
          continue;
        }
        if(cur[i]==0 && tar[i]==1){
          tar[i] = 1;
          continue;
        }
        if(cur[i]==1 && tar[i]==1){
          tar[i] = 2;
          continue;
        }
      }
    }
    else{
      res[k-1] = 1;
      for(i=(0);i<(60);i++){
        if(cur[i]==0 && tar[i]==0){
          tar[i] = 2;
          continue;
        }
        if(cur[i]==1 && tar[i]==0){
          tar[i] = 0;
          continue;
        }
        if(cur[i]==1 && tar[i]==1){
          tar[i] = 1;
          continue;
        }
      }
    }
  }
  return 0;
}
// cLay version 20210103-1 [bug fixed 1]
// --- original code ---
// int N; ll X, Y, A[2d5+1];
// int tar[60], cur[60];
// int res[2d5+1];
// {
//   int f_and, f_or;
//   rd(N,X,Y,A(N));
//   arrInsert(0, N, A, X);
//   rep(i,60) tar[i] = if[Y&(1LL<<i), 1, 0];
//   rrep(k,N){
//     rep(i,60) cur[i] = if[A[k]&(1LL<<i), 1, 0];
//     f_and = f_or = 1;
//     rep(i,60) if(cur[i] == 1 && tar[i] == 0) f_or = 0;
//     rep(i,60) if(cur[i] == 0 && tar[i] == 1) f_and = 0;
//     if(f_or == f_and == 0) wt(-1), return 0;
//     if(f_or == f_and == 1){
//       rep(i,1,k) res[i-1] = 1;
//       res[k-1] = 3;
//       wt(res(N-1));
//       return 0;
//     }
//     if(k == 0) wt(-1), return 0;
//     if(f_or){
//       res[k-1] = 2;
//       rep(i,60){
//         if(cur[i]==0 && tar[i]==0) tar[i] = 0, continue;
//         if(cur[i]==0 && tar[i]==1) tar[i] = 1, continue;
//         if(cur[i]==1 && tar[i]==1) tar[i] = 2, continue;
//       }
//     } else {
//       res[k-1] = 1;
//       rep(i,60){
//         if(cur[i]==0 && tar[i]==0) tar[i] = 2, continue;
//         if(cur[i]==1 && tar[i]==0) tar[i] = 0, continue;
//         if(cur[i]==1 && tar[i]==1) tar[i] = 1, continue;
//       }
//     }
//   }
// }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0