#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>v;
vector<int>g[605];
void dfs(int node, int par)
{
for(int i : g[node])
{
if(i != par)
dfs(i,node);
}
}
int findEgg (int n, vector<pair<int,int>>b)
{
v.clear();
for(int i = 0; i <= n; ++i)
g[i].clear();
for(pair<int,int> i : b)
{
g[i.first].push_back(i.second);
g[i.second].push_back(i.first);
}
dfs(1,1);
int l = 0, r = v.size() - 1;
while(l < r)
{
int mid = (l + r) / 2;
vector<int>w;
for(int i = 0; i <= mid; ++i)
w.push_back(v[i]);
if(query(w))
r = mid;
else
l = mid + 1;
}
return v[l];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |