oj.uz

Submission #1057159

# Submission time Handle Problem Language Result Execution time Memory
1057159 2024-08-13T14:36:27 Z Drifter24 Easter Eggs (info1cup17_eastereggs) C++14
87 / 100
 16 ms 988 KB 
#include <bits/stdc++.h>
using namespace std;

int query(vector < int > islands);
void dfs(int v, int p, vector<vector<int>>& adj, vector<int>& ans){
	ans.push_back(v);
	for(int u:adj[v]){
		if(u==p)continue;
		dfs(u, v, adj, ans);
	}
}

int findEgg(int N, vector < pair < int, int > > bridges){
	vector<int> ans;
	vector<vector<int>> adj(N+1, vector<int>());
	for(auto x:bridges){
		adj[x.first].push_back(x.second);
		adj[x.second].push_back(x.first);
	}
	dfs(1, 0, adj, ans);
	int l=1,r=N;
	while(l<=r){
		int m=l+(r-l)/2;
		vector<int> q;
		for(int i=0;i<m;++i)q.push_back(ans[i]);
		if(query(q))r=m-1;
		else l=m+1;
	}
	return ans[min(N, r+1)-1];
}

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 0 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 4 ms 468 KB Number of queries: 9
2 Correct 7 ms 488 KB Number of queries: 9
3 Correct 10 ms 480 KB Number of queries: 9
4 Correct 16 ms 496 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 14 ms 344 KB Number of queries: 10
2 Correct 11 ms 736 KB Number of queries: 9
3 Partially correct 10 ms 988 KB Number of queries: 10
4 Partially correct 10 ms 600 KB Number of queries: 10