Submission #699798

#	Time	Username	Problem	Language	Result	Execution time	Memory
699798		Zybg	Easter Eggs (info1cup17_eastereggs)	C++11	100 / 100	18 ms	360 KiB

eastereggs

#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(int i=1;i<=N;i++) gr[i].clear();
	order.clear();
    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:27:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |   int mid = l+r+1 >> 1;
      |             ~~~^~

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20