結果

問題 No.3120 Lower Nim
コンテスト
ユーザー rui_er
提出日時 2025-04-20 14:15:06
言語 C++17
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 357 ms / 2,000 ms
コード長 3,840 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,255 ms
コンパイル使用メモリ 196,480 KB
実行使用メモリ 25,972 KB
平均クエリ数 2685.91
最終ジャッジ日時 2025-04-20 14:15:19
合計ジャッジ時間 12,428 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

// Problem: No.3120 Lower Nim
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/3120
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//By: OIer rui_er
#include <bits/stdc++.h>
#define rep(x, y, z) for(int x = (y); x <= (z); ++x)
#define per(x, y, z) for(int x = (y); x >= (z); --x)
#define debug(format...) fprintf(stderr, format)
#define fileIO(s) do {freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);} while(false)
// #define endl '\n'
using namespace std;
typedef long long ll;

mt19937 rnd(std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
    uniform_int_distribution<int> dist(L, R);
    return dist(rnd);
}

template<typename T> void chkmin(T& x, T y) {if(y < x) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

template<int mod>
inline unsigned int down(unsigned int x) {
	return x >= mod ? x - mod : x;
}

template<int mod>
struct Modint {
	unsigned int x;
	Modint() = default;
	Modint(unsigned int x) : x(x) {}
	friend istream& operator>>(istream& in, Modint& a) {return in >> a.x;}
	friend ostream& operator<<(ostream& out, Modint a) {return out << a.x;}
	friend Modint operator+(Modint a, Modint b) {return down<mod>(a.x + b.x);}
	friend Modint operator-(Modint a, Modint b) {return down<mod>(a.x - b.x + mod);}
	friend Modint operator*(Modint a, Modint b) {return 1ULL * a.x * b.x % mod;}
	friend Modint operator/(Modint a, Modint b) {return a * ~b;}
	friend Modint operator^(Modint a, int b) {Modint ans = 1; for(; b; b >>= 1, a *= a) if(b & 1) ans *= a; return ans;}
	friend Modint operator~(Modint a) {return a ^ (mod - 2);}
	friend Modint operator-(Modint a) {return down<mod>(mod - a.x);}
	friend Modint& operator+=(Modint& a, Modint b) {return a = a + b;}
	friend Modint& operator-=(Modint& a, Modint b) {return a = a - b;}
	friend Modint& operator*=(Modint& a, Modint b) {return a = a * b;}
	friend Modint& operator/=(Modint& a, Modint b) {return a = a / b;}
	friend Modint& operator^=(Modint& a, int b) {return a = a ^ b;}
	friend Modint& operator++(Modint& a) {return a += 1;}
	friend Modint operator++(Modint& a, int) {Modint x = a; a += 1; return x;}
	friend Modint& operator--(Modint& a) {return a -= 1;}
	friend Modint operator--(Modint& a, int) {Modint x = a; a -= 1; return x;}
	friend bool operator==(Modint a, Modint b) {return a.x == b.x;}
	friend bool operator!=(Modint a, Modint b) {return !(a == b);}
};

const int N = 1e4 + 5;

int n, a[N], B, K = 10000;

inline int lowbit(int x) {return x & -x;}

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0); cout.tie(0);
    cin >> n;
    rep(i, 1, n) cin >> a[i];
    for(int b = 1; b <= K; b *= 2) {
        int cnt = 0;
        rep(i, 1, n) cnt += a[i] / b;
        if(cnt & 1) {
            cout << "First" << endl;
            B = b;
            break;
        }
    }
    if(!B) {
        cout << "Second" << endl;
        int i, x;
        cin >> i >> x;
        a[i] -= x;
        K = x;
        int ret;
        cin >> ret;
        if(ret == 1 || ret == -1) return 0;
    }
    while(true) {
        for(int b = 1; b <= K; b *= 2) {
            int cnt = 0;
            rep(i, 1, n) cnt += a[i] / b;
            if(cnt & 1) {
                int pos = 0;
                rep(i, 1, n) if(a[i] >= b) {pos = i; break;}
                cout << pos << " " << b << endl;
                a[pos] -= b;
                K = b;
                int ret;
                cin >> ret;
                if(ret == 1 || ret == -1) return 0;
                break;
            }
        }
        int i, x;
        cin >> i >> x;
        a[i] -= x;
        K = x;
        int ret;
        cin >> ret;
        if(ret == 1 || ret == -1) return 0;
    }
    return 0;
}
0