Submission #433609

#	Time	Username	Problem	Language	Result	Execution time	Memory
433609		SAAD	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	241 ms	22152 KiB

supertrees

#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include "supertrees.h"
using namespace std;
int tree[10002], n;
int construct(vector<vector<int>> p) {
    n = (int)p.size();
    vector <int> s(n);
    vector<vector<int>> a;
    a = p;
    for (auto&i:a[0]) i = 0;
    memset(tree, -1, sizeof(tree));
    for (int i = 0; i < n; i++) {
        a[i] = a[0];
        if (tree[i] != -1) {
            if (p[i] != p[tree[i]]) return 0;
            continue;
        }
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                tree[j] = i;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (tree[i] == i) {
            a[i] = p[i];
            a[i][i] = 0;
        }
        else {
            a[i][tree[i]] = 1;
        }
    }
    build(a);
    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