Submission #1198714

#TimeUsernameProblemLanguageResultExecution timeMemory
1198714JungPSEaster Eggs (info1cup17_eastereggs)C++20
100 / 100
8 ms504 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> vec[520]; vector<int> vec2; void dfs(int x,int p){ vec2.push_back(x); for(auto i:vec[x]){ if(i==p) continue; dfs(i,x); } } int findEgg (int N, vector < pair < int, int > > bridges) { for(int i=1;i<=N;++i) vec[i].clear(); vec2.clear(); for(auto i:bridges){ vec[i.first].push_back(i.second); vec[i.second].push_back(i.first); } dfs(1,-1); int l=1,r=N; while(l<r){ int mid=(l+r)>>1; vector<int> tmp; for(int i=0;i<mid;++i) tmp.push_back(vec2[i]); if(query(tmp)) r=mid; else l=mid+1; } return vec2[l-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...