Submission #621142

#	Time	Username	Problem	Language	Result	Execution time	Memory
621142		Mr_Husanboy	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	193 ms	23932 KiB

supertrees

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

int construct(vector<vector<int>> p) {
    //return 1;
	int n = p.size();
	vector<vector<int>> b(n,vector<int> (n));
    for(int i = 0; i < n; i ++){
        for(int j = 0; j < n; j ++){
            if(abs(i-j) == 1) b[i][j] = 1;
        }
    }
    build(b);
    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