제출 #1197677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1197677		ivaziva	슈퍼트리 잇기 (IOI20_supertrees)	C++20	11 / 100	266 ms	22268 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define MAXN 1001

int N;
int parent[MAXN],siz[MAXN];
vector<vector<int>> adj;
set<int> components[2];
vector<int> korenovi;

int get(int node)
{
    if (parent[node]==node) return node;
    return get(parent[node]);
}

void unite(int node1,int node2)
{
    node1=get(node1),node2=get(node2);if (node1==node2) return;
    if (siz[node1]<siz[node2]) swap(node1,node2);
    parent[node2]=node1;siz[node1]+=siz[node2];adj[node1][node2]=adj[node2][node1]=1;
}

int construct(std::vector<std::vector<int>> p)
{
    N=p.size();adj.resize(N);
    for (int node=0;node<N;node++) {parent[node]=node;siz[node]=1;adj[node].resize(N);}
    for (int node1=0;node1<N;node1++)
    {
        for (int node2=node1+1;node2<N;node2++)
        {
            if (p[node1][node2]!=p[node2][node1]) return 0;
            if (p[node1][node2]==3) return 0;
            if (p[node1][node2]==0)
            {
                for (int node3=node1+1;node3<node2;node3++)
                {
                    if (p[node1][node3]!=0 and p[node3][node2]!=0) return 0;
                }
            }
            else if (p[node1][node2]==1)
            {
                for (int node3=node1+1;node3<node2;node3++)
                {
                    if (p[node1][node3]==p[node3][node1] and (p[node1][node3]==0 or p[node1][node3]==1)) continue;
                    else return 0;
                }
                unite(node1,node2);
            }
        }
    }
    for (int node=0;node<N;node++)
    {
        if (parent[node]==node) {components[0].insert(node);components[1].insert(node);}
    }
    for (int node:components[0])
    {
        if (components[1].find(node)==components[1].end()) continue;
        korenovi.push_back(node);
        for (int sled:components[0])
        {
            if (sled==node) continue;
            if (p[node][sled]==2 and components[1].find(sled)==components[1].end()) return 0;
            else if (p[node][sled]==2) korenovi.push_back(sled);
        }
        if (korenovi.size()==2) return 0;
        for (int koren:korenovi) components[1].erase(koren);
        for (int poz=0;poz<korenovi.size()-1;poz++) {int node1=korenovi[poz],node2=korenovi[poz+1];adj[node1][node2]=adj[node2][node1]=1;}
        int node1=korenovi[0],node2=korenovi[korenovi.size()-1];adj[node1][node2]=adj[node2][node1]=1;korenovi.clear();
        if (components[1].size()==0) break;
    }
    for (int node=0;node<N;node++) adj[node][node]=0;
    build(adj);return 1;
};

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4