#include <bits/stdc++.h>
#include "grader.h"
#define ll long long
using namespace std;
vector<vector<int>>v(520);
vector<int>order;
vector<bool>check(520,0);
void dfs(int i){
check[i]=1;
order.push_back(i);
for(auto j: v[i])
if(!check[j])
dfs(j);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=0;i<513;i++){
v[i].clear();
check[i]=0;
}
order.clear();
for(int i=0;i<=N-1;i++){
int x=bridges[i].first;
int y=bridges[i].second;
v[i].push_back(y);
v[y].push_back(x);
}
dfs(1);
int l=0,r=N-1;
while(l!=r){
ll mid=(l+1+r)/2;
if(query(vector<int>(order.begin(),order.begin()+mid)))
r=mid-1;
else
l=mid;
}
return order[l];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |