# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
101247 |
2019-03-18T04:37:00 Z |
cheeheng |
ICC (CEOI16_icc) |
C++14 |
|
3 ms |
384 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
//int query(int a,int b,int* A,int *B);
//void setRoad(int a,int b);
int a[105];
int b[105];
int P[105];
bool hasEdge[105][105];
void run(int n) {
for(int i = 0; i < n; i ++){
P[i] = i+1;
}
for(int k = 1; k < n; k ++){
for(int i = 1; i <= n; i ++){
int cnt = 0;
for(int j = i; j <= n; j ++){
if(!hasEdge[j][i]){
b[cnt++] = j;
}
}
a[0] = i;
if(query(1, cnt, a, b)){
for(int j = i; j <= n; j ++){
b[0] = j;
if(!hasEdge[j][i]){
if(query(1, 1, a, b)){
hasEdge[j][i] = true;
hasEdge[i][j] = true;
//printf("%d %d\n", i, j);
setRoad(i, j);
}
}
}
break;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
384 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
384 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
The query sets must be disjoint |
2 |
Halted |
0 ms |
0 KB |
- |