#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int sz = 600;
vector<int> aj[sz];
vector<int> pt;
void dfs(int v, int p = -1) {
pt.push_back(v);
for (int u : aj[v]) if (u != p)
dfs(u, v);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for (int i = 1; i <= N; i ++)
aj[i].clear();
pt.clear();
for (auto& [v, u] : bridges) {
aj[v].push_back(u);
aj[u].push_back(v);
}
dfs(1);
int le = 0, ri = N + 1;
while (1 < ri - le) {
int mi = le + (ri - le) / 2;
vector<int> q;
for (int i = 1; i <= mi; i ++)
q.push_back(pt[i - 1]);
if (mi == N || mi == 1) {
ri = mi;
break;
}
int r = query(q);
if (r) ri = mi;
else le = mi;
}
return pt[ri - 1];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Number of queries: 8 |
2 |
Correct |
6 ms |
488 KB |
Number of queries: 9 |
3 |
Correct |
9 ms |
344 KB |
Number of queries: 9 |
4 |
Runtime error |
4 ms |
488 KB |
Execution killed with signal 6 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
9 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |