# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483634 | alexdumitru | Easter Eggs (info1cup17_eastereggs) | C++14 | 229 ms | 131076 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> v[550];
vector<int> parcurgere;
void dfs(int nod=1, int p=-1)
{
parcurgere.push_back(nod);
for(auto i:v[nod])if(i!=p)dfs(i,nod);
}
int findEgg(int N, vector<pair<int,int> > bridges)
{
int st,r=N-1,poz=N,mi,dr,i;
for(auto i:bridges)
{
v[i.first].push_back(i.second);
v[i.second].push_back(i.first);
}
dfs();
st=0;
dr=N-1;
while(st<=dr)
{
mi=st+(dr-st)/2;
if(query(vector<int>(parcurgere.begin(),parcurgere.begin()+mi+1)))
{
dr=mi-1;
r=mi;
}
else st=mi+1;
}
return parcurgere[r];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |