Submission #918168

#TimeUsernameProblemLanguageResultExecution timeMemory
918168vjudge1Easter Eggs (info1cup17_eastereggs)C++17
100 / 100
15 ms5928 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int N=2e5+5, mod=1e9+7; int n; #include "grader.h" vector<int> d , g[N]; void dfs(int s,int p) { d.push_back(s); for(auto i: g[s]) { if(i == p) { continue; } dfs(i,s); } } int findEgg(int M , vector<pair<int , int>> a) { d.clear(); n = M; for(int i=0;i<=n;i++) { g[i].clear(); } for(int i=0;i<(int)a.size();i++) { g[a[i].first].push_back(a[i].second); g[a[i].second].push_back(a[i].first); } dfs(1 , 0); int l = 0 , r = n - 1 , best = 0; while(l < r) { int mid = (l + r)/2; vector<int> q; for(int i=0;i<=mid;i++) { q.push_back(d[i]); } if(query(q) == 1) { r = mid; best = mid; } else { l = mid + 1; } } return d[l]; }

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:35:29: warning: variable 'best' set but not used [-Wunused-but-set-variable]
   35 |     int l = 0 , r = n - 1 , best = 0;
      |                             ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...