Submission #441902

#	Time	Username	Problem	Language	Result	Execution time	Memory
441902		PiejanVDC	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	263 ms	24000 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
void build(std::vector<std::vector<int>> _b);
vector<int>parent;

int uf(int p) {
    if(parent[p] == p) return p;
    return parent[p] = uf(parent[p]);
}

bool same(int u, int v) {
    if(uf(u) == uf(v)) {
        return true;
    }
    return false;
}

int construct(vector<vector<int>> p) {
    int n = p.size();
    parent.resize(n);
    for(int i = 0 ; i < n ; i++) {
        parent[i]=i;
    }
    vector<vector<int>>v(n,vector<int>(n,0));
    for(int i = 0 ; i < n-1 ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(p[i][j]) {
                if(!same(i,j)) {
                    v[i][j]=1,v[j][i]=1;
                    parent[j]=i;
                }
            }
        }
    }
    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(!p[i][j]) {
                if(same(i,j)) {
                    return 0;
                }
            }
        }
    }
    build(v);
    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