Submission #399602

#	Time	Username	Problem	Language	Result	Execution time	Memory
399602		luisgalan	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	234 ms	24000 KiB

supertrees

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

const int MAX_N = 1e3 + 3;

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    vector<vector<int>> result(n);
    fill(result.begin(), result.end(), vector<int>(n));
    if (n == 1) {
        build(result);
        return 1;
    }
    result[0][1] = 1;
    result[n-1][n-2] = 1;
    for (int i = 1; i < n-1; i++) {
        result[i][i-1] = 1;
        result[i][i+1] = 1;
    }

    build(result);
    return 1;
}

// subtask 1
// answer is always a spanning tree
// or just a path lol
// just connect adjacent nodes

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