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 sz = 600;
vector<int> aj[sz];
vector<int> pt;
void dfs(int v, int p = -1) {
pt.push_back(v);
for (int u : aj[v]) if (u != p)
dfs(u, v);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for (int i = 1; i <= N; i ++)
aj[i].clear();
pt.clear();
for (auto& [v, u] : bridges) {
aj[v].push_back(u);
aj[u].push_back(v);
}
dfs(1);
int le = 0, ri = N - 1;
int r;
while (ri != le) {
int mi = (le + ri + 1) / 2;
r = query(vector<int>(pt.begin(), pt.begin() + mi));
if (r) ri = mi - 1;
else le = mi;
}
return pt[le];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |