// author: erray
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg(int n, vector<pair<int, int>> edges) {
vector<vector<int>> g(n);
for (auto e : edges) {
g[e.first - 1].push_back(e.second - 1);
g[e.second - 1].push_back(e.first - 1);
}
vector<int> ask;
function<void(int, int)> dfs = [&](int v, int pr) {
ask.push_back(v);
for (auto u : g[v]) {
if (u == pr) continue;
dfs(u, v);
}
};
dfs(0, -1);
assert((int) ask.size() == n);
query({1});
int s = 0, e = n - 1;
while (s != e) {
int mid = (s + e) >> 1;
vector<int> q;
for (int i = 0; i <= mid; ++i) q.push_back(ask[i] + 1);
if (true) e = mid;
else s = mid + 1;
}
return ask[s];
}
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |