Submission #282954

#TimeUsernameProblemLanguageResultExecution timeMemory
282954dsjongEaster Eggs (info1cup17_eastereggs)C++14
0 / 100
403 ms131076 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int>adj[600]; vector<int>tour, cur; void dfs(int x, int p){ tour.push_back(x); for(int y:adj[x]){ if(y==p) continue; dfs(y, x); } } bool ask(int x){ cur.clear(); for(int i=0;i<=x;i++){ cur.push_back(tour[i]); } return query(cur); } int findEgg (int N, vector<pair<int, int>> bridges){ for(auto p: bridges){ int x=p.first, y=p.second; adj[x].push_back(y); adj[y].push_back(x); } dfs(1, 0); int L=0, R=N-1; while(L<R){ int M=(L+R)/2; if(ask(M)) R=M; else L=M+1; } return tour[L]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...