Submission #771001

#	Time	Username	Problem	Language	Result	Execution time	Memory
771001		OrazB	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	276 ms	30768 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#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

vector<int> vec[N];

int construct(vector<vector<int>> p){
	int n = p.size();
	vector<vector<int>> b(n, vector<int>(n, 0));
	vector<int> vis(n, 0);
	int cnt = 0;
	for (int i = 0; i < n; i++){
		if (!vis[i]) vis[i] = ++cnt;
		for (int j = 0; j < n; j++){
			if (p[i][j] and i != j) vis[j] = vis[i];
			else if (!p[i][j]) vec[vis[i]].pb(j);
		}
	}
	for (int i = 0; i < n; i++){
		for (auto j : vec[vis[i]]){
			if (p[i][j]) return 0;
		}
	}
	vector<int> chk(n+1, 0);
	for (int i = 0; i < n; i++){
		if (chk[vis[i]]++) continue;
		for (int j = 0; j < n; j++){
			if (p[i][j] and i != j) b[i][j] = b[j][i] = 1; 
		}
	}
	// for (int i = 0; i < n; i++){
	// 	for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
	// 	cout << '\n';
	// }
	build(b);
	return 1;
}
// int main ()
// {
// 	int n;
// 	cin >> n;
// 	vector<vector<int>> p(n, vector<int>(n));
// 	for (int i = 0; i < n; i++){
// 		for (int j = 0; j < n; j++) cin >> p[i][j];
// 	}
// 	int x = construct(p);
// }	

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