oj.uz

답안 #524231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524231 2022-02-08T20:25:06 Z CSQ31 Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 20 ms 376 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int>adj[1000],a;
void dfs(int v,int u){
	a.push_back(v);
	for(int x:adj[v]){
		if(x==u)continue;
		dfs(x,v);
	}
}
int findEgg (int n, vector < pair < int, int > > bridges)
{
	a.clear();
	for(int i=1;i<=n;i++)adj[i].clear();
	for(auto x:bridges){
		adj[x.first].push_back(x.second);
		adj[x.second].push_back(x.first);
	}
	dfs(1,0);
	int l = 0,r = n-1;
	while(r>=l){
		int mid = (l+r)/2;
		vector<int>b;
		for(int i=0;i<=mid;i++)b.push_back(a[i]);
		if(query(b))r=mid-1;
		else l=mid+1;
	}
	return a[l];
}

Subtask #1
32.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 200 KB Number of queries: 5
2 Partially correct 1 ms 200 KB Number of queries: 5
3 Partially correct 1 ms 200 KB Number of queries: 5
4 Partially correct 1 ms 200 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Number of queries: 9
2 Correct 9 ms 356 KB Number of queries: 9
3 Correct 15 ms 328 KB Number of queries: 9
4 Correct 14 ms 328 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 20 ms 376 KB Number of queries: 10
2 Correct 18 ms 328 KB Number of queries: 9
3 Partially correct 15 ms 356 KB Number of queries: 10
4 Partially correct 16 ms 356 KB Number of queries: 10