# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164421 | 2019-11-20T13:55:42 Z | Lawliet | ICC (CEOI16_icc) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include “icc.h” using namespace std; typedef pair<int,int> pii; int N; map< pii , bool > hasEdge; void run(int n) { N = n; for(int k = 1 ; k < N ; k++) { bool find = false; int ansA = 0; int ansB = 0; for(int i = 1 ; i <= n && !find ; i++) { for(int j = i + 1 ; j <= n && !find ; j++) { if( hasEdge[ { i , j } ] ) continue; int A[1] = { i }; int B[1] = { j }; int ans = query( 1 , 1 , A , B ); if( ans == 1 ) { find = true; ansA = i; ansB = j; } } hasEdge[ { ansA , ansB } ] = true; setRoad( ansA , ansB ); } } }