oj.uz

답안 #874291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874291 2023-11-16T15:58:36 Z asli_bg Easter Eggs (info1cup17_eastereggs) C++11
100 / 100
 11 ms 740 KB 
#include "grader.h"
#include <bits/stdc++.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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Number of queries: 4
2 Correct 0 ms 344 KB Number of queries: 4
3 Correct 0 ms 344 KB Number of queries: 4
4 Correct 1 ms 344 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB Number of queries: 8
2 Correct 7 ms 732 KB Number of queries: 9
3 Correct 10 ms 728 KB Number of queries: 9
4 Correct 9 ms 728 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 508 KB Number of queries: 9
2 Correct 9 ms 732 KB Number of queries: 9
3 Correct 10 ms 740 KB Number of queries: 9
4 Correct 11 ms 740 KB Number of queries: 9