# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869773 | gutzzy | 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 <bits/stdc++.h>
#include "icc.h"
using namespace std;
vector<vector<bool>> lst;
pair<int,int> guess(int n){
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(lst[i][j]==false){
if(query(1,1,{i+1},{j+1})) return {i,j};
}
}
}
return {0,0};
}
void run(int n){
int roads = 0;
lst = vector<vector<bool>>(n,vector<bool>(n, false));
for(int i=0;i<n;i++) lst[i][i]=true;
while(roads<n-1){
pair<int,int> road = guess(n);
setRoad(road.first,road.second);
lst[road.first][road.second] = true;
lst[road.second][road.first] = true;
roads++;
}
}