結果
問題 | No.768 Tapris and Noel play the game on Treeone |
ユーザー |
![]() |
提出日時 | 2019-01-02 22:57:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 2,629 bytes |
コンパイル時間 | 1,876 ms |
コンパイル使用メモリ | 169,564 KB |
実行使用メモリ | 10,996 KB |
最終ジャッジ日時 | 2024-11-21 22:37:30 |
合計ジャッジ時間 | 4,523 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()//#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;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 (b<a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------/*---------------------------------------------------------------------------------------------------∧_∧∧_∧ (´<_` ) Welcome to My Coding Space!( ´_ゝ`) / ⌒i/ \ | |/ / ̄ ̄ ̄ ̄/ |__(__ニつ/ _/ .| .|____\/____/ (u ⊃---------------------------------------------------------------------------------------------------*/int N;vector<int> E[101010];//---------------------------------------------------------------------------------------------------#define win 1#define lose 0int dp[101010];int dfs1(int cu, int pa = -1) {dp[cu] = win;fore(to, E[cu]) if (to != pa) if (dfs1(to, cu) == win) dp[cu] = lose;return dp[cu];}int ans[101010];void dfs2(int cu, int pa = -1) {ans[cu] = win;fore(to, E[cu]) if (dp[to] == win) ans[cu] = lose;vector<int> wins;fore(to, E[cu]) if (dp[to] == win) wins.push_back(to);if (wins.size() == 0) {dp[cu] = win;fore(to, E[cu]) if (to != pa) dfs2(to, cu);return;} else if(1 < wins.size()) {dp[cu] = lose;fore(to, E[cu]) if (to != pa) dfs2(to, cu);return;} else {fore(to, E[cu]) if (to != pa) {if(wins[0] == to) dp[cu] = win;else dp[cu] = lose;dfs2(to, cu);}return;}}//---------------------------------------------------------------------------------------------------void _main() {cin >> N;rep(i, 0, N - 1) {int a, b; cin >> a >> b;a--; b--;E[a].push_back(b);E[b].push_back(a);}dfs1(0);dfs2(0);vector<int> v;rep(i, 0, N) if (ans[i]) v.push_back(i);int n = v.size();printf("%d\n", n);fore(i, v) printf("%d\n", i + 1);}