Submission #1287019

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287019		nathlol2	Connecting Supertrees (IOI20_supertrees)	C++20	11 / 100	98 ms	30212 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int N, idx;
vector<bool> vis(1005, false);
vector<vector<int>> c;
vector<vector<int>> chk;
void dfs(int u){
	vis[u] = 1;
	chk[idx].push_back(u);
	for(int i = 0;i<N;i++){
		if(!vis[i] && c[u][i]){
			dfs(i);
		}
	}
}
int construct(std::vector<std::vector<int>> p) {
	N = p.size();
	vector<vector<int>> ans(N, vector<int>(N, 0));
	vector<vector<int>> g(N);
	vector<bool> v(N, 0);
	for(int i = 0;i<N;i++){
		for(int j = 0;j<N;j++){
			if(i == j) continue;
			if(p[i][j]){
				g[i].push_back(j);
			}
		}
	}
	for(int i = 0;i<N;i++){
		if(v[i]) continue;
		v[i] = 1;
		int pv = i;
		for(auto x : g[i]){
			v[x] = 1;
			ans[pv][x] = 1;
			ans[x][pv] = 1;
			pv = x;
		}
	}
	c = ans;
	for(int i = 0;i<N;i++) if(!vis[i]) chk.push_back({}), dfs(i), idx++;
	for(auto x : chk){
		for(int i = 0;i<x.size();i++){
			for(int j = i + 1;j<x.size();j++){
				if(p[i][j] == 0) return 0;
			}
		}
	}
	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