Submission #817785

#	Time	Username	Problem	Language	Result	Execution time	Memory
817785		OrazB	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	308 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

const int N = 1e5+5;
int tp[N];

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