Submission #684634

#	Time	Username	Problem	Language	Result	Execution time	Memory
684634		Kongggwp	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	212 KiB

supertrees

#include "supertrees.h"
#include<vector>
#include<bits/stdc++.h>
int par[1000];
using namespace std;
int findUpar(int node)
{
    if(node==par[node])return node;
    return findUpar(par[node]);
}
void Union(int u , int v)
{
    int pu = findUpar(u) , pv = findUpar(v);
    par[pu]=pv;
}
int construct(vector<vector<int>> p) {
	int n = p.size();
	for(int i=0 ; i<n ; i++)par[i]=i;
	vector<vector<int>>ans(n,vector<int>(n));
	for(int i=0 ; i<n ; i++)
    {
        for(int j=0 ; j<n ; j++)
        {
            if(p[i][j]==3)return 0;
            if(p[i][j]==1)ans[i][j]=1,Union(i,j);
            if(p[i][j]==2)
            {
                Union(i,j);
                ans[findUpar(i)][findUpar(j)] = 1;
            }
        }
    }

	build(ans);
	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