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;
vector<int>adj[555], id;
void dfs(int v = 1, int p = 0) {
id.push_back(v);
for(auto u: adj[v]) {
if(u == p) continue;
dfs(u, v);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int l = 1; l <= N; l++) adj[l].clear();
id.clear();
for(auto u : bridges) {
int a = u.first, b = u.second;
adj[a].push_back(b); adj[b].push_back(a);
}
dfs();
int lo = 0, hi = N - 1;
while(lo != hi) {
int md = (lo + hi + 1)/2;
if(query(vector<int>(id.begin(), id.begin() + md))) hi = md - 1;
else lo = md;
}
return id[lo];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |