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;
int findEgg (int N, vector < pair < int, int > > bridges){
vector<int> par(1 + N);
vector<vector<int>> g(1 + N);
for (auto it : bridges) {
int a, b;
tie(a, b) = it;
g[a].push_back(b);
g[b].push_back(a);
}
random_shuffle(bridges.begin(), bridges.end());
for (auto it : bridges) {
int a, b;
tie(a, b) = it;
if (query(vector<int>{a, b}) == 1) {
if (query(vector<int>{a}))
return a;
return b;
}
}
return -1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |