Submission #1015981

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015981		deera	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	348 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<int> dist = {0, 0, 0, 0};

    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            dist[p[i][j]]++;

    // subtask 1
    if (dist[1] == n*n) {
        vector<vector<int>> r(n, vector<int>(n));
        for(int i=0;i<n;i++) {
            r[i][(i+1)%n] = 1;
            r[(i+1)%n][i] = 1;
        }

        build(r);
        return 1;
    }

    return 0;
}

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