Submission #1061857

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061857		ArthuroWich	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	122 ms	28084 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
int n, vis[1005], co = 0;
void dfs(int i) {
    if (vis[i] > 0) {
        return;
    }
    vis[i] = co;
    for (int j = 0; j < n; j++) {
        if (i == j || adj[i][j] == 0) {
            continue;
        }
        dfs(j);
    }
}
int construct(vector<vector<int>> p) {
    n = p.size();
    adj = p;
    vector<vector<int>> ans(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        if (vis[i] > 0) {
            continue;
        }
        co++;
        dfs(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 0) {
                if (vis[i] == vis[j]) {
                    return 0;
                }
            } else {
                if (vis[i] != vis[j]) {
                    return 0;
                }
            }
        }
    }
    for (int i = 1; i <= co; i++) {
        int root = 0;
        for (int j = 0; j < n; j++) {
            if (vis[j] == i) {
                root = j;
                break;
            }
        }
        for (int j = root+1; j < n; j++) {
            if (vis[j] == i) {
                ans[root][j] = 1;
                ans[j][root] = 1; 
            }
        }
    }
    build(ans);
    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