結果
| 問題 | No.2841 Leaf Eater |
| ユーザー |
 hitonanode
|
| 提出日時 | 2024-08-09 23:19:32 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 44 ms / 2,000 ms |
| コード長 | 10,499 bytes |
| コンパイル時間 | 2,374 ms |
| コンパイル使用メモリ | 194,744 KB |
| 実行使用メモリ | 23,040 KB |
| 最終ジャッジ日時 | 2024-08-09 23:19:40 |
| 合計ジャッジ時間 | 4,045 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 23 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <memory>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#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> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endifint mex(const vector<int> &v) {const int N = v.size();vector<int> mex(N + 1);for (int x : v) {if (x < N) mex.at(x) = 1;}REP(i, N + 1) {if (!mex.at(i)) return i;}assert(false);}int calc_grundy(const vector<int> &par) {const int N = par.size();vector<int> grundy(1 << N, -1);grundy.at(1) = 0;FOR(S, 2, 1 << N) {bool bad = false;int is_leaf = S;REP(i, N) {if (!((S >> i) & 1)) continue;const int p = par.at(i);if (p == -1) continue;if (!((S >> p) & 1)) bad = true;is_leaf &= ~(1 << p);}if (bad) continue;// vector<int> gs;int gsmask = 0;for (int leaf = is_leaf; leaf; leaf = (leaf - 1) & is_leaf) {gsmask |= 1 << grundy.at(S ^ leaf);// gs.push_back(grundy.at(S ^ leaf));}int g = 0;while (gsmask & (1 << g)) ++g;grundy.at(S) = g;// grundy.at(S) = mex(gs);}return grundy.back();}struct rand_int_ {using lint = long long;std::mt19937 mt;rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}lint operator()(lint x) { return this->operator()(0, x); } // [0, x)lint operator()(lint l, lint r) {std::uniform_int_distribution<lint> d(l, r - 1);return d(mt);}} rnd;int main() {for (long long ntry = 1;; ntry++) {break;int n = rnd(6, 20);vector<int> par(n, -1);par.at(1) = 0;FOR(i, 2, n) {par.at(i) = rnd(1, i);}if (calc_grundy(par) == 0) {dbg(par);}if (__builtin_popcountll(ntry) == 1) {dbg(ntry);// dbg(par);}}int T;cin >> T;while (T--) {int N;cin >> N;vector<vector<int>> child(N);vector<int> par(N, -1);FOR(i, 1, N) {int p;cin >> p;--p;par.at(i) = p;child.at(p).push_back(i);}// // isP[v] = 「v の部分木ゲームで、させない方が負けのルールで、後手が勝てるか？」// // isN[v] = 「v の部分木ゲームで、させない方が勝ちのルールで、後手が勝てるか？」// vector<int> isP(N), isN(N);// auto rec = [&](auto &&self, int now) -> void {// if (child.at(now).empty()) {// isP.at(now) = 1;// return;// }// for (int nxt : child.at(now)) {// self(self, nxt);// }// isP.at(now) = 1;// isN.at(now) = 1;// for (int nxt : child.at(now)) {// if (!isN.at(nxt)) isP.at(now) = 0;// if (!isP.at(nxt)) isN.at(now) = 0;// }// };// rec(rec, 0);// dbg(isP);// dbg(isN);vector<int> mods;auto check = [&](int x) -> bool {if (child.at(x).empty()) return false;bool res = true;auto rec = [&](auto &&self, int now, bool sgn) -> void {if (child.at(now).size() > 1) sgn = false;for (int nxt : child.at(now)) { self(self, nxt, !sgn); }if (child.at(now).size() != 1 and sgn) res = false;};rec(rec, x, true);return res;};bool is_p = true;for (int c : child.at(0)) {if (!check(c)) {// dbg(c);is_p = false;break;}}if (sort_unique(mods).size() > 1) is_p = false;// auto g = calc_grundy(par);cout << (is_p ? "Second" : "First") << '\n';}}