# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
51910 |
2018-06-22T16:05:38 Z |
someone_aa |
ICC (CEOI16_icc) |
C++17 |
|
432 ms |
884 KB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
void run(int N) {
bool road[N+2][N+2];
memset(road, false, sizeof(road));
for(int i=0;i<N-1;i++) {
for(int j=1;j<=N;j++) {
for(int k=1;k<j;k++) {
if(!road[k][j]) {
int a[] = {j};
int b[] = {k};
bool check = query(1, 1, a, b);
if(check) {
road[j][k] = road[k][j] = true;
setRoad(j, k);
break;
}
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
22 ms |
504 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
271 ms |
740 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
432 ms |
740 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
363 ms |
884 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
305 ms |
884 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
276 ms |
884 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |