Submission #762471

#TimeUsernameProblemLanguageResultExecution timeMemory
762471beepbeepsheepEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
394 ms131072 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; const int maxn=520; vector<short> adj[maxn]; vector<short> v; int ptr; vector<int> q; void dfs(short x, short p){ v.emplace_back(x); for (auto u:adj[x]){ if (u==p) continue; dfs(u,x); } } int findEgg (int N, vector < pair < int, int > > bridges) { for (auto [u,v]:bridges){ adj[u].emplace_back(v); adj[v].emplace_back(u); } dfs(1,-1); int l=0,r=N,m; while (l!=r-1){ m=(l+r)>>1; while (ptr<m){ q.emplace_back(v[ptr++]); } while (ptr>m){ q.pop_back(); ptr--; } if (query(q)) r=m; else l=m; } return v[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...