結果

問題 No.1153 ねこちゃんゲーム
ユーザー hitonanodehitonanode
提出日時 2020-08-08 20:57:34
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,489 bytes
コンパイル時間 2,564 ms
コンパイル使用メモリ 210,028 KB
最終ジャッジ日時 2025-01-12 18:53:40
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 WA -
testcase_03 AC 3 ms
5,248 KB
testcase_04 WA -
testcase_05 AC 3 ms
5,248 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 307 ms
19,072 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 312 ms
18,432 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 267 ms
28,404 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 159 ms
29,060 KB
testcase_39 AC 168 ms
29,184 KB
testcase_40 WA -
testcase_41 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
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> 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 V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(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> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return
    vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return
    is; }
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 tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},
    tpl); 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; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif
int mex(vector<int> v)
{
sort(v.begin(), v.end());
int ret = 0;
for (auto x : v)
{
if (x == ret) ret++;
if (x > ret) break;
}
return ret;
}
struct rand_int_
{
using lint = long long;
mt19937 mt;
rand_int_() : mt(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)
{
uniform_int_distribution<lint> d(l, r - 1);
return d(mt);
}
} rnd;
int main()
{
int N, M;
cin >> N >> M;
vector<int> A(M);
cin >> A;
for (auto &a : A) a--;
vector<vector<int>> to(N);
int root = rnd(N);
REP(_, N - 1)
{
int u, v;
cin >> u >> v;
u--, v--;
to[u].emplace_back(v);
to[v].emplace_back(u);
}
vector<int> gchild(N), gpar(N, 1e9), grundy(N), par(N, -1);
auto gdfs = [&](auto &&gdfs, int now, int prv) -> void {
vector<int> gs;
for (auto nxt : to[now]) if (nxt != prv)
{
par[nxt] = now;
gdfs(gdfs, nxt, now);
gs.emplace_back(gchild[nxt]);
}
gchild[now] = mex(gs);
};
gdfs(gdfs, root, -1);
auto pardfs = [&](auto &&pardfs, int now, int prv) -> void {
int D = to[now].size();
vector<int> cnt(D + 1);
cnt[min(D, gpar[now])]++;
for (auto nxt : to[now]) if (nxt != prv)
{
int g = min(D, gchild[nxt]);
cnt[g]++;
}
set<int> ok;
REP(i, cnt.size()) if (!cnt[i]) ok.insert(i);
grundy[now] = *ok.begin();
for (auto nxt : to[now]) if (nxt != prv)
{
int g = min(D, gchild[nxt]);
cnt[g]--;
if (!cnt[g]) ok.insert(g);
gpar[nxt] = *ok.begin();
cnt[g]++;
ok.erase(g);
}
for (auto nxt : to[now]) if (nxt != prv) pardfs(pardfs, nxt, now);
};
pardfs(pardfs, root, -1);
dbg(gchild);
dbg(gpar);
dbg(grundy);
int XOR = 0;
for (auto a : A)
{
XOR ^= grundy[a - 1];
}
if (XOR)
{
vector<int> checked(N);
REP(i, A.size())
{
int r = A[i];
if (checked[r]) continue;
checked[r] = 1;
for (auto s : to[r])
{
if (par[r] == s and (grundy[r] ^ gpar[r]) == XOR)
{
cout << i + 1 << ' ' << s + 1 << '\n';
return 0;
}
if (par[r] != s and (grundy[r] ^ gchild[s]) == XOR)
{
cout << i + 1 << ' ' << s + 1 << '\n';
return 0;
}
}
}
}
else puts("-1 -1");
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0