| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 988211 | toan2602 | 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;
int par[105];
vector<int> node[105];
bool mark[105];
void make_set(int n) {
for (int i = 1; i <= n; i++) {par[i] = -1; node[i].push_back(i);}
}
int find_anc(int x) {
if(par[x] < 0) return x;
return par[x] = find_anc(par[x]);
}
void union_set(int a, int b){
a = find_anc(a);
b = find_anc(b);
if(a != b) {
if(abs(par[a]) < abs(par[b])) swap(a, b);
for (int i: node[b]) node[a].push_back(i);
par[a] += par[b];
par[b] = a;
}
}
int ask(int n, int m, vector <int> a, vector <int> b)
{
int A[n], B[m];
for (int i=0; i<n; i++) A[i]=a[i];
for (int i=0; i<m; i++) B[i]=b[i];
return query(n, m, A, B);
}
void run(int n) {
vector<int> V, a, b, a2, b2;
for (int i = 1; i < n; i++) {
a.clear();
b.clear();
for (int j = 1; j <= n; j++) mark[j] = false;
for (int j = 1; j <= n; j++) {
if(!mark[find_anc(j)]) {
mark[find_anc(j)] = true;
V.push_back(find_anc(j));
}
}
int sz = V.size(), mx = __lg(sz);
for (int j = 0; j < mx; j++) {
for (int v = 0; v < V.size(); v++) {
if(v >> j & 1) {
for (int dm: node[V[v]]) a.push_back(dm);
}
else {
for (int dm: node[V[v]]) b.push_back(dm);
}
}
int ans = ask(a.size(), b.size(), a, b);
if(ans == 1) {
int l = 0, r = a.size() - 1, mid;
while(l != r) {
mid = (l + r) / 2;
a2.clear();
for (int i = l; i <= mid; i++) {
a2.push_back(a[i]);
}
ans = ask(a2.size(), b.size(), a2, b);
if(ans == 1) r = mid;
else l = mid + 1;
}
a2 = {v[l]};
l = 0, r = b.size() - 1, mid;
while(l != r) {
mid = (l + r) / 2;
b2.clear();
for (int i = l; i <= mid; i++) {
b2.push_back(b[i]);
}
ans = ask(1, b2.size(), a2, b2);
if(ans == 1) r = mid;
else l = mid + 1;
}
b2 = {v[l]};
break;
}
}
setRoad(a2[0], b2[0]);
}
}
//ask
//setRoad