#include "park.h"
#include <bits/stdc++.h>
using namespace std;
static int Place[1400];
vector<int> edge[1400];
int dfn[1401], idfn[1401], dfnn;
void dfs(int x, int p) {
dfn[x] = ++dfnn;
idfn[dfnn] = x;
for (auto i : edge[x])
if (i != p) dfs(i, x);
}
bool f(int m, int x) {
if (m > x) return 0;
memset(Place, 0, sizeof(Place));
Place[0] = Place[x] = 1;
for (int i = 1; i <= m; ++i) Place[idfn[i]] = 1;
return Ask(0, x, Place);
}
void Detect(int T, int N) {
if (T == 1) {
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
memset(Place, 0, 4 * N);
Place[i] = Place[j] = 1;
if (Ask(i, j, Place)) Answer(i, j);
}
}
return;
}
if (T < 5) {
for (int i = 1; i < N; ++i) {
dfnn = 0;
dfs(0, 0);
int l = 1, r = i + 1;
while (l < r) {
int m = l + r >> 1;
if (f(m, i)) r = m;
else l = m + 1;
}
if (l <= i) {
edge[idfn[l]].push_back(i);
edge[i].push_back(idfn[l]);
Answer(min(idfn[l], i), max(idfn[l], i));
}
}
return;
}
}
Compilation message
park.cpp: In function 'void Detect(int, int)':
park.cpp:41:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int m = l + r >> 1;
~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
9 ms |
376 KB |
Output is correct |
3 |
Correct |
9 ms |
376 KB |
Output is correct |
4 |
Correct |
9 ms |
376 KB |
Output is correct |
5 |
Correct |
9 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
37 ms |
504 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
35 ms |
504 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
488 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |