#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> adj[513];
vector<int> v;
void dfs(int u, int p){
v.push_back(u);
for(auto x : adj[u]){
if(x != p)
dfs(x, u);
}
}
int findEgg(int N, vector<pair<int, int>> bridges){
for(int i=0; i<N-1; i++){
int u = bridges[i].first;
int v = bridges[i].second;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1, 0);
int ans = 0;
int l = 0, r = v.size() - 1;
while(l <= r){
vector<int> islands;
int mid = (l + r) / 2;
for(int i=l; i<=mid; i++)
islands.push_back(v[i]);
int q = query(islands);
if(q == 1){
ans = v[mid];
r = mid - 1;
}
else
l = mid + 1;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
205 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |