Submission #97699

#	Time	Username	Problem	Language	Result	Execution time	Memory
97699		KLPP	Easter Eggs (info1cup17_eastereggs)	C++14	0 / 100	4 ms	640 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
 
using namespace std;
typedef pair<int,int> pii;
vector<int> nei[1000];
vector<int> order;
bool b[1000];
void DFS(int u){
	order.push_back(u);
	for(int i=0;i<nei[u].size();i++){
		int v=nei[u][i];
		if(!b[v]){
			b[v]=true;
			DFS(v);
		}
	}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
	order.clear();
	int n=N;
	for(int i=0;i<n;i++)nei[i].clear();
	for(int i=0;i<bridges.size();i++){
		nei[bridges[i].first-1].push_back(bridges[i].second-1);
		nei[bridges[i].second-1].push_back(bridges[i].first-1);
	}
	for(int i=0;i<n;i++)b[i]=false;
	b[0]=true;
	DFS(0);
	/*for(int i=0;i<n;i++){
		vector<int> v;
		v.push_back(i+1);
		if(query(v))return i+1;
	}*/
	//for(int i=0;i<n;i++)cout<<dist[i].second<<endl;
	int lo=0;
	int hi=n;
	while(hi-lo>1){
		int mid=(hi+lo)/2;
		vector<int> v;
		for(int i=0;i<mid;i++)v.push_back(order[i]+1);
		if(query(v)){
			hi=mid;
		}else lo=mid;
	}
	/*for(int i=0;i<n;i++){
		vector<int> v;
		v.push_back(i+1);
		if(query(v))return i+1;
	}*/
	return lo+1;
}

Compilation message (stderr)

eastereggs.cpp: In function 'void DFS(int)':
eastereggs.cpp:11:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<nei[u].size();i++){
              ~^~~~~~~~~~~~~~
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:24:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<bridges.size();i++){
              ~^~~~~~~~~~~~~~~

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