# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333944 | 2020-12-08T03:48:18 Z | daniel920712 | ICC (CEOI16_icc) | C++14 | 0 ms | 0 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[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++) { t1=0; for(j=1;j<=N;j++) { 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)) { if(t1) while(1); t1++; x=j; y=k; } } } setRoad(x,y); have[x][y]=1; have[y][x]=1; } }