#1077171 (C++23) No.3120 Lower Nim

• 問題: No.3120 Lower Nim
• ユーザー: iomir
• 提出日時: 2025-04-19 17:43:45
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 5,134 bytes
• コンパイル時間: 3,667 ms
• コンパイル使用メモリ: 281,680 KB
• 実行使用メモリ: 26,356 KB
• 平均クエリ数: 1505.93
• 最終ジャッジ日時: 2025-04-19 17:43:58
• 合計ジャッジ時間: 12,113 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 26 WA * 17

ソースコード

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

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;
//using mint=modint1000000007;
//using mint=modint998244353;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=n-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

ll M=1e5;
vll p;

bool solve(){
    ll N;cin>>N;
    vll A(N);rep(i,N) cin>>A[i];
    ll sum=0;for(auto x:A) sum+=x;
    if(sum%2==1){
        cout<<"First"<<endl;
        while(1){
            rep(i,N){
                if(A[i]>0){
                    cout << i+1<<" "<<1 << endl;
                    A[i]--;
                    ll r;cin>>r;
                    if(r!=0){
                        return 0;
                    }
                    break;
                }
            }
            ll i,x;cin>>i>>x;
            A[i-1]-=x;
            ll r;cin>>r;
            if(r!=0){
                return 0;
            }
        }

    }else{
        ll r;
        ll ma=*max_element(all(A));
        ll s=0;rep(i,N) s+=A[i]/2*2;

        if(ma>1){
            if((s/2)%2==1){
                
                ll cnt=0;
                cout<<"First"<<endl;
                rep(i,N){
                    if(A[i]>=2){
                        cout << i+1<<" "<<2 << endl;
                        A[i]-=2;
                        cin>>r;
                        if(r){
                            return 0;
                        }
                        break;
                    }
                }
                bool ok=0;
                while(1){
                    ll i,x;cin>>i>>x;
                    i--;
                    if(x%2==1) ok=1;
                    A[i]-=x;
                    cin>>r;
                    assert(r!=-1);
                    if(r){
                        return 0;
                    }
                    rep(i,N){
                        if(ok){
                            if(A[i]>0){
                                cout<<i+1<<" "<<1<<endl;
                                A[i]--;
                                break;
                            }
                        }else{
                            if(A[i]>=2){
                                cout<<i+1<<" "<<2<<endl;
                                A[i]-=2;
                                break;
                            }
                        }
                    }
                    r;cin>>r;
                    assert(r!=-1);
                    if(r){
                        return 0;
                    }
                }

            }else if(ma<=3){
                
                ll cnt=0;
                cout<<"Second"<<endl;
                bool ok=0;
                bool ok2=0;
                while(1){
                    ll i,x;cin>>i>>x;
                    i--;
                    if(x%2==1) ok=1;
                    if(x%4==2) ok2=1;
                    A[i]-=x;
                    cin>>r;
                    assert(r!=-1);
                    if(r){
                        return 0;
                    }
                    rep(i,N){
                        if(ok){
                            if(A[i]>0){
                                cout<<i+1<<" "<<1<<endl;
                                A[i]--;
                                break;
                            }
                        }else{
                            if(A[i]>=2){
                                cout<<i+1<<" "<<2<<endl;
                                A[i]-=2;
                                break;
                            }
                        }
                    }
                    r;cin>>r;
                    assert(r!=-1);
                    if(r){
                        return 0;
                    }
                }
            }
        
        }else{
            cout<<"Second"<<endl;
                while(1){
                    ll i,x;cin>>i>>x;
                A[i-1]-=x;
                cin>>r;
                assert(r!=-1);
                if(r!=0){
                    return 0;
                }
                rep(i,N){
                    if(A[i]>0){
                        cout << i+1<<" "<<1 << endl;
                        A[i]--;
                        cin>>r;
                        assert(r!=-1);
                        if(r!=0){
                            return 0;
                        }
                        break;
                    }
                }
            }
        }
    }
    return 0;
}




int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll T=1;//cin>>T;
    rep(i,T) solve();
}