제출 #676696

#제출 시각아이디문제언어결과실행 시간메모리
676696LucaLucaMEaster Eggs (info1cup17_eastereggs)C++17
100 / 100
21 ms368 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int>v[513]; vector<int>order; void dfs (int x, int par) { order.push_back(x); for (int i : v[x]) { if (i == par) continue; dfs(i, x); } } int findEgg(int N, vector < pair < int, int > > bridges) { for (pair<int, int>p : bridges) { v[p.first].push_back(p.second); v[p.second].push_back(p.first); } dfs(1, -1); int l=1, r=N; while (l < r) { int mid = (l + r) / 2; vector<int>curr; for (int i=0; i<mid; i++) curr.push_back(order[i]); if (query(curr)) r = mid; else l = mid + 1; } int ret = order[r-1]; for (int i=1; i<=N; i++) v[i].clear(); order.clear(); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...