oj.uz

답안 #270059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270059 2020-08-17T12:15:11 Z AKaan37 Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 25 ms 428 KB 
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 
#include "grader.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son+1)/2)
 
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
//~ vector<int> v;
 
vector<int> vv,vect[555];
 
inline void dfs(int node,int ata){
	vv.pb(node);
	for(int i=0;i<(int)vect[node].size();i++){
		int go=vect[node][i];
		if(go==ata)continue;
		dfs(go,node);
	}
}
 
int findEgg (int N, vector < pair < int, int > > bridges)
{
	for(int i=1;i<=N;i++)vect[i].clear();
	vv.clear();
	for(int i=0;i<N-1;i++){
		int x=bridges[i].fi;
		int y=bridges[i].se;
		vect[x].pb(y);
		vect[y].pb(x);
	}
    //~ for(int i=1;i<=N;i++)if (query ({i})) return i;
    dfs(1,0);
    int bas=0;
    int son=N-1;
    while(bas!=son){
		vector<int> vec;
		for(int i=0;i<ort;i++){
			vec.pb(vv[i]);
		}
		if(query(vec))son=ort-1;
		else bas=ort;
	}
	//~ cout<<bas<<endl;
    return vv[bas];
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Number of queries: 8
2 Correct 17 ms 384 KB Number of queries: 9
3 Correct 20 ms 428 KB Number of queries: 9
4 Correct 19 ms 384 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 384 KB Number of queries: 9
2 Correct 17 ms 384 KB Number of queries: 9
3 Correct 19 ms 384 KB Number of queries: 9
4 Correct 20 ms 384 KB Number of queries: 9