| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 656421 | ssense | Connecting Supertrees (IOI20_supertrees) | 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 "supertrees.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
int p[1005];
int sz[1005];
void init(int n)
{
for(int i = 0; i < n; i++)
{
p[i] = i;
sz[i] = i;
}
}
int find(int i)
{
if(i != p[i])
{return find(p[i]);}
return i;
}
void usets(int u, int v)
{
if(sz[u] <= sz[v])
{
swap(u, v);
}
p[find(v)] = find(u);
}
int construct(vector<vector<int>> p)
{
int n = p.size();
init(1000);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(p[i][j] == 1)
{
usets(i, j);
}
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(p[i][j] == 0 && find(i) == find(j))
{
return 0;
}
}
}
vector<vector<int>> answer(n, vector<int>(n));
vector<bool> vis(n, false);
for(int i = 0; i < n; i++)
{
int now = i;
while(!vis[now])
{
vis[now] = true;
answer[now][p[now]] = 1;
answer[p[now]][now] = 1;
now = p[now];
}
}
build(answer);
return 1;
}