//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son+1)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
//~ vector<int> v;
vector<int> vv,vect[555];
inline void dfs(int node,int ata){
vv.pb(node);
for(int i=0;i<(int)vect[node].size();i++){
int go=vect[node][i];
if(go==ata)continue;
dfs(go,node);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=1;i<=N;i++)vect[i].clear();
vv.clear();
for(int i=0;i<N-1;i++){
int x=bridges[i].fi;
int y=bridges[i].se;
vect[x].pb(y);
vect[y].pb(x);
}
//~ for(int i=1;i<=N;i++)if (query ({i})) return i;
dfs(1,0);
int bas=0;
int son=N-1;
while(bas<=son){
vector<int> vec;
for(int i=0;i<ort;i++){
vec.pb(vv[i]);
}
if(query(vec))son=ort-1;
else bas=ort+1;
}
//~ cout<<bas<<endl;
return vv[bas];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |