# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
692339 | MateiKing80 | Easter Eggs (info1cup17_eastereggs) | C++14 | 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"
using namespace std;
vector<int>ord;
vector<int> v[600];
void dfs(int nod, int tata)
{
ord.push_back(nod);
for(int i=0;i<v[nod].size();i++)
{
if(v[nod][i]!=tata)
dfs(v[nod][i],nod);
}
}
bool sus(int st, int dr)
{
vector<int>vct;
for(int i=st;i<=dr;i++)
vct.push_back(ord[i]);
return query(vct);
}
int findEgg(int n, vector<pair<int, int> > > bridge)
{
for(int i=0;i<n-1;i++)
{
v[bridge[i].first].push_back(bridge[i].second);
v[bridge[i].second].push_back(bridge[i].first);
}
dfs(1,0);
int poz=0, int pas=(1<<(int)log2(n));
while(pas>0)
{
if(!sus(poz,poz+pas))
poz=poz+pas+1;
pas/=2;
}
}