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 "grader.h"
#include <bits/stdc++.h>
using namespace std;
//int query(vector < int > islands){
// return 1;
//}
vector <int> ord;
vector < vector <int> > G(513);
void dfs(int nod, int t){
ord.push_back(nod);
for(auto x : G[nod]){
if(x == t) continue;
dfs(x, nod);
}
}
int findEgg(int n, vector < pair < int, int > > bridges){
for (int i = 1; i <= n; i++) G[i].clear();
ord.clear();
for(auto x : bridges){
G[x.first].push_back(x.second);
G[x.second].push_back(x.first);
}
dfs(1,0);
int st = 1, dr = n,poz = 1;
while(st <= dr){
int med = (st + dr) >> 1;
if(query(vector <int> (ord.begin() + st, ord.begin() + med))){
poz = med;
st = med + 1;
}
else dr = med - 1;
}
return poz;
}
//vector < pair <int, int> > v;
//int main()
//{
// int n,x,y;
// ios_base::sync_with_stdio(false);
// cin.tie(nullptr);
// cin >> n;
// for(int i = 1; i < n; i++){
// cin >> x >> y;
// v.push_back({x,y});
// }
// cout << findEgg(n, v);
// return 0;
//}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |