# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483631 | alexdumitru | Easter Eggs (info1cup17_eastereggs) | C++14 | 244 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 <iostream>
#include <vector>
#include <grader.h>
using namespace std;
vector<int> v[550];
vector<int> parcurgere;
int viz[550];
int query(vector<int> islands);
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,m=bridges.size();
for(i=1;i<=N;i++)viz[i]=0;
for(i=0;i<m;i++)
{
v[bridges[i].first].push_back(bridges[i].second);
v[bridges[i].second].push_back(bridges[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... |