Submission #61603

#	Time	Username	Problem	Language	Result	Execution time	Memory
61603		IOrtroiii	Easter Eggs (info1cup17_eastereggs)	C++14	100 / 100	38 ms	3084 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
const int N = 1e5 + 5;
 
int n;
vector<int> G[N], ask;
int arr[N], tot = 0;
 
void dfs(int u,int p) {
	arr[++tot] = u;
	for (int v : G[u]) if (v != p) {
		dfs(v, u);
	} 
}
 
int findEgg(int n,vector<pair<int,int>> bridges) {
	for (int i = 1; i <= n; ++i) G[i].clear();
	
	for (auto ed : bridges) {
		int u = ed.first, v = ed.second;
		G[u].push_back(v), G[v].push_back(u);
	}
	
	dfs(1, 1);
	int l = 1, r = n;
	while (l < r) {
		int mid = l + r >> 1;
		ask.clear();
		for (int i = 1; i <= mid; ++i) ask.push_back(arr[i]);
		if (query(ask)) r = mid; else l = mid + 1;
	}
	return arr[l];
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:29:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

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