結果
問題 | No.768 Tapris and Noel play the game on Treeone |
ユーザー | heno239 |
提出日時 | 2023-04-15 01:14:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 7,071 bytes |
コンパイル時間 | 2,240 ms |
コンパイル使用メモリ | 157,708 KB |
実行使用メモリ | 39,552 KB |
最終ジャッジ日時 | 2024-10-10 15:57:23 |
合計ジャッジ時間 | 6,517 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
30,280 KB |
testcase_01 | AC | 29 ms
30,208 KB |
testcase_02 | AC | 29 ms
30,208 KB |
testcase_03 | AC | 29 ms
30,208 KB |
testcase_04 | AC | 29 ms
30,276 KB |
testcase_05 | AC | 29 ms
30,152 KB |
testcase_06 | AC | 29 ms
30,152 KB |
testcase_07 | AC | 98 ms
35,968 KB |
testcase_08 | AC | 60 ms
33,220 KB |
testcase_09 | AC | 68 ms
33,792 KB |
testcase_10 | AC | 56 ms
32,968 KB |
testcase_11 | AC | 149 ms
39,168 KB |
testcase_12 | AC | 146 ms
39,012 KB |
testcase_13 | AC | 139 ms
38,784 KB |
testcase_14 | AC | 144 ms
38,760 KB |
testcase_15 | AC | 158 ms
39,284 KB |
testcase_16 | AC | 157 ms
39,308 KB |
testcase_17 | AC | 164 ms
39,552 KB |
testcase_18 | AC | 109 ms
37,736 KB |
testcase_19 | AC | 109 ms
37,252 KB |
testcase_20 | AC | 106 ms
36,680 KB |
testcase_21 | AC | 102 ms
35,968 KB |
20evil_special_uni1.txt | AC | 142 ms
38,692 KB |
20evil_special_uni2.txt | AC | 134 ms
38,032 KB |
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> #include<chrono> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; //ll mod = 1; //constexpr ll mod = 998244353; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; using ld = long double; typedef pair<ld, ld> LDP; const ld eps = 1e-10; const ld pi = acosl(-1.0); template<typename T> void chmin(T& a, T b) { a = min(a, b); } template<typename T> void chmax(T& a, T b) { a = max(a, b); } template<typename T> vector<T> vmerge(vector<T>& a, vector<T>& b) { vector<T> res; int ida = 0, idb = 0; while (ida < a.size() || idb < b.size()) { if (idb == b.size()) { res.push_back(a[ida]); ida++; } else if (ida == a.size()) { res.push_back(b[idb]); idb++; } else { if (a[ida] < b[idb]) { res.push_back(a[ida]); ida++; } else { res.push_back(b[idb]); idb++; } } } return res; } template<typename T> void cinarray(vector<T>& v) { rep(i, v.size())cin >> v[i]; } template<typename T> void coutarray(vector<T>& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } //mod should be <2^31 struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } bool operator<(modint a, modint b) { return a.n < b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } template<typename T> void addv(vector<T>& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 2000005; bool isp[mn]; vector<int> ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template<typename T> auto prev_itr(set<T>& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template<typename T> auto next_itr(set<T>& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair<modint, modint>; mP operator+(mP a, mP b) { return { a.first + b.first,a.second + b.second }; } mP operator+=(mP& a, mP b) { a = a + b; return a; } mP operator-(mP a, mP b) { return { a.first - b.first,a.second - b.second }; } mP operator-=(mP& a, mP b) { a = a - b; return a; } LP operator+(LP a, LP b) { return { a.first + b.first,a.second + b.second }; } LP operator+=(LP& a, LP b) { a = a + b; return a; } LP operator-(LP a, LP b) { return { a.first - b.first,a.second - b.second }; } LP operator-=(LP& a, LP b) { a = a - b; return a; } mt19937 mt(time(0)); const string drul = "DRUL"; string senw = "SENW"; //DRUL,or SENW //int dx[4] = { 1,0,-1,0 }; //int dy[4] = { 0,1,0,-1 }; //----------------------------------------- const int mn = 1 << 18; struct edge { int to; ll cost; }; using Data = int; vector<edge> G[mn]; vector<int> ids[mn]; vector<Data> memo[mn]; int root; Data merge(Data a, Data b) { Data res; // res = a & b; // return res; } Data dfs(int id, int fr) { Data res; // //initialize res = 0; // for (edge e : G[id]) { if (e.to == fr)continue; Data nex = dfs(e.to, id); // //update with edge // if (!nex)res = 1; ids[id].push_back(e.to); memo[id].push_back(nex); } // //update for return // return res; } vector<int> ans; void invdfs(int id, int fr, Data pre) { vector<Data> v; for (Data d : memo[id])v.push_back(d); if (fr >= 0)v.push_back(pre); int len = v.size(); // //calcurate id's ans bool ad = true; for (auto d : v)if (!d) { ad = false; } if (ad)ans.push_back(id); // vector<Data> le(len + 1); vector<Data> ri(len + 1); // Data init_c = 1; // le[0] = init_c; rep(i, len) { le[i + 1] = merge(le[i], v[i]); } ri[len] = init_c; per(i, len) { ri[i] = merge(ri[i + 1], v[i]); } rep(i, ids[id].size()) { int to = ids[id][i]; Data d = merge(le[i], ri[i + 1]); // //update for return d = !d; // invdfs(to, id, d); } } void yaru() { dfs(root, -1); invdfs(root, -1, 0); } void solve() { int n; cin >> n; rep(i, n - 1) { int a, b; cin >> a >> b; a--; b--; G[a].push_back({ b }); G[b].push_back({ a }); } yaru(); sort(all(ans)); cout << ans.size() << "\n"; rep(i, ans.size()) { cout << ans[i] + 1 << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(12); init_f(); //init(); //while(true) //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }