제출 #1190603

#제출 시각아이디문제언어결과실행 시간메모리
1190603Panda50OEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms468 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; const int mxN = 525; vector<int> adj[mxN]; vector<int> path[mxN]; void dfs(int u, int p) { path[0].emplace_back(u); path[path[0].size()] = path[0]; for(auto v : adj[u]) { if(v = p) continue; dfs(v, p); } return; } int findEgg (int N, vector < pair < int, int > > bridges) { // if (query ({1})) return 1; for(int i = 0; i < N; ++i) { auto [a,b] = bridges[i]; adj[a].emplace_back(b); adj[b].emplace_back(a); } // euler tour // path[0]; dfs(1, -1); int l = 1, r = N; while(l < r) { int mid = (l+r) / 2; if(query(path[mid])) { r = mid; } else { l = mid+1; } } return path[l].back(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...