#include <bits/stdc++.h>
#include "grader.h"
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int Inf = 100000;
const int mod = 998244353;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
vector <int> DFSorder;
vector <int> Adj[505];
void DFS(int node, int p = -1)
{
DFSorder.eb(node);
for(auto x : Adj[node])
{
if(x != p)
{
DFS(x, node);
}
}
}
int findEgg(int n, vector <pii> bridges)
{
for(auto x : bridges)
{
Adj[x.fi].eb(x.se);
Adj[x.se].eb(x.fi);
}
DFSorder.clear();
DFS(1);
int l = 0, r = n - 1;
while(l < r)
{
int mid = (l + r) >> 1;
vector <int> Ans;
for(int i = 0; i <= mid; i++)
{
Ans.eb(DFSorder[i]);
}
if(query(Ans))
{
r = mid;
}
else
{
l = mid + 1;
}
}
return DFSorder[l];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
7 ms |
1656 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
302 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |