Submission #798126

#	Time	Username	Problem	Language	Result	Execution time	Memory
798126		nnin	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	165 ms	23996 KiB

supertrees

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

int dsu[1001];
int par(int x) {
    if(dsu[x]==x) return x;
    return dsu[x] = par(dsu[x]);
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n, 0));

	for(int i=0;i<n;i++) dsu[i] = i;

	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) {
        if(p[i][j]) {
            int pari = par(i);
            int parj = par(j);
            if(pari!=parj) {
                dsu[pari] = parj;
                answer[pari][parj] = answer[parj][pari] = 1;
            }
        }
	}

	for(int i=0;i<n;i++) for(int j=0;j<n;j++) {
        if(!p[i][j]) {
            int pari = par(i);
            int parj = par(j);
            if(pari==parj) {
                return 0;
            }
        }
	}

	build(answer);
	return 1;
}

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