#include <vector>
#include <cassert>
#include "grader.h"
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
const int mx = 512;
vi edge[1+mx];
vi ord(1, 0);
vi vis(1+mx, 0);
void dfs(int u, int p)
{
vis[u] = 1;
ord.push_back(u);
for(int v : edge[u])
{
if(v != p && !vis[v])
dfs(v, u);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(pii b: bridges)
{
edge[b.first].push_back(b.second);
edge[b.second].push_back(b.first);
}
dfs(1, 0);
// assert(int(bridges.size()) == N);
// assert(int(ord.size()) == N+1);
// int lo = 1, hi = N;
// while(lo != hi)
// {
// int mid = (lo+hi)/2;
// vi qr;
// for(int i = 1; i <= mid; i++)
// qr.push_back(ord[i]);
// if(query(qr))
// hi = mid;
// else
// lo = mid+1;
// }
// return ord[lo];
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
The found island is incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
328 KB |
The found island is incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
328 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |