Submission #1190455

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190455		anmattroi	Connecting Supertrees (IOI20_supertrees)	C++17	40 / 100	128 ms	22324 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#define maxn 1005
using namespace std;

int par[maxn], n;
int find_set(int v) {
    return par[v] < 0 ? v : par[v] = find_set(par[v]);
}

void union_set(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u == v) return;
    if (par[u] < par[v]) swap(u, v);
    par[v] += par[u];
    par[u] = v;
}

map<int, vector<int> > nho;
vector<vector<int> > a;

int construct(vector<vector<int>> p) {
    n = p.size();
    fill(par, par+n, -1);

    for (int i = 0; i < n; i++)
    for (int j = i+1; j < n; j++)
    if (p[i][j]) union_set(i, j);

    for (int i = 0; i < n; i++)
    for (int j = i+1; j < n; j++)
    if (!p[i][j] && find_set(i) == find_set(j)) return 0;

    for (int i = 0; i < n; i++) nho[find_set(i)].emplace_back(i);

    for (auto [x, vi] : nho) a.push_back(vi);

    vector<vector<int> > ans(n, vector<int>(n, 0));

    for (auto &vi : a) {
        int mx = 0;
        for (int i = 0; i < vi.size(); i++)
        for (int j = i+1; j < vi.size(); j++)
        mx = max(mx, p[vi[i]][vi[j]]);
        if (mx >= vi.size()) return 0;
        for (int i = 1; i < vi.size(); i++)
            ans[vi[i]][vi[i-1]] = ans[vi[i-1]][vi[i]] = 1;
        if (mx == 2) ans[vi[0]][vi.back()] = ans[vi.back()][vi[0]] = 1;
     }
     build(ans);
     return 1;
}

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