Submission #1177756

#TimeUsernameProblemLanguageResultExecution timeMemory
1177756tommiEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
2 ms5156 KiB
#include <bits/stdc++.h> #include "grader.h" #define pb push_back #define ll long long using namespace std; const ll sz = 2e5+5; vector<int>g[sz], v; ll used[sz], t=0, in[sz]; void dfs(ll node) { used[node]=1; in[t++]=node; for(auto cur : g[node]) { if(!used[cur]) dfs(cur); } } int findEgg (int n, vector < pair < int, int > > bridges) { for(int i=0; i<n-1; i++) g[i].clear(); for(int i=0; i<n-1; i++) { ll x=bridges[i].first, y=bridges[i].second; g[x].pb(y); g[y].pb(x); } ll l=1, r=n; while(l<=r) { v.clear(); ll mid=(l+r)>>1; for(int i=1; i<=mid; i++) v.pb(in[i]); if(query(v)) { r=mid-1; } else { l=mid+1; } } return in[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...