結果

問題 No.946 箱箱箱
ユーザー hitonanodehitonanode
提出日時 2019-12-09 00:13:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 366 ms / 2,000 ms
コード長 3,542 bytes
コンパイル時間 1,740 ms
コンパイル使用メモリ 177,352 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-27 02:56:33
合計ジャッジ時間 13,056 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 233 ms
6,940 KB
testcase_04 AC 236 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 234 ms
6,944 KB
testcase_07 AC 235 ms
6,940 KB
testcase_08 AC 238 ms
6,944 KB
testcase_09 AC 290 ms
6,944 KB
testcase_10 AC 230 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 270 ms
6,940 KB
testcase_13 AC 239 ms
6,944 KB
testcase_14 AC 235 ms
6,944 KB
testcase_15 AC 232 ms
6,944 KB
testcase_16 AC 233 ms
6,944 KB
testcase_17 AC 230 ms
6,940 KB
testcase_18 AC 233 ms
6,944 KB
testcase_19 AC 337 ms
6,940 KB
testcase_20 AC 3 ms
6,940 KB
testcase_21 AC 217 ms
6,940 KB
testcase_22 AC 229 ms
6,940 KB
testcase_23 AC 232 ms
6,944 KB
testcase_24 AC 216 ms
6,944 KB
testcase_25 AC 363 ms
6,944 KB
testcase_26 AC 230 ms
6,940 KB
testcase_27 AC 230 ms
6,940 KB
testcase_28 AC 230 ms
6,944 KB
testcase_29 AC 235 ms
6,944 KB
testcase_30 AC 231 ms
6,944 KB
testcase_31 AC 233 ms
6,940 KB
testcase_32 AC 226 ms
6,940 KB
testcase_33 AC 234 ms
6,940 KB
testcase_34 AC 233 ms
6,940 KB
testcase_35 AC 232 ms
6,940 KB
testcase_36 AC 229 ms
6,944 KB
testcase_37 AC 232 ms
6,940 KB
testcase_38 AC 358 ms
6,940 KB
testcase_39 AC 229 ms
6,940 KB
testcase_40 AC 222 ms
6,944 KB
testcase_41 AC 228 ms
6,944 KB
testcase_42 AC 228 ms
6,944 KB
testcase_43 AC 232 ms
6,940 KB
testcase_44 AC 366 ms
6,944 KB
testcase_45 AC 234 ms
6,940 KB
testcase_46 AC 231 ms
6,940 KB
testcase_47 AC 2 ms
6,940 KB
testcase_48 AC 2 ms
6,944 KB
testcase_49 AC 2 ms
6,940 KB
testcase_50 AC 2 ms
6,944 KB
testcase_51 AC 2 ms
6,944 KB
testcase_52 AC 2 ms
6,940 KB
testcase_53 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////

int main()
{
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    reverse(A.begin(), A.end());

    vector<lint> AA(N + 1);
    REP(i, N) AA[i + 1] = AA[i] ^ A[i];

    vector<lint> grundy(N + 1);
    REP(i, N) {
        set<lint> trans;
        REP(j, i + 1) trans.insert(grundy[j] xor (AA[i + 1] ^ AA[j]));
        int g = 0;
        while (trans.count(g)) g++;
        grundy[i + 1] = g;
    }
    cout << (grundy[N] ? "Takahashi" : "Takanashi") << endl;
}
0