| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1291621 | lucaskojima | 슈퍼트리 잇기 (IOI20_supertrees) | C++17 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
#include "supertrees.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
struct dsu {
vector<int> e;
dsu(int n) : e(n, -1) {}
int find(int v) { return e[v] < 0 ? v : e[v] = find(e[v]); }
bool same(int a, int b) { return find(a) == find(b); }
void une(int a, int b) {
a = find(a), b = find(b);
if (a == b) return;
if (e[a] < e[b]) swap(a, b);
e[b] += e[a];
e[a] = b;
}
};
int construct(vector<vector<int>> p) {
in n = sz(p);
dsu dsu(n);
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
if (p[i][j] == 1)
dsu.une(i, j);
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
if (p[i][j] == 0 && dsu.same(i, j))
return 0;
vector<int> comp(n);
for (int i = 0; i < n; i++) {
int p = dsu.find(i);
comp[p].push_back(i);
}
vector ans(n, vector<int>(n));
for (int i = 0; i < n; i++)
for (int x : comp[i]) {
ans[i][x] = 1;
ans[x][i] = 1;
}
build(ans);
return 1;
}