# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
700893 | beaconmc | ICC (CEOI16_icc) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 sus = query(1, 1, {k+1}, {p+1});
if (sus==1) flag=true,setRoad(k+1, p+1);
if (flag) break;
}
if (flag) break;
}
}
}