Submission #416416

#	Time	Username	Problem	Language	Result	Execution time	Memory
416416		ioi	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	296 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std ;
const int N = 1002;
int dsu[N] , sz[N];

int get(int u){
    if(u == dsu[u])
        return u ;

    return dsu[u] = get(dsu[u]);



}

void connect(int u , int v){


    u = get(u) , v = get(v);
    if(u == v)return ;

    if(sz[u] > sz[v])swap(u , v);

    sz[v] += sz[u];

    dsu[u] = v ;



}

bool same(int u , int v){
    u = get(u) , v = get(v);

    return u == v ;

}
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer (n , vector<int> (n , 0));
    for(int i = 0 ; i < n ; i ++)sz[i] = 1 , dsu[i] = i ;

    for(int i = 0 ; i < n ; i ++){
        for(int j = 0 ; j < n ; j ++){
            if(p[i][j])connect(i , j);

        }
    }

    for(int i = 0 ; i < n ; i ++){
        for(int j = 0 ; j < n ;j ++)
        {
            if(p[i][j] == 0&& same(i , j))return 0 ;
            if(p[i][j] && i != j)answer[i][j] = 1 , answer[j][i] = 1 ;
        }
    }



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