Submission #699794

#TimeUsernameProblemLanguageResultExecution timeMemory
699794ZybgEaster Eggs (info1cup17_eastereggs)C++11
0 / 100
245 ms131072 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> gr[520], order; void dfs(int u,int pre){ order.push_back(u); for(int i : gr[u]){ if(i == pre) continue; dfs(i,u); } } int findEgg (int N, vector < pair < int, int > > bridges) { for(auto pii : bridges){ gr[pii.first].push_back(pii.second); gr[pii.second].push_back(pii.first); } dfs(1,0); int l = 0, r = N-1; while(l < r){ int mid = l+r+1 >> 1; if(query(vector<int>(order.begin(),order.begin()+mid))) r = mid-1; else l = mid; } return order[l]; return 0; }

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:25:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |   int mid = l+r+1 >> 1;
      |             ~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...