Submission #918058

#TimeUsernameProblemLanguageResultExecution timeMemory
918058aykhnEaster Eggs (info1cup17_eastereggs)C++17
100 / 100
13 ms1256 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> e; vector<int> adj[600]; void dfs(int a, int p) { e.push_back(a); for (int v : adj[a]) { if (v == p) continue; dfs(v, a); } } int findEgg (int N, vector < pair < int, int > > bridges) { e.clear(); for (int i = 0; i <= N; i++) adj[i].clear(); for (pair<int, int> p : bridges) { adj[p.first].push_back(p.second); adj[p.second].push_back(p.first); } dfs(1, 1); int l = 0; int r = e.size() - 1; while (l < r) { int mid = (l + r) >> 1; vector<int> nw; for (int i = 0; i <= mid; i++) nw.push_back(e[i]); if (query(nw)) r = mid; else l = mid + 1; } return e[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...