| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 526785 | Olympia | 슈퍼트리 잇기 (IOI20_supertrees) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
//#include "supertrees.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
using namespace std;
class DisjointSetUnion {
protected:
vector<int> parent;
vector<int> compSize;
const int n;
int connectedComponents;
public:
int getConnectedComponents() const {
return connectedComponents;
}
public:
DisjointSetUnion(int sz) : n(sz), connectedComponents(sz) {
parent.resize(sz), compSize.resize(sz);
for (int i = 0; i < n; i++) {
parent[i] = i, compSize[i] = 1;
}
}
int find_head(int x) const {
int cur = x;
while (cur != parent[cur]) {
cur = parent[cur];
}
return cur;
}
void join(int x, int y) {
x = find_head(x);
y = find_head(y);
if (x == y) {
return;
}
if (compSize[x] > compSize[y]) {
swap(x, y);
//ensures that compSize[x1] <= compSize[y1]
}
parent[x] = y;
compSize[y] += compSize[x];
connectedComponents--;
}
bool comp(int x, int y) {
return (find_head(x) == find_head(y));
}
};
void build (vector<vector<int>> grid) {
for (int i = 0; i < grid.size(); i++) {
for (int j: grid[i]) {
cout << j << ' ';
}
cout << '\n';
}
}
int construct (vector<vector<int>> grid) {
vector<vector<int>> ans(grid.size());
for (int i = 0; i < grid.size(); i++) {
ans[i].assign(grid[0].size(), 0);
}
set<int> s;
vector<int> cnt = {0, 0, 0, 0};
DisjointSetUnion disjointSetUnion(grid.size());
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid.size(); j++) {
s.insert(grid[i][j]);
cnt[grid[i][j]]++;
if (grid[i][j] != 0) {
disjointSetUnion.join(i, j);
}
}
}
if (s.count(1) && s.size() == 1) {
for (int i = 1; i < grid.size(); i++) {
ans[i][0] = ans[0][i] = 1;
}
build(ans);
return 1;
}
map<int,vector<int>> myMap;
for (int i = 0; i < grid.size(); i++) {
myMap[disjointSetUnion.find_head(i)].push_back(i);
}
if (s.count(1) && s.count(0) && s.size() == 2) {
return 0;
for (auto& p: myMap) {
vector<int> v = p.second;
for (int i = 1; i < (int)v.size(); i++) {
ans[v[i]][v[0]] = 1;
ans[v[0]][v[i]] = 1;
}
for (int x: v) {
for (int y: v) {
if (grid[x][y] != 1) return false;
}
}
}
build(ans);
return 1;
}
if (cnt[0] >= 0 && cnt[2] >= 0 && cnt[1] == (int)grid.size()) {
for (auto& p: myMap) {
vector<int> v = p.second;
if (v.size() == 2) {
return 0;
}
if (v.size() <= 1) {
continue;
}
for (int i = 1; i < (int)v.size(); i++) {
ans[v[i]][v[i - 1]] = 1;
ans[v[i - 1]][v[i]] = 1;
}
ans[v[0]][v.back()] = ans[v.back()][v[0]] = 1;
for (int x: v) {
for (int y: v) {
if (grid[x][y] == 0) {
return 0;
}
}
}
}
build(ans);
return 1;
}
}
int main () {
const int N = 7;
vector<vector<int>> grid = {{1, 2}, {2, 1}};
cout << construct(grid);
}