結果
| 問題 | No.1153 ねこちゃんゲーム |
| コンテスト | |
| ユーザー |
 coindarw
|
| 提出日時 | 2026-05-15 03:51:45 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 388 ms / 2,500 ms |
| コード長 | 10,381 bytes |
| 記録 | |
| コンパイル時間 | 8,530 ms |
| コンパイル使用メモリ | 385,276 KB |
| 実行使用メモリ | 78,240 KB |
| 最終ジャッジ日時 | 2026-05-15 03:52:26 |
| 合計ジャッジ時間 | 34,804 ms |
|
ジャッジサーバーID （参考情報） |
judge3_1 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 40 |
ソースコード
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif
using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;
// clang-format off
using vint = vector<int>;using vvint = vector<vector<int>>;using vvvint = vector<vector<vector<int>>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;using vvvll = vector<vector<vector<ll>>>;
using vlll = vector<lll>;using vvlll = vector<vector<lll>>;using vvvlll = vector<vector<vector<lll>>>;
using vchar = vector<char>;using vvchar = vector<vector<char>>;using vvvchar = vector<vector<vector<char>>>;
using vstr = vector<string>;using vvstr = vector<vector<string>>;using vvvstr = vector<vector<vector<string>>>;
using vpi = vector<pair<int, int>>;using vvpi = vector<vector<pair<int, int>>>;using vvpint = vector<vector<pair<int, int>>>;
using vpl = vector<pair<ll, ll>>;using vvpl = vector<vector<pair<ll, ll>>>;using vvplint = vector<vector<pair<ll, int>>>;
using vbool = vector<bool>;using vvbool = vector<vector<bool>>;using vvvbool = vector<vector<vector<bool>>>;
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}
template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }
template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}
template <typename T>void oupl(const T& a) {cout << a;}
template <typename T, typename... Args>void oupl(const T& a, const Args&... args) {cout << a << " ", oupl(args...);}
inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
auto minE(const auto&a) {
return min_element(a.begin(), a.end());
}
auto maxE(const auto&a) {
return max_element(a.begin(), a.end());
}
#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on
template <typename T>
struct BIT {
int n;
vector<T> data;
BIT(int n) : n(n), data(n + 1, 0) {}
BIT() {}
void add(int i, T x = 1) {
for (i++; i <= n; i += (i & -i)) data[i] += x;
}
T sum(int i) {
T s(0);
for (i++; i; i -= (i & -i)) s += data[i];
return s;
}
T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
T get(int i) { return sum(i) - sum(i - 1); }
int lower_bound(T w) {
if (w <= 0) {
return 0;
}
int x = 0, r = 1;
while (r < n) r <<= 1;
for (int len = r; len > 0; len >>= 1) {
if (x + len <= n && data[x + len] < w) {
w -= data[x + len];
x += len;
}
}
return x;
}
};
struct Mex {
int n;
BIT<int> bit;
vector<int> cnt;
Mex(int nn) : n(nn), bit(n + 1), cnt(n + 1) {
for (int i = 0; i < n + 1; ++i) bit.add(i, 1);
}
void add(int x) {
if (x > n) return;
if (cnt[x] == 0) bit.add(x, -1);
cnt[x]++;
}
void remove(int x) {
if (x > n) return;
cnt[x]--;
if (cnt[x] == 0) bit.add(x, 1);
}
int mex() { return bit.lower_bound(1); }
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
inp(n, m);
vll a(m);
inp(a);
a = add1(a, -1);
struct edge {
int to;
ll exMex; // 辺(from,to)を除いたときの、from頂点を親とする木のGrundy数
edge(int _to) : to(_to), exMex(-1) {}
};
vector<vector<edge>> G(n);
rep(i, n - 1) {
int u, v;
inp(u, v);
u--, v--;
G[u].eb(v);
G[v].eb(u);
}
if (n == 1) {
oup(-1, -1);
return 0;
}
vint grundy1(n); // 頂点0を根とする部分木を考えた時の、頂点iを根とする子部分木のGrundy数
vint parent(n, -1);
vint num(n, -1); // 親から見て自分が何番目の子か
vint ord;
auto dfs = [&](auto dfs, int u, int p = -1) -> int {
Mex mex(ssize(G[u]));
rep(i, ssize(G[u])) {
const auto& e = G[u][i];
if (e.to == p) {
continue;
}
parent[e.to] = u;
num[e.to] = i;
mex.add(dfs(dfs, e.to, u));
}
ord.eb(u);
return grundy1[u] = mex.mex();
};
dfs(dfs, 0);
reverse(all(ord));
vint grundy2(n); // 頂点iを根としたときのGrundy数
for (int u : ord) {
Mex mex(ssize(G[u]));
if (u != 0) { // 親から見た自分を除いたmex
mex.add(G[parent[u]][num[u]].exMex);
}
for (const auto& e : G.at(u)) { // それぞれの子を親とする部分木のgrundy数を入れていく
if (e.to == parent[u]) continue;
mex.add(grundy1[e.to]);
}
grundy2[u] = mex.mex();
for (auto& e : G.at(u)) { // 各
int mx = e.to == parent[u] ? G[parent[u]][num[u]].exMex : grundy1[e.to];
mex.remove(mx);
e.exMex = mex.mex();
mex.add(mx);
}
}
debug(grundy2);
// {
// auto dfs2 = [&](auto dfs2, int u, int p = -1) -> int {
// Mex mex(ssize(G[u]));
// rep(i, ssize(G[u])) {
// const auto& e = G[u][i];
// if (e.to == p) continue;
// mex.add(dfs2(dfs2, e.to, u));
// }
// return mex.mex();
// };
// vint tmp(n);
// rep(i, n) tmp[i] = dfs2(dfs2, i);
// debug(tmp);
// }
int x = 0;
rep(i, m) { x ^= grundy2[a[i]]; }
if (x == 0) {
oup(-1, -1);
} else {
debug(x);
set<int> seen;
rep(i, m) {
if (seen.contains(a[i])) continue;
seen.insert(a[i]);
rep(j, ssize(G[a[i]])) {
const auto& e = G[a[i]][j];
int mx = e.to == parent[a[i]] ? G[parent[a[i]]][num[a[i]]].exMex : grundy1[e.to];
debug(a[i] + 1, e.to + 1, mx);
if ((x ^ mx ^ grundy2[a[i]]) == 0) {
oup(i + 1, e.to + 1);
return 0;
}
}
}
}
}