Submission #1004236

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004236		spensa	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	116 ms	23960 KiB

supertrees

#include "supertrees.h"
#include <vector>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
    //subtask 1: star graph
	int n = p.size();
    // vector<vector<int>> ans();
    vector<vector<int>> ans(n, vector<int> (n));  

    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            // if(i==j) ans[i][j] = 1;
            // else
            ans[i][j] = 0;
        }
    }
    for(int i=1; i<n; i++){
        ans[i][0] = 1;
        ans[0][i] = 1;
    }

    build(ans);
	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