# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333940 | daniel920712 | ICC (CEOI16_icc) | C++14 | 449 ms | 624 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <time.h>
#include <assert.h>
#include "icc.h"
using namespace std;
bool have[105][105]={0};
int a[105],b[105];
void run(int N)
{
int ok=1,i,j,k,x,y,t1,t2,con=0;
for(i=1;i<N;i++) for(j=1;j<=N;j++) have[i][j]=0;
for(i=1;i<N;i++)
{
for(j=1;j<=N;j++)
{
t1=0;
t2=0;
a[0]=j;
for(k=j+1;k<=N;k++)
{
b[0]=k;
if(j==k) continue;
if(have[j][k]) continue;
con++;
if(query(1,1,a,b))
{
x=j;
y=k;
}
}
}
setRoad(x,y);
have[x][y]=1;
have[y][x]=1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |