# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
319465 |
2020-11-05T10:50:09 Z |
shaf_wa_nur |
ICC (CEOI16_icc) |
C++17 |
|
450 ms |
616 KB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
void setRoad(int a, int b);
int query(int size_a, int size_b, int a[], int b[]);
void run(int n) {
while (true) {
for (int x = 1; x <= n; x++) {
for (int y = x + 1; y <= n; y++) {
int _a[] = {x};
int _b[] = {y};
int ret = query(1, 1, _a, _b);
if (ret) {
setRoad(x, y);
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
492 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
168 ms |
616 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
450 ms |
492 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
406 ms |
492 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
369 ms |
492 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
351 ms |
612 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |