# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1028270 | serifefedartar | 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"
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 20
const ll MOD = 1e9 + 7;
const ll MAXN = 105;
int par[MAXN], sz[MAXN], temp1[MAXN], temp2[MAXN];
int find(int node) {
if (node == par[node])
return node;
return par[node] = find(par[node]);
}
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return ;
if (sz[b] > sz[a])
swap(a, b);
sz[a] += sz[b];
par[b] = a;
}
int qry(int sz1, int sz2, vector<int> A, vector<int> B) {
for (int i = 0; i < sz1; i++)
temp1[i] = A[i];
for (int i = 0; i < sz2; i++)
temp2[i] = B[i];
return query(sz1, sz2, temp1, temp2);
}
void match(vector<vector<int>> arr) {
while (true) {
random_shuffle(arr.begin(), arr.end(), mt);
vector<int> A, B;
for (int i = 0; i < arr.size() / 2; i++) {
for (auto u : arr[i])
A.push_back(u);
}
for (int i = arr.size() / 2; i < arr.size(); i++) {
for (auto u : arr[i])
B.push_back(u);
}
if (qry(A.size(), B.size(), A, B)) {
while ((int)B.size() > 1) {
vector<int> X, Y;
for (int i = 0; i < (int)B.size() / 2; i++)
X.push_back(B[i]);
for (int i = (int)B.size() / 2; i < (int)B.size(); i++)
Y.push_back(B[i]);
if (qry(A.size(), X.size(), A, X))
B = X;
else
B = Y;
}
while ((int)A.size() > 1) {
vector<int> X, Y;
for (int i = 0; i < (int)A.size() / 2; i++)
X.push_back(A[i]);
for (int i = (int)A.size() / 2; i < (int)A.size(); i++)
Y.push_back(A[i]);
if (qry(X.size(), 1, X, B))
A = X;
else
A = Y;
}
setRoad(B[0], A[0]);
unite(B[0], A[0]);
return ;
}
}
}
int n;
void solve() {
map<int, vector<int>> mp;
for (int i = 1; i <= n; i++)
mp[find(i)].push_back(i);
vector<vector<int>> temp;
for (auto u : mp)
temp.push_back(u.s);
match(temp);
}
void run(int N) {
n = N;
for (int i = 1; i <= N; i++)
sz[i] = 1, par[i] = i;
for (int i = 1; i < N; i++)
solve();
}