//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
void run(int n) {
int r, a, b, A[1], B[1];
bool E[15][15] = {};
assert(false);
for (int i = 0; i < n - 1; i++) {
a = -1;
b = -1;
for (int j = 0; j < n; j++) {
for (int k = 0; k < j; k++) {
A[0] = j + 1;
B[0] = k + 1;
r = query(1, 1, A, B);
if (r == 1 && !E[j][k]) {
a = j;
b = k;
}
}
}
E[a][b] = true;
setRoad(a + 1, b + 1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |