#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int cnt=0;
vector<vector<int>> g;
vector<int> a;
void dfs(int v,int prev){
a.push_back(v);
for(auto x:g[v]){
if(x==prev){
continue;
}
dfs(x,v);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
g.resize(N+1);
for(auto x:bridges){
g[x.first].push_back(x.second);
g[x.second].push_back(x.first);
}
dfs(1,-1);
int l=1,r=N;
while(l<r){
int mid=(l+r)/2;
vector<int> b;
for(int i=0;i<mid;i++){
b.push_back(a[i]);
}
if(query(b)){
r=mid;
}
else{
l=mid+1;
}
}
return r;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
444 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
170 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
174 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |