oj.uz

Submission #1095338

# Submission time Handle Problem Language Result Execution time Memory
1095338 2024-10-02T00:49:23 Z idiotcomputer Easter Eggs (info1cup17_eastereggs) C++11
87 / 100
 12 ms 768 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 = -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.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Number of queries: 5
2 Partially correct 1 ms 344 KB Number of queries: 5
3 Partially correct 0 ms 344 KB Number of queries: 5
4 Partially correct 0 ms 344 KB Number of queries: 5

Subtask #2
40.0 / 40.0

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

Subtask #3
15.0 / 20.0

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