제출 #1189889

#제출 시각아이디문제언어결과실행 시간메모리
1189889comxddddddEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms496 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<vector<int>> g(513); vector<int> o; vector<bool> visited(513,false); int c; void dfs(int curr){ o.emplace_back(curr); for(auto x : g[curr]){ if(visited[x]) continue; visited[x] = true; dfs(x); } } int findEgg(int N, vector<pair<int, int>> bridges) { c = 0; g.clear(); for(auto x : bridges){ g[x.first].emplace_back(x.second); g[x.second].emplace_back(x.first); } dfs(1); int l = 0, r = N - 1; while(l < r){ int mid = (r - l) / 2 + l; vector<int> ask; for(int i = 0; i <= mid; i++){ ask.emplace_back(o[i]); } if(query(ask)){ r = mid; } else{ l = mid - 1; } } return o[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...