Submission #974892

#	Time	Username	Problem	Language	Result	Execution time	Memory
974892		AliHasanli	Easter Eggs (info1cup17_eastereggs)	C++17	0 / 100	230 ms	131072 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>dfsorder;
vector<int>g[600];
void dfs(int source,int p)
{
	dfsorder.push_back(source);
	for(int i=0;i<g[source].size();i++)
		if(g[source][i]!=p)dfs(g[source][i],source);
}
int findEgg (int N,vector<pair<int,int> >bridges)
{
    for(int i=0;i<N-1;i++)
    {
    	g[bridges[i].first].push_back(bridges[i].second);
    	g[bridges[i].second].push_back(bridges[i].first);
	}
	dfs(1,0);
	int l=1,r=N;
	int ans=0,mid;
	while(l<=r)
	{
		mid=(l+r)/2;
		if(query(vector<int>(dfsorder.begin(),dfsorder.begin()+mid)))
			r=mid-1,ans=mid;
		else l=mid+1;
	}
	
    return dfsorder[ans];
}

Compilation message (stderr)

eastereggs.cpp: In function 'void dfs(int, int)':
eastereggs.cpp:9:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i=0;i<g[source].size();i++)
      |              ~^~~~~~~~~~~~~~~~~

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