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> g[555];
vector<int> vertex;
void dfs(int v, int p = -1) {
vertex.push_back(v);
for (auto to : g[v]) {
if (to != p) {
dfs(to, v);
}
}
}
int check(int len) {
vector<int> Q;
for (int i = 0; i <= len; i++) Q.push_back(vertex[i]);
return query(Q);
}
int findEgg (int N, vector < pair < int, int > > bridges){
for (auto it : bridges) {
g[it.first].push_back(it.second);
g[it.second].push_back(it.first);
}
dfs(1);
int l = 0, r = vertex.size() - 1;
while (l < r) {
int m = (l + r) / 2;
if (check(m))
r = m;
else
l = m + 1;
}
return vertex[r];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |