Submission #1095338

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095338		idiotcomputer	Easter Eggs (info1cup17_eastereggs)	C++11	87 / 100	12 ms	768 KiB

eastereggs

#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define sz(x) (int) (x).size()

const int mxN = 520;
vector<int> adj[mxN];
vector<int> ord;


void dfs(int node, int p){
	ord.pb(node);
	for (int c : adj[node]){
		if (c != p) dfs(c,node);
	}
}

int findEgg(int N, vector<pair<int,int>> bridges){
	for (int i = 1; i <= N; i++) adj[i].clear();
	ord.clear();
	for (pair<int, int> i : bridges) {
		adj[i.first].push_back(i.second);
		adj[i.second].push_back(i.first);
	}
	dfs(1,0);
	int l = -1;
	int r = N;
	int cur;
	while (r-l>1){
		cur = (l+r)/2;
		if (query(vector<int>(ord.begin(),ord.begin()+cur+1))) r = cur;
		else l = cur;
	}	
	return ord[r];
}	

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