結果

問題 No.2165 Let's Play Nim!
ユーザー siganaisiganai
提出日時 2022-12-21 10:14:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 166 ms / 2,000 ms
コード長 5,914 bytes
コンパイル時間 1,985 ms
コンパイル使用メモリ 214,196 KB
実行使用メモリ 25,220 KB
平均クエリ数 863.56
最終ジャッジ日時 2024-11-18 02:38:18
合計ジャッジ時間 14,262 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
24,940 KB
testcase_01 AC 110 ms
24,940 KB
testcase_02 AC 121 ms
24,812 KB
testcase_03 AC 74 ms
24,940 KB
testcase_04 AC 20 ms
25,196 KB
testcase_05 AC 23 ms
24,940 KB
testcase_06 AC 22 ms
25,052 KB
testcase_07 AC 23 ms
24,812 KB
testcase_08 AC 77 ms
25,208 KB
testcase_09 AC 19 ms
24,952 KB
testcase_10 AC 25 ms
25,208 KB
testcase_11 AC 119 ms
24,940 KB
testcase_12 AC 103 ms
24,812 KB
testcase_13 AC 19 ms
24,940 KB
testcase_14 AC 23 ms
24,812 KB
testcase_15 AC 19 ms
25,196 KB
testcase_16 AC 95 ms
24,940 KB
testcase_17 AC 51 ms
24,812 KB
testcase_18 AC 166 ms
25,196 KB
testcase_19 AC 19 ms
24,824 KB
testcase_20 AC 23 ms
25,208 KB
testcase_21 AC 41 ms
24,580 KB
testcase_22 AC 34 ms
24,580 KB
testcase_23 AC 32 ms
24,836 KB
testcase_24 AC 29 ms
24,964 KB
testcase_25 AC 67 ms
25,220 KB
testcase_26 AC 131 ms
24,940 KB
testcase_27 AC 37 ms
24,940 KB
testcase_28 AC 54 ms
25,196 KB
testcase_29 AC 19 ms
24,556 KB
testcase_30 AC 18 ms
24,556 KB
testcase_31 AC 18 ms
25,196 KB
testcase_32 AC 75 ms
24,556 KB
evil_2_big_1.txt AC 1,361 ms
24,556 KB
evil_2_big_2.txt AC 1,503 ms
24,812 KB
evil_2_big_3.txt AC 1,333 ms
25,196 KB
evil_big_1.txt AC 1,448 ms
24,836 KB
evil_big_2.txt AC 1,476 ms
24,580 KB
evil_big_3.txt AC 1,491 ms
24,964 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return a + b; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr int mod = 1000000007;
//constexpr int mod = 998244353;
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};



int main() {
    INT(n);
    VEC(int,a,n);
    auto ask = [](int id,int k) {
        cout << id + 1 << " " << k << endl;
        INT(ret);
        return ret;
    };
    int xo = 0;
    vector<set<int>> ss(17);
    rep(i,n) {
        xo ^= a[i];
        rep(j,17) {
            if(a[i] >> j & 1) ss[j].insert(i);
        }
    }
    if(xo) {
        cout << 1 << endl;
        rrep(i,17) {
            if((int)ss[i].size() % 2) {
                int id = *ss[i].begin();
                int k = a[id] - (a[id] ^ xo);
                int ret = ask(id,k);
                if(ret == -1) return 0;
                xo ^= a[id] ^ (a[id] - k);
                rep(j,17) {
                    if((a[id] >> j & 1) && (((a[id] - k) >> j & 1) == 0)) ss[j].erase(id);
                    if(((a[id] >> j & 1) == 0) && ((a[id] - k) >> j & 1)) ss[j].insert(id);
                }
                a[id] -= k;
            }
        }
    }
    else cout << 0 << endl;
    while(1) {
        INT(id,k);
        INT(ret);
        if(ret == -1) return 0;
        id--;
        xo ^= a[id] ^ (a[id] - k);
        rep(j,17) {
            if((a[id] >> j & 1) && (((a[id] - k) >> j & 1) == 0)) ss[j].erase(id);
            if(((a[id] >> j & 1) == 0) && ((a[id] - k) >> j & 1)) ss[j].insert(id);
        }
        a[id] -= k;
        rrep(i,17) {
            if((int)ss[i].size() % 2) {
                int id = *ss[i].begin();
                int k = a[id] - (a[id] ^ xo);
                int ret = ask(id,k);
                if(ret == -1) return 0;
                xo ^= a[id] ^ (a[id] - k);
                rep(j,17) {
                    if((a[id] >> j & 1) && (((a[id] - k) >> j & 1) == 0)) ss[j].erase(id);
                    if(((a[id] >> j & 1) == 0) && ((a[id] - k) >> j & 1)) ss[j].insert(id);
                }
                a[id] -= k;
            }
        }
    }
}
0