oj.uz

Submission #1095337

# Submission time Handle Problem Language Result Execution time Memory
1095337 2024-10-02T00:48:27 Z idiotcomputer Easter Eggs (info1cup17_eastereggs) C++11
100 / 100
 12 ms 600 KB 
#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 = 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 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Number of queries: 8
2 Correct 6 ms 476 KB Number of queries: 9
3 Correct 11 ms 592 KB Number of queries: 9
4 Correct 8 ms 344 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Number of queries: 9
2 Correct 9 ms 344 KB Number of queries: 9
3 Correct 10 ms 600 KB Number of queries: 9
4 Correct 12 ms 600 KB Number of queries: 9