# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67630 | tatatan | Easter Eggs (info1cup17_eastereggs) | C++11 | 0 ms | 0 KiB |
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"
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
vector<int> v[512];
int cnt,used[512];
void dfs(int x,int y,int en,vector<int> &add) {
if(cnt==en)
return;
add.pb(x);
if(!used[x]) ++cnt;
for(int i=0;i<v[x].size();++i)
if(v[x][i]!=y)
dfs(v[x][i],x,en,add);
}
int findEgg (int n, vector < pair < int, int > > br)
{
memset(used,0,sizeof used);
for(int i=0;i<n;++i)
v[i].clear();
for(int i=0;i<n;++i) {
v[br[i].st].pb(br[i].nd);
v[br[i].nd].pb(br[i].st);
}
int left=n;
while(left!=1) {
vector<int> add;
cnt=0;
dfs(0,-1,left/2,add);
if(query(add)) {
left=left/2;
fill(used,used+n,1);
for(int i=0;i<add.size();++i)
used[add[i]]=0;
}
else {
for(int i=0;i<add.size();++i)
used[add[i]]=1;
left-=left/2;
}
}
for(int i=0;i<n;++i)
if(!used[i])
return i+1;
}