제출 #802713

#제출 시각아이디문제언어결과실행 시간메모리
802713raysh07Easter Eggs (info1cup17_eastereggs)C++17
100 / 100
16 ms536 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int n; const int maxn = 513; vector <int> adj[maxn]; vector <int> ok; void dfs(int u, int par = -1){ ok.push_back(u); for (int v : adj[u]){ if (v != par){ dfs(v, u); } } } int findEgg (int N, vector <pair<int,int>> bridges) { n = N; for (int i = 1; i <= n; i++) adj[i].clear(); for (auto [u, v] : bridges){ adj[u].push_back(v); adj[v].push_back(u); } dfs(1); int l = 0, r = n - 1; while (l != r){ int mid = (l + r)/2; vector <int> lol; for (int i = 0; i <= mid; i++) lol.push_back(ok[i]); if (query(lol)) r = mid; else l = mid + 1; } return ok[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...