This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>g[513];
vector<int>a;
void dfs(int node,int par)
{
a.push_back(node);
for(auto ax:g[node])
{
if(ax==par)continue;
dfs(ax,node);
}
}
int findEgg (int n, vector < pair < int, int > > b)
{
for (int i = 1; i <= n; i++) g[i].clear();
a.clear();
for(auto ax:b)
{
g[ax.first].push_back(ax.second);
g[ax.second].push_back(ax.first);
}
dfs(1,-1);
int l=0;
int r=n-1;
while(l<r)
{
int mid=l+(r-l)/2;
vector<int>v;
for(int i=0;i<=mid;i++)
{
v.push_back(a[i]);
}
if(query(v)==1)
{
r=mid;
}
else
{
l=mid+1;
}
}
return a[l];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |