# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
700894 |
2023-02-19T11:03:46 Z |
beaconmc |
ICC (CEOI16_icc) |
C++14 |
|
402 ms |
480 KB |
#include "icc.h"
#include <bits/stdc++.h>
typedef int ll;
using namespace std;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
void run(int N){
FOR(i,0,N-1){
bool flag = false;
FOR(k,0,N){
FOR(p,k+1,N){
ll a[1] = {k+1};
ll b[1] = {p+1};
ll sus = query(1, 1, a, b);
if (sus==1) flag=true,setRoad(k+1, p+1);
if (flag) break;
}
if (flag) break;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
51 ms |
480 KB |
Ok! 1015 queries used. |
2 |
Correct |
57 ms |
480 KB |
Ok! 1010 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
140 ms |
472 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
402 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 |
342 ms |
472 KB |
Number of queries more than 4000 out of 2000 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
313 ms |
480 KB |
Number of queries more than 3550 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
297 ms |
480 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |