Submission #1185042

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185042		islam_2010	Connecting Supertrees (IOI20_supertrees)	C++20	0 / 100	0 ms	328 KiB

supertrees

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

void dfs(int node, const vector<vector<int>> &p, int c, vector<int> &comp) {
    comp[node] = c;
    int n = p.size();
    for (int i = 0; i < n; i++) {
        if (p[node][i] > 0 && comp[i] == -1) {
            dfs(i, p, c, comp);
        }
    }
}

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> b(n, vector<int>(n, 0));
    vector<int> comp(n, -1);
    int c = 0;

    for (int i = 0; i < n; i++) {
        if (comp[i] == -1) {
            dfs(i, p, c++, comp);
        }
    }

    for (int c = 0; c < c; c++) {
        vector<int> g;
        for (int i = 0; i < n; i++) {
            if (comp[i] == c) g.push_back(i);
        }

        bool has1 = false, has2 = false;
        for (int i : g) {
            for (int j : g) {
                if (i == j) continue;
                if (p[i][j] == 1) has1 = true;
                if (p[i][j] == 2) has2 = true;
            }
        }

        if (has1 && has2) return 0; 

        int m = g.size();
        if (has1) {
            for (int i = 0; i + 1 < m; i++) {
                int u = g[i], v = g[i + 1];
                b[u][v] = b[v][u] = 1;
            }
        } else if (has2) {
            if (m < 3) return 0; 
            for (int i = 0; i < m; i++) {
                int u = g[i], v = g[(i + 1) % m];
                b[u][v] = b[v][u] = 1;
            }
        }
    }

    build(b);
    return 1;
}

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