oj.uz

Submission #575417

# Submission time Handle Problem Language Result Execution time Memory
575417 2022-06-10T11:10:41 Z spensa Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 23 ms 456 KB 
#include <bits/stdc++.h>

#include "grader.h"

using namespace std;


vector<int> graph[513], ord;


void dfs(int node = 1, int parent = 0) {

	ord.push_back(node);

	for (int i : graph[node]) if (i != parent) dfs(i, node);

}


int findEgg(int N, vector<pair<int, int>> bridges) {

	for (int i = 1; i <= N; i++) graph[i].clear();

	ord.clear();

	for (pair<int, int> i : bridges) {

		graph[i.first].push_back(i.second);

		graph[i.second].push_back(i.first);

	}

	dfs();

	int l = 0, r = N - 1;

	while (l != r) {

		int mid = (l + r + 1) / 2;

		if (query(vector<int>(ord.begin(), ord.begin() + mid))) r = mid - 1;

		else l = mid;

	}

	return ord[l];

}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Number of queries: 4
2 Correct 1 ms 208 KB Number of queries: 4
3 Correct 1 ms 208 KB Number of queries: 4
4 Correct 1 ms 208 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 336 KB Number of queries: 8
2 Correct 10 ms 332 KB Number of queries: 9
3 Correct 23 ms 344 KB Number of queries: 9
4 Correct 19 ms 456 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 336 KB Number of queries: 9
2 Correct 13 ms 348 KB Number of queries: 9
3 Correct 15 ms 336 KB Number of queries: 9
4 Correct 16 ms 348 KB Number of queries: 9