#356206 (C++14) No.715 集合と二人ゲーム

提出ソース

結果

問題	No.715 集合と二人ゲーム
ユーザー	fumiphys
提出日時	2019-07-02 22:13:27
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,141 bytes
コンパイル時間	2,019 ms
コンパイル使用メモリ	178,448 KB
実行使用メモリ	7,184 KB
最終ジャッジ日時	2024-09-13 20:03:09
合計ジャッジ時間	6,008 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	3 ms 5,376 KB
testcase_04	AC	3 ms 5,376 KB
testcase_05	AC	4 ms 5,376 KB
testcase_06	AC	4 ms 5,376 KB
testcase_07	AC	5 ms 5,376 KB
testcase_08	WA	-
testcase_09	AC	5 ms 5,376 KB
testcase_10	AC	5 ms 5,376 KB
testcase_11	AC	6 ms 5,376 KB
testcase_12	AC	6 ms 5,376 KB
testcase_13	AC	6 ms 5,376 KB
testcase_14	AC	7 ms 5,376 KB
testcase_15	AC	7 ms 5,376 KB
testcase_16	WA	-
testcase_17	AC	7 ms 5,376 KB
testcase_18	AC	8 ms 5,376 KB
testcase_19	AC	8 ms 5,376 KB
testcase_20	AC	9 ms 5,376 KB
testcase_21	AC	9 ms 5,376 KB
testcase_22	AC	9 ms 5,376 KB
testcase_23	AC	10 ms 5,376 KB
testcase_24	AC	11 ms 5,376 KB
testcase_25	AC	10 ms 5,376 KB
testcase_26	AC	10 ms 5,376 KB
testcase_27	AC	11 ms 5,376 KB
testcase_28	AC	12 ms 5,376 KB
testcase_29	AC	12 ms 5,376 KB
testcase_30	AC	10 ms 5,376 KB
testcase_31	AC	10 ms 5,376 KB
testcase_32	AC	9 ms 5,376 KB
testcase_33	AC	10 ms 5,376 KB
testcase_34	AC	9 ms 5,376 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	AC	2 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	2 ms 5,376 KB
testcase_39	AC	2 ms 5,376 KB
testcase_40	AC	2 ms 5,376 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	2 ms 5,376 KB
testcase_43	AC	2 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB
testcase_48	AC	3 ms 5,376 KB
testcase_49	AC	2 ms 5,376 KB
testcase_50	AC	60 ms 7,108 KB
testcase_51	AC	60 ms 7,112 KB
testcase_52	AC	59 ms 7,156 KB
testcase_53	AC	59 ms 7,132 KB
testcase_54	AC	59 ms 7,140 KB
testcase_55	AC	60 ms 7,040 KB
testcase_56	AC	57 ms 6,912 KB
testcase_57	AC	53 ms 6,784 KB
testcase_58	WA	-
testcase_59	AC	60 ms 7,040 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

int dp[101];

int dp_(int i){
  if(i < 34)return dp[i];
  return dp[i % 34 + 34];
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); vector<ll> a(n); cin >> a;
  dp[0] = 0;
  dp[1] = 1;
  for(int i = 2; i <= 100; i++){
    set<int> st;
    if(i > 1)st.insert(dp[i-2]);
    for(int k = 0; k <= i - 3; k++){
      st.insert(dp[k] ^ dp[i-k-3]);
    }
    rep(j, sz(st) + 3){
      if(st.find(j) == st.end()){
        dp[i] = j;
        break;
      }
    }
    //cout << i << " " << dp[i] << endl;
  }
  int res = 0;
  int curr = 0;
  sort(all(a));
  //cout << a << endl;
  rep(i, n){
    if(i > 0 && a[i] > a[i-1] + 1){
      res ^= dp_(curr);
      curr = 0;
    }
    curr++;
  }
  if(curr)res ^= dp_(curr);
  if(res)cout << "First" << endl;
  else cout << "Second" << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード