# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
604763 |
2022-07-25T09:34:55 Z |
snasibov05 |
ICC (CEOI16_icc) |
C++14 |
|
339 ms |
480 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
void run(int n) {
int arra[n+1], arrb[n+1];
vector<vector<bool>> ed(n+1, vector<bool>(n+1));
for(int i = 0; i < n - 1; i++) {
int u = -1, v = -1;
for (int j = 1; j <= n; ++j){
arra[0] = j;
int x = 0;
for (int k = 1; k <= n; ++k){
if (ed[j][k] || j == k) continue;
arrb[x++] = k;
}
if (x == 0) continue;
if (query(1, x, arra, arrb)) {
if (u == -1) u = j;
else v = j;
}
}
assert(u != -1 && v != -1);
setRoad(u, v);
ed[u][v] = ed[v][u] = true;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
468 KB |
Ok! 210 queries used. |
2 |
Incorrect |
5 ms |
424 KB |
Wrong road! |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
468 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
339 ms |
480 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
54 ms |
480 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
39 ms |
480 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
263 ms |
480 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |