Submission #279642

#	Time	Username	Problem	Language	Result	Execution time	Memory
279642		MKutayBozkurt	Easter Eggs (info1cup17_eastereggs)	C++17	0 / 100	4 ms	640 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<vector<int>> v;
vector<int> ans;

void dfs(int i, int last = -1) {
	ans.emplace_back(i);
	for (auto node : v[i]) {
		if (last == node) continue;
		dfs(node, i);
	}
}

int findEgg(int n, vector<pair<int, int>> bridges) {
	v = vector<vector<int>>(n + 20);
	for (auto node : bridges) {
		v[node.first].emplace_back(node.second);
		v[node.second].emplace_back(node.first);
	}
	dfs(1);
	int l = 0, r = n - 1;
	while (l <= r) {
		int m = (l + r) / 2;
		if (query(vector<int>(ans.begin(), ans.begin() + m + 1))) r = m;
		else l = m;
	}
	return ans[l];
}

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