Submission #1009392

#TimeUsernameProblemLanguageResultExecution timeMemory
1009392LilPlutonEaster Eggs (info1cup17_eastereggs)C++14
100 / 100
13 ms748 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; vector<int>g[600]; vector<int>v; void dfs(int node,int par) { v.push_back(node); for(int i : g[node]) if(i != par) dfs(i, node); } int findEgg(int N, vector<pair<int,int>> bridges) { for(int i = 0; i <= N; ++i) g[i].clear(); v.clear(); for(auto i : bridges) { g[i.first].push_back(i.second); g[i.second].push_back(i.first); } dfs(1,1); int l = 0, r = v.size() - 1; while(l < r) { int mid = (l + r) / 2; vector<int>w; for(int i = 0; i <= mid; ++i) { w.push_back(v[i]); } if(query(w)) r = mid; else l = mid + 1; } return v[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...