# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
604684 |
2022-07-25T08:47:00 Z |
fuad27 |
ICC (CEOI16_icc) |
C++17 |
|
389 ms |
492 KB |
#include "icc.h"
#include<bits/stdc++.h>
using namespace std;
void run(int n) {
vector<vector<bool>> vis(n+1,vector<bool>(n+1, 0));
for(int c = 1;c<n;c++) {
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
if(i == j)continue;
int A[1] = {i}, B[1] = {j};
int k = query(1,1,A,B);
if(k>0 and !vis[i][j]) {
// cout << i << " " << j << endl;
setRoad(i,j);
vis[i][j]=1;
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
492 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
136 ms |
472 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
389 ms |
476 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
360 ms |
480 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
329 ms |
484 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
286 ms |
484 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |