結果
| 問題 | No.1153 ねこちゃんゲーム |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2020-08-07 23:09:17 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 636 ms / 2,500 ms |
| コード長 | 5,157 bytes |
| コンパイル時間 | 17,614 ms |
| コンパイル使用メモリ | 298,056 KB |
| 最終ジャッジ日時 | 2025-01-12 18:08:08 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 40 |
コンパイルメッセージ
main.cpp: In lambda function:
main.cpp:144:3: warning: control reaches end of non-void function [-Wreturn-type]
144 | };
| ^
main.cpp: In lambda function:
main.cpp:149:3: warning: control reaches end of non-void function [-Wreturn-type]
149 | };
| ^
main.cpp: In lambda function:
main.cpp:154:3: warning: control reaches end of non-void function [-Wreturn-type]
154 | };
| ^
ソースコード
//#define _GLIBCXX_DEBUG#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());template< typename sum_t, typename key_t >struct ReRooting {struct Edge {int to;key_t data;sum_t dp, ndp;};using F = function< sum_t(sum_t, sum_t) >;using G = function< sum_t(sum_t, key_t) >;vector< vector< Edge > > g;vector< sum_t > subdp, dp;const sum_t ident;const F f;const G gg;ReRooting(int V, const F f, const G g, const sum_t &ident): g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}void add_edge(int u, int v, const key_t &d) {g[u].emplace_back((Edge) {v, d, ident, ident});g[v].emplace_back((Edge) {u, d, ident, ident});}void add_edge_bi(int u, int v, const key_t &d, const key_t &e) {g[u].emplace_back((Edge) {v, d, ident, ident});g[v].emplace_back((Edge) {u, e, ident, ident});}void dfs_sub(int idx, int par) {for(auto &e : g[idx]) {if(e.to == par) continue;dfs_sub(e.to, idx);subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));}}void dfs_all(int idx, int par, const sum_t &top) {sum_t buff{ident};for(int i = 0; i < (int) g[idx].size(); i++) {auto &e = g[idx][i];e.ndp = buff;e.dp = gg(par == e.to ? top : subdp[e.to], e.data);buff = f(buff, e.dp);}dp[idx] = buff;buff = ident;for(int i = (int) g[idx].size() - 1; i >= 0; i--) {auto &e = g[idx][i];if(e.to != par) dfs_all(e.to, idx, f(e.ndp, buff));e.ndp = f(e.ndp, buff);buff = f(buff, e.dp);}}vector< sum_t > build() {dfs_sub(0, -1);dfs_all(0, -1, ident);return dp;}};int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n,m;cin>>n>>m;vector<ll>a(m);rep(i,0,m)cin>>a[i],a[i]--;const int sz=450;using vi=bitset<sz>;auto f=[&](vi x,vi y){return x|y;};auto f2=[&](vi x,bool w){rep(i,0,sz){if(!x[i]){//cout<<(vi(1)<<i)<<endl;return vi(1)<<i;}}};auto f3=[&](vi x){rep(i,0,sz){if(!x[i])return i;}};auto f4=[&](vi x){rep(i,0,sz){if(x[i])return i;}};vi iden=0;ReRooting<vi,bool>reroot(n,f,f2,iden);rep(i,0,n-1){ll u,v;cin>>u>>v;u--;v--;reroot.add_edge(u,v,0);}auto v=reroot.build();vector<int>gr(n);rep(i,0,n){//cout<<v[i]<<endl;gr[i]=f3(v[i]);}//debug(gr,n);int now=0;rep(i,0,m){now^=gr[a[i]];}if(now==0){cout<<-1 spa -1<<endl;return 0;}vector<bool>used(n);rep(i,0,m){if(used[a[i]])continue;used[a[i]]=true;now^=gr[a[i]];for(auto e:reroot.g[a[i]]){int tmpgr=f4(e.dp);//cout<<a[i] spa now spa tmpgr<<endl;if(tmpgr==now){cout<<i+1 spa e.to+1<<endl;return 0;}}now^=gr[a[i]];}return 0;}