# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863677 | TahirAliyev | 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 "icc.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define oo 1e9
vector<vector<int>> comps;
int n;
void f(vector<int> a, vector<int>& b){
while(b.size() != 1){
vector<int> tmp;
for(int i = 0; i <= (b.size() - 1) / 2; i++){
tmp.push_back(b[i]);
}
if(query(a.size(), tmp.size(), a, tmp)){
b = tmp;
}
else{
for(int i : tmp){
remove(b.begin(), b.end(), i);
}
}
}
}
void run(int N){
n = N;
for(int i = 1; i <= n; i++){
comps.push_back({i});
}
for(int z = 1; z < n; z++){
vector<int> a, b;
for(int j = 0; j < 8; j++){
for(int i = 0; i < comps.size(); i++){
if((1 << j) & i) a.push_back(i);
else b.push_back(i);
}
if(query(a.size(), b.size(), a, b)) break;
a.clear(), b.clear();
}
vector<int> v1, v2;
for(int i : a){
for(int j : comps[i]){
v1.push_back(j);
}
}
for(int i : b){
for(int j : comps[i]){
v2.push_back(j);
}
}
f(v1, v2);
f(v2, v1);
int c1, c2;
for(int i = 0; i < comps.size(); i++){
for(int j : comps[i]){
if(v1[0] == j) c1 = i;
if(v2[0] == j) c2 = i;
}
}
vector<int> v;
v.swap(comps[c1]);
for(int j : comps[c2]){
v.push_back(j);
}
comps.erase(comps.begin() + c1);
comps.erase(comps.begin() + c2);
comps.push_back(v);
setRoad(v1[0], v2[0]);
}
}