Submission #301272

#	Time	Username	Problem	Language	Result	Execution time	Memory
301272		Gilgamesh	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	245 ms	22092 KiB

supertrees

#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    std::vector<std::vector<int>> answer;
    for (int i = 0; i < n; i++) {
        std::vector<int> row;
        row.resize(n);
        answer.push_back(row);
    }
    for(int i = 0; i < n - 1; ++i){
        answer[i][i + 1] = 1;
        answer[i + 1][i] = 1;
    }
    build(answer);
    return 1;
}

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