# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
51929 |
2018-06-22T16:28:28 Z |
someone_aa |
ICC (CEOI16_icc) |
C++17 |
|
420 ms |
788 KB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
/*int query(int a, int b, int x[], int y[]) {
cout<<x[0]<<" "<<y[0]<<"\n";
int answ;
cin>>answ;
return answ;
}
void setRoad(int x, int y) {
cout<<"Road: "<<x<<" "<<y<<"\n";
}*/
void run(int N) {
bool road[N+2][N+2];
memset(road, false, sizeof(road));
for(int i=1;i<N-1;i++) {
for(int j=1;j<=N;j++) {
for(int k=1;k<j;k++) {
if(!road[k][j] && j!=k) {
int a[] = {j};
int b[] = {k};
bool check = bool(query(1, 1, a, b));
if(check) {
road[j][k] = road[k][j] = true;
setRoad(k, j);
for(int c=1;c<=N;c++) {
if(road[c][k]) {
road[j][c] = road[c][j] = true;
}
if(road[j][c]) {
road[k][c] = road[c][k] = true;
}
}
break;
}
}
}
}
}
}
/*int main() {
run(4);
}*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
61 ms |
504 KB |
Not all edges were guessed! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
420 ms |
612 KB |
Number of queries more than 5000 out of 2500 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
367 ms |
652 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
343 ms |
724 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
283 ms |
724 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
261 ms |
788 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |