| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 306635 | vivaan_gupta | 슈퍼트리 잇기 (IOI20_supertrees) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "supertrees.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define f first
#define s second
#define pll pair<int,int>
// #define int ll
using namespace std;
struct DSU
{
int connected;
vector<int> par, sz;
void init(int n)
{
par = sz = vector<int> (n + 1, 0);
for(int i = 1; i <= n; i++)
par[i] = i, sz[i] = 1;
connected = n;
}
int getPar(int u)
{
while(u != par[u])
{
par[u] = par[par[u]];
u = par[u];
}
return u;
}
int getSize(int u)
{
return sz[getPar(u)];
}
void unite(int u, int v)
{
int par1 = getPar(u), par2 = getPar(v);
if(par1 == par2)
return;
connected--;
if(sz[par1] > sz[par2])
swap(par1, par2);
sz[par2] += sz[par1];
sz[par1] = 0;
par[par1] = par[par2];
}
};
int construct(std::vector<std::vector<int>> p) {
DSU g,g2;
int n = p.size();
g.init(n-1);
g2.init(n-1);
std::vector<std::vector<int>> ans;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
ans.push_back(row);
}
bool ok = false;
bool ok2 = false;
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
ok |= (p[i][j] == 1);
ok2 |= (p[i][j] == 2);
}
}
if(!ok2 && !ok){
for(int i =0;i<n;i++){
for(int j =0;j<n;j++){
ans[i][j] =0;
}
}
build(ans);
return 1;
}
if(!ok){
for(int i =0;i<n;i++){
for(int j =i+1;j<n;j++){
if(p[i][j] == 2){
g.unite(i,j);
}
}
}
map<int,int> col;
vector<int> wow[n+1];
int c = 1;
for(int i =0;i<n;i++){
int op = g.getPar(i);
if(col[op] == 0){
col[op] = c;
c++;
}
wow[col[op]].pb(i);
}
c--;
for(int i =0;i<n;i++){
for(int j =0;j<n;j++){
ans[i][j] = 0;
}
}
for(int i =1;i<=c;i++){
if(wow[i].size() == 1) continue;
for(int j= 0;j<wow[i].size()-1;j++){
ans[wow[i][j]][wow[i][j+1]] = 1;
ans[wow[i][j+1]][wow[i][j]] = 1;
}
ans[wow[i].back()][wow[i][0]] = 1;
ans[wow[i][0]][wow[i].back()] = 1;
}
build(ans);
return 1;
}
for(int i =0;i<n;i++){
for(int j =i+1;j<n;j++){
if(p[i][j] >= 1){
g.unite(i,j);
}
if(p[i][j] == 1){
g2.unite(i,j);
}
}
}
map<int,int> col;
vector<int> wow[n+1];
int c = 1;
for(int i =0;i<n;i++){
int op = g.getPar(i);
if(col[op] == 0){
col[op] = c;
c++;
}
wow[col[op]].pb(i);
}
c--;
for(int i =0;i<n;i++){
for(int j =0;j<n;j++){
ans[i][j] = 0;
}
}
for(int i = 1;i<=c;i++){
if(wow[i].size() == 1) continue;
col.clear();
int gg = 1;
vector<int> chains[n+2];
for(int j = 0;j<wow[i].size();j++){
int op = g2.getPar(wow[i][j]);
if(col[op] == 0){
col[op] = gg;
gg++;
}
chains[col[op]].pb(wow[i][j]);
}
vector<int> v;
for(int j =1;j<gg;j++){
for(int k=0;k<chains.size()-1;k++){
ans[chains[j][k]][chains[j][k+1]] = 1;
ans[chains[j][k+1]][chains[j][k]] = 1;
}
v.pb(chains[j].back());
}
for(int i= 0;i<v.size()-1;i++){
ans[v[i]][v[i+1]] = 1;
ans[v[i+1]][v[i]] = 1;
}
if(v.size() == 1) continue;
ans[v.back()][v[0]] = 1;
ans[v[0]][v.back()] = 1;
}
build(ans);
return 1;
}
// void solve(){
// }
// signed main(){
// ios_base::sync_with_stdio(0);
// cin.tie(NULL);
// // freopen(".in","r",stdin);freopen(".out","w",stdout);
// ll tt=1;
// // cin >> tt;
// while(tt--){
// solve();
// }
// }