제출 #464808

#제출 시각아이디문제언어결과실행 시간메모리
464808okaragulEaster Eggs (info1cup17_eastereggs)C++17
100 / 100
23 ms352 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<vector<int>> g; vector<int> ord; void dfs(int v, int p){ ord.push_back(v); for(auto &ch:g[v]) if(ch!=p) dfs(ch, v); } int findEgg (int N, vector < pair < int, int > > bridges) { g.assign(N, vector<int>()); ord.clear(); for(int i = 0; i < N-1; i++){ auto &[a, b]=bridges[i]; g[a-1].push_back(b-1); g[b-1].push_back(a-1); } dfs(0, -1); int l=1, r=N; while(l<r){ int mid=(l+r)/2; vector<int> tmp; for(int i = 0; i < mid; i++) tmp.push_back(ord[i]+1); if(!query(tmp)) l=mid+1; else r=mid; } return ord[l-1]+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...