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> vec;
vector<bool> visited(520, false);
vector<int> adj[520];
void dfs(int s) {
if (visited[s]) return;
vec.push_back(s);
visited[s]=true;
for (auto u: adj[s]) dfs(u);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
vec.clear();
for (int i=0; i<=N; i++) adj[i].clear(), visited[i]=false;
for (auto u: bridges) {
adj[u.first].push_back(u.second);
adj[u.second].push_back(u.first);
}
dfs(1);
int l=0, r=N-1;
while (l<r) {
int mid=l+(r-l)/2;
if (query(vector<int>(vec.begin(), vec.begin()+mid+1))) {
r=mid;
} else {
l=mid+1;
}
}
return vec[l];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |