Submission #522168

#TimeUsernameProblemLanguageResultExecution timeMemory
522168blueEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
334 ms131076 KiB
#include <vector> #include "grader.h" using namespace std; using vi = vector<int>; using pii = pair<int, int>; const int p_mx = 512; vi p_edge[1+p_mx]; vi p_ord(1, 0); void dfs(int u, int p) { p_ord.push_back(u); for(int v : p_edge[u]) { if(v != p) dfs(v, u); } } int findEgg (int N, vector < pair < int, int > > bridges) { for(pii b: bridges) { p_edge[b.first].push_back(b.second); p_edge[b.second].push_back(b.first); } dfs(1, 0); int lo = 1, hi = N; while(lo != hi) { int mid = (lo+hi)/2; vi qr; for(int i = 1; i <= mid; i++) qr.push_back(p_ord[i]); if(query(qr)) hi = mid; else lo = mid+1; } return p_ord[lo]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...