# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1111164 |
2024-11-11T15:35:42 Z |
Ghulam_Junaid |
ICC (CEOI16_icc) |
C++17 |
|
282 ms |
760 KB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
const int N = 105;
int n;
bool edge[N][N];
void run(int nn){
n = nn;
for (int i=1; i<n; i++){
bool done = 0;
for (int u = 1; u <= n; u++){
for (int v = u + 1; v <= n; v++){
int a[1] = {u};
int b[1] = {v};
if (!done and !edge[u][v] and query(1, 1, a, b)){
done = 1;
edge[u][v] = 1;
setRoad(u, v);
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
624 KB |
Ok! 1015 queries used. |
2 |
Correct |
41 ms |
592 KB |
Ok! 1010 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
214 ms |
628 KB |
Number of queries more than 5000 out of 2500 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
282 ms |
592 KB |
Number of queries more than 4500 out of 2250 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
219 ms |
628 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
173 ms |
592 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
171 ms |
760 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |