# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97631 | KLPP | Easter Eggs (info1cup17_eastereggs) | C++14 | 52 ms | 47524 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;
typedef pair<int,int> pii;
vector<int> nei[1000000];
int findEgg (int N, vector < pair < int, int > > bridges)
{
int n=N;
for(int i=0;i<n;i++)nei[i].clear();
for(int i=0;i<bridges.size();i++){
nei[bridges[i].first-1].push_back(bridges[i].second-1);
nei[bridges[i].second-1].push_back(bridges[i].first-1);
}
pii dist[n];
for(int i=0;i<n;i++)dist[i].first=-1,dist[i].second=i;
queue<int> q;
q.push(0);
dist[0].first=0;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<nei[u].size();i++){
int v=nei[u][i];
if(dist[v].first==-1){
dist[v].first=dist[u].first+1;
q.push(v);
}
}
}
sort(dist,dist+n);
//for(int i=0;i<n;i++)cout<<dist[i].second<<endl;
int lo=-1;
int hi=n-1;
while(hi-lo>1){
int mid=(hi+lo)/2;
vector<int> v;
for(int i=0;i<=mid;i++)v.push_back(dist[i].second+1);
if(query(v)){
hi=mid;
}else lo=mid;
}
return hi+1;
}
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... |