Submission #300802

#	Time	Username	Problem	Language	Result	Execution time	Memory
300802		fpc_coder	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	260 ms	22268 KiB

supertrees

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

using namespace std;

int construct(vector<vector<int>> p) {
    vector<vector<int>> b(p.size(), vector<int>(p.size(), 0));
    int n = (int) p.size();
    vector<int> par(n);
    for (int i = 0; i < n; i++) par[i] = i;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (p[i][j]) par[j] = i;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (par[i] == par[j] && p[i][j] == 0) return 0;
            if (par[i] != par[j] && p[i][j] == 1) return 0;
        }
    }
    for (int i = 0; i < n; i++) {
        if (par[i] != i) {
            b[i][par[i]] = 1;
            b[par[i]][i] = 1;
        }
    }
    build(b);
    return 1;
}

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