# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869786 | ElenaBM | ICC (CEOI16_icc) | C++17 | 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;
void subsets(vector<vector<bool>>&matriz, int n){
for (int i = 1; i <= n; ++i){
int sub1 = i;
vector<int>sub2;
for (int j = 1; j <= n; ++j){
if (i == j or matriz[i][j] == true){
continue;
}
else sub2.push_back(j);
}
if (query(1, (int)sub2.size(), sub1, sub2)){
vector<int>opt;
int r = (int)sub2.size() - 1, l = 0;
while (l < r){
int m = (l+r)/2;
opt.clear();
for (int i= 0; i <= m; ++i)opt.push_back(sub2[i]);
if (query(1, (int)opt.size(), sub1, opt)) r = m;
else l = m+1;
}
setRoad(sub1, opt[l]);
matriz[sub1][opt[l]] = true;
matriz[opt[l]][sub1] = true;
return;
}
}
}
void run (int n){
vector<vector<bool>>matriz(n+1, vector<bool>(n+1, false));
for (int i = 0; i < n-1; ++i){
subsets (matriz, n);
}
}