# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483621 | alexdumitru | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 488 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>
using namespace std;
vector<int> v[550];
vector<int> parcurgere;
int viz[550];
int query(vector<int> islands);
void dfs(int nod)
{
int k=v[nod].size();
for(int i=0;i<k;i++)
{
if(!viz[v[nod][i]])
{
viz[v[nod][i]]=1;
parcurgere.push_back(v[nod][i]);
dfs(v[nod][i]);
}
}
}
int findEgg(int N, vector<pair<int,int> > bridges)
{
int st=0,dr=N-1,rasp=-1,mi,i,m=bridges.size(),nr=1;
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);
}
parcurgere.push_back(1);
dfs(1);
while(st<=dr)
{
mi=st+(dr-st)/2;
vector<int> q;
for(i=0;i<=mi;i++)q.push_back(i);
if(query(q))
{
dr=mi-1;
rasp=mi;
}
else st=mi+1;
}
if(rasp==-1)return N;
return rasp;
}
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... |