Submission #421193

#	Time	Username	Problem	Language	Result	Execution time	Memory
421193		Apiram	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	204 KiB

supertrees

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

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> answer;
    for (int i = 0; i < n; i++) {
        vector<int> row;
        row.resize(n);
        answer.push_back(row);
    }
    vector<bool> visited(n);
    vector<int> component(n, -1);
    for (int i = 0; i < n; i++) {
        if (visited[i]) continue;
        component[i] = i;
        int cur = i;
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if (p[i][j]) {
                if (visited[j]) return 0;
                visited[j] = true;
                answer[cur][j] = answer[j][cur] = 1;
                component[j] = i;
                cur = j;
            }
        }
        if (answer[i][cur]) return 0; // 2 cycle
        answer[i][cur] = answer[cur][i] = 1;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if ((component[i] == component[j]) != (p[i][j] == 2)) return 0;
        }
    }
    build(answer);
    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