結果

問題 No.2165 Let's Play Nim!
ユーザー snukesnuke
提出日時 2022-12-16 00:13:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 209 ms / 2,000 ms
コード長 4,025 bytes
コンパイル時間 2,371 ms
コンパイル使用メモリ 209,184 KB
実行使用メモリ 24,336 KB
平均クエリ数 889.67
最終ジャッジ日時 2023-08-09 09:24:44
合計ジャッジ時間 17,412 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
23,784 KB
testcase_01 AC 140 ms
23,628 KB
testcase_02 AC 151 ms
23,532 KB
testcase_03 AC 98 ms
23,352 KB
testcase_04 AC 27 ms
23,940 KB
testcase_05 AC 34 ms
23,340 KB
testcase_06 AC 34 ms
23,772 KB
testcase_07 AC 32 ms
23,424 KB
testcase_08 AC 103 ms
24,048 KB
testcase_09 AC 30 ms
24,024 KB
testcase_10 AC 38 ms
23,784 KB
testcase_11 AC 152 ms
23,928 KB
testcase_12 AC 132 ms
23,652 KB
testcase_13 AC 28 ms
24,276 KB
testcase_14 AC 33 ms
23,592 KB
testcase_15 AC 28 ms
24,072 KB
testcase_16 AC 127 ms
23,652 KB
testcase_17 AC 73 ms
23,352 KB
testcase_18 AC 209 ms
23,664 KB
testcase_19 AC 27 ms
23,496 KB
testcase_20 AC 32 ms
23,592 KB
testcase_21 AC 57 ms
24,324 KB
testcase_22 AC 49 ms
24,324 KB
testcase_23 AC 45 ms
23,352 KB
testcase_24 AC 44 ms
23,772 KB
testcase_25 AC 84 ms
24,288 KB
testcase_26 AC 147 ms
23,424 KB
testcase_27 AC 52 ms
23,388 KB
testcase_28 AC 78 ms
24,024 KB
testcase_29 AC 26 ms
24,336 KB
testcase_30 AC 26 ms
23,604 KB
testcase_31 AC 27 ms
23,988 KB
testcase_32 AC 71 ms
23,664 KB
evil_2_big_1.txt AC 1,547 ms
24,312 KB
evil_2_big_2.txt AC 1,823 ms
23,988 KB
evil_2_big_3.txt AC 1,521 ms
23,496 KB
evil_big_1.txt AC 1,762 ms
23,496 KB
evil_big_2.txt AC 1,852 ms
23,508 KB
evil_big_3.txt AC 1,820 ms
23,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  void solve() {
    int n;
    cin>>n;
    vi a(n);
    cin>>a;
    int x = 0;
    int m = 20;
    vc<unordered_set<int>> st(m);
    auto add = [&](int i) {
      x ^= a[i];
      rep(j,m) if (a[i]>>j&1) st[j].insert(i);
    };
    auto rem = [&](int i) {
      x ^= a[i];
      rep(j,m) if (a[i]>>j&1) st[j].erase(i);
    };
    rep(i,n) add(i);
    auto f = [&]() {
      int j = m-1;
      while (~x>>j&1) j--;
      int i = *st[j].begin();
      rem(i);
      int k = a[i]-x;
      cout<<i+1<<" "<<k<<endl;
      a[i] -= k;
      add(i);

      int ret;
      cin>>ret;
      if (ret == -1) return true;
      return false;
    };
    
    if (x) {
      cout<<1<<endl;
      if (f()) return;
    } else cout<<0<<endl;

    while (1) {
      int i, k;
      cin>>i>>k;
      --i;

      int ret;
      cin>>ret;
      if (ret == -1) break;

      rem(i);
      a[i] -= k;
      add(i);
      
      if (f()) break;
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0