Submission #1135369

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135369		Nonbangkok	Connecting Supertrees (IOI20_supertrees)	C++20	0 / 100	1 ms	328 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
#define forr(i, a, n) for (int i = a; i < n; i++)
#define endll "\n"
#define sp " "
using namespace std;
typedef long long ll;

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

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