Submission #5893706

---

Source Code Expand

#include <iostream>
using namespace std;
static const int NMAX = 100000;

//Cがラベルの番号、Aが豆の数、gはGrundy数
int N, C[NMAX], A[NMAX], g[NMAX];

int main(){
  cin >> N;
  C[0] = A[0] = g[0] = 0;
  int result = 0;
  for(int i = 1; i <= N - 1; i++){
    cin >> C[i] >> A[i];
    g[i] = 0;
    //茶碗iにおけるGrundy数を求める
    while(true){
      bool d = true;
      for(int j = 1; j <= C[i]; j++){
        if(g[i] == g[i - j]){
          g[i]++;
          d = false;
          break;
        }
      }
      if(d == true)
        break;
    }
    //全体のGrundy数を更新する
    if(A[i]%2==1){
      result=result^g[i];
    }
  }
  if(result > 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}

Submission Info

Judge Result