# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97703 | KLPP | Easter Eggs (info1cup17_eastereggs) | C++14 | 23 ms | 476 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[1000];
vector<int> order;
void DFS(int u,int last){
order.push_back(u);
for(int i=0;i<nei[u].size();i++){
int v=nei[u][i];
if(v!=last){
DFS(v,u);
}
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
order.clear();
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);
}
DFS(0,-1);
/*for(int i=0;i<n;i++){
vector<int> v;
v.push_back(i+1);
if(query(v))return i+1;
}*/
//for(int i=0;i<n;i++)cout<<dist[i].second<<endl;
int lo=0;
int hi=n;
while(hi-lo>1){
int mid=(hi+lo)/2;
vector<int> v;
for(int i=0;i<mid;i++)v.push_back(order[i]+1);
if(query(v)){
hi=mid;
}else lo=mid;
}
/*for(int i=0;i<n;i++){
vector<int> v;
v.push_back(i+1);
if(query(v))return i+1;
}*/
return order[lo]+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... |