# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333939 | 2020-12-08T03:44:54 Z | daniel920712 | ICC (CEOI16_icc) | C++14 | 505 ms | 676 KB |
#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[1005][1005]={0}; int a[1005],b[1005]; 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 101 ms | 620 KB | Ok! 1379 queries used. |
2 | Incorrect | 23 ms | 492 KB | Wrong road! |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 415 ms | 512 KB | Number of queries more than 5000 out of 2500 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 505 ms | 676 KB | Number of queries more than 4500 out of 2250 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 476 ms | 620 KB | Number of queries more than 4000 out of 2000 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 413 ms | 620 KB | Number of queries more than 3550 out of 1775 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 383 ms | 676 KB | Number of queries more than 3250 out of 1625 |
2 | Halted | 0 ms | 0 KB | - |