# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632314 | Cyber_Wolf | 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.
//CEOI '16 P1
//Problem: ICC
//Link: https://oj.uz/problem/view/CEOI16_icc
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define lg long long
const lg MOD = 1e9+7, N = 101, M = 1e7+1, SZ = 1e3+1;
lg par[N], compSize[N];
lg getParent(lg src)
{
if(src == par[src]) return src;
return par[src] = getParent(par[src]);
}
void join(lg u, lg v)
{
u = getParent(u), v = getParent(v);
if(u == v) return;
if(compSize[u] > compSize[v]) swap(u, v);
par[u] = v;
compSize[v] += compSize[u];
}
void run(int n)
{
for(int i = 1; i <= n; i++) par[i] = i, compSize[i] = 1;
lg x = n-1;
while(x--)
{
for(int i = 1; i <= n; i++)
{
vector<lg> v;
for(int j = 1; j <= n; j++) if(getParent(i) != getParent(j)) v.push_back(j);
int arr[v.size()];
for(int j = 0; j < v.size(); j++) arr[j] = v[j];
int h[1] = {i};
bool flag = query(1, v.size(), h, arr);
if(!flag) continue;
for(auto it : v)
{
int g[] = {it};
bool cur = query(1, 1, h[0], g[0]);
if(cur)
{
join(h, g);
setRoad(h, g);
break;
}
}
}
}
}