Submission #1096881

#TimeUsernameProblemLanguageResultExecution timeMemory
10968810pt1mus23Easter Eggs (info1cup17_eastereggs)C++14
0 / 100
196 ms131072 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; const int sze = 600; vector<int> graph[sze]; vector<int> path; void dfs(int node,int par=-1){ path.push_back(node); for(auto v:graph[node]){ if(v==par){ continue; } dfs(v,node); } } int findEgg (int n, vector<pair<int,int>> edges){ int ans=1; for(auto [k,v]:edges){ graph[k].push_back(v); graph[v].push_back(k); } dfs(1); int l =0; int r = n-1; vector<int> lst; while(l<=r){ int mid = (l+r)/2; lst.clear(); for(int i=0;i<=mid;i++){ lst.push_back(path[i]); } if(query(lst)){ ans=lst.back(); r = mid-1; } else{ l = mid+1; } } return ans; }

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:21:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |     for(auto [k,v]:edges){
      |              ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...