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;
const int n = 1000;
vector<int> g[n];
vector<int> v;
void dfs(int at, int p) {
v.push_back(at);
for(int to:g[at]) {
if(to==p)continue;
dfs(to, at);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(auto i:bridges) {
g[i.first].push_back(i.second);
g[i.second].push_back(i.first);
}
dfs(1,0);
int l = 1, r = v.size()-1, res = -1;
while(l <= r) {
int mid = (l+r)/2;
vector<int> q;
for(int i = 0;i<=mid;i++)q.push_back(v[i]);
if(query(q)) {
r=mid-1;
res=v[mid];
}
else {
l=mid+1;
}
}
if(res == -1)res=v[0];
v.clear();
for(int i = 1;i<=N;i++)g[i].clear();
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |