Submission #115999

#TimeUsernameProblemLanguageResultExecution timeMemory
115999ntrung03Easter Eggs (info1cup17_eastereggs)C++17
87 / 100
28 ms384 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> tour; vector<vector<int>> adj; void dfs(int u,int e){ tour.push_back(u); for(auto v:adj[u]) if(v!=e) dfs(v,u); } int findEgg (int N, vector < pair < int, int > > bridges) { tour.clear(); tour.push_back(0); adj.clear(); adj.resize(N+1); for(auto e:bridges){ adj[e.first].push_back(e.second); adj[e.second].push_back(e.first); } dfs(1,-1); int r = 0; for(int i=log2(N);i>=0;i--){ int t = r|(1<<i); if(t>N) continue; vector<int> q(next(tour.begin()),next(tour.begin(),t+1)); // cout<<t<<endl; if(!query(q)) r=t; } // cout<<tour[r]<<endl; return tour[r+1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...