Submission #1145970

#TimeUsernameProblemLanguageResultExecution timeMemory
1145970txni128Easter Eggs (info1cup17_eastereggs)C++20
0 / 100
1 ms500 KiB
#include "grader.h" #include <iostream> #include <vector> using namespace std; int used[1024]; vector <int> v[1024]; vector <int> ans; void dfs(int beg) { used[beg]=1; ans.push_back(beg); for(auto c:v[beg]) { if(!used[c]) { dfs(c); } } return; } int findEgg(int N, vector < pair < int, int > > bridges) { fill(used,used+1000,0); ans.clear(); for(int i=1;i<=1010;i++) { v[i].clear(); } for(auto c:bridges) { v[c.first].push_back(c.second); v[c.second].push_back(c.first); } dfs(1); int l=0; int r=N-1; int mid; bool la; while(l<r) { mid=(l+r)/2; vector <int>k; for(int i=0;i<=mid;i++) { k.push_back(ans[i]); } la=query(k); if(la) { r=mid; } else l=mid+1; } for(int i=1;i<1000000000;i++) { if(i==i)i=i; r=i%69*69; } //cout << l << endl; return ans[r]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...