oj.uz

Submission #115953

# Submission time Handle Problem Language Result Execution time Memory
115953 2019-06-10T03:27:29 Z nhimnam120 Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 400 ms 384 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
vector<int> ask;
vector<int> adj[1001];
bool used[1001],wrong[1001];
long long size=0;
long long cnt;
void dfs(long long node, long long par){
	if(cnt==size/2) return;
	if(used[node]==0) cnt++;
	ask.push_back(node);
	for(auto i : adj[node]){
		if(wrong[i]!=0||i==par) continue;
		dfs(i,node);
	}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
    ask.clear();
	for(int i=0;i<=1000;i++){
		adj[i].clear();
	}
	memset(used,0,sizeof(used));
	memset(wrong,0,sizeof(wrong));
	size=N;
	for(auto i: bridges){
		long long left=i.first;
		long long right=i.second;
		adj[left].push_back(right);
		adj[right].push_back(left);
	}
	while(true){
		ask.clear();
		if(size==1){
			for(int i=1;i<=N;i++){
				if(used[i]==0&&wrong==0){
					return i;
				}
			}
		}
		else{
			cnt=0;
			dfs(1,1);
			if(query(ask)==1){
				size=cnt;
				bool vs[1001];
				memset(vs,0,sizeof(vs));
				for(auto i:ask){
					vs[i]=1;
				}
				for(int i=1;i<=N;i++){
					if(vs[i]==0){
						wrong[i]=true;
					}
				}
			}
			else{
				size=size-cnt;
				for(auto i:ask){
					used[i]=true;
				}
			}
		}
	}
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3092 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3095 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3038 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -