Submission #411963

#	Time	Username	Problem	Language	Result	Execution time	Memory
411963		dolijan	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	271 ms	22932 KiB

supertrees

#include "supertrees.h"
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int> > p) {
	int n = p.size();
	std::vector<std::vector<int> > answer;
	answer.resize(n);
	for(int i=0;i<n;i++) answer[i].resize(n);
	int daddy[n];
	for(int i=0;i<n;i++) daddy[i]=i;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            answer[i][j]=0;
        }
    }
	for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(p[i][j]==1 && daddy[i]!=daddy[j]){
                daddy[j]=daddy[i];
                answer[j][daddy[i]]=1;
                answer[daddy[i]][j]=1;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(p[i][j]==0)
            {
                if(daddy[i]==daddy[j]) return 0;
            }
        }
    }
	build(answer);
	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