Submission #115980

#	Time	Username	Problem	Language	Result	Execution time	Memory
115980		HungAnhGoldIBO2020	Easter Eggs (info1cup17_eastereggs)	C++11	100 / 100	17 ms	468 KiB

eastereggs

#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
const int M=515;
bool used[M];
vector<int> lis,adj[M],lis1;
int now,dem;
bool cac;
void dfs(int x,int p){
	lis.push_back(x);
	if(!used[x]){
		lis1.push_back(x);
		dem++;
		if(dem==now/2){
			cac=true;
			return;
		}
	}
	int j=adj[x].size();
	for(int i=0;i<j;i++){
		if(cac){
			return;
		}
		if(adj[x][i]!=p){
			dfs(adj[x][i],x);
		}
	}
}
int findEgg(int N,vector<pair<int,int> > bridges){
	memset(used,false,sizeof(used));
	int i,j;
	for(i=1;i<M;i++){
		adj[i].clear();
	}
	j=bridges.size();
	for(i=0;i<j;i++){
		adj[bridges[i].first].push_back(bridges[i].second);
		adj[bridges[i].second].push_back(bridges[i].first);
	}
	now=N;
	while(now>1){
		dem=0;
		lis.clear();
		lis1.clear();
		cac=false;
		dfs(1,1);
		if(query(lis)==1){
			for(i=1;i<=N;i++){
				used[i]=true;
			}
			j=lis1.size();
			for(i=0;i<j;i++){
				used[lis1[i]]=false;
			}
			now=dem;
		}
		else{
			j=lis1.size();
			for(i=0;i<j;i++){
				used[lis1[i]]=true;
			}
			now=now-dem;
		}
	}
	for(i=1;i<=N;i++){
		if(!used[i]){
			return i;
		}
	}
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:70:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20