#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> islands;
vector<bool> visited;
vector<vector<int>> lst;
void dfs(int nodo){
visited[nodo] = true;
islands.push_back(nodo);
for(int vecino:lst[nodo]){
if(!visited[vecino]) dfs(vecino);
}
}
int findEgg(int n, vector<pair<int, int>>bridges){
// vector 1D de todas las islas
lst = vector<vector<int>>(n,vector<int>());
for(auto b:bridges){
lst[b.first-1].push_back(b.second-1);
lst[b.second-1].push_back(b.first-1);
}
visited = vector<bool>(n,false);
dfs(0);
for(int i=0;i<n;i++) islands[i]++;
// binary search
int l = 0;
int r = n-1;
while(l<r){
int m = (l+r)/2;
//cout << l << " " << r << " " << m << endl;
bool egg = query({islands.begin(),islands.begin()+m+1});
if(egg) r = m;
else l = m+1;
}
return islands[l];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
436 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
472 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
516 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |