Submission #301306

#	Time	Username	Problem	Language	Result	Execution time	Memory
301306		Pro100Yan	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1088 ms	15520 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <iostream>
#define ll long long
#define pb push_back

using namespace std;
const int N = 2005;
vector<int> gr[N];
int used[N], d[N], sz[N];
vector<vector<int>> ans;

int get_parent(int v){
    while(v != d[v])
        v = d[v];
    return v;
}

void add(int u, int v){
    //cout << "Add " << u << ' ' << v << endl;
    int f = get_parent(u), s = get_parent(v);
    //cout << "Parents " << f << ' ' << s << endl;
    if(f != s){
        ans[f][s] = ans[s][f] = 1;
        if(sz[s] < sz[f]){
            d[s] = f;
            sz[s] += sz[f];
            sz[f] = 0;
        }
        else{
            d[f] = s;
            sz[f] += sz[s];
            sz[s] = 0;
        }
    }
}



int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	int fault = 0;
	for(int i = 0; i < n; i++){
        d[i] = i;
        sz[i] = 1;
	}
	for(int i = 0; i < n; i++){
        ans.pb({});
        for(int j = 0; j < n; j++)
            ans[i].pb(0);
    }
    for(int i = 0; i < n; i++){
        for(int j = i; j < n; j++){
            if(p[i][j] != p[j][i])
                fault++;
            else if(i == j && p[i][j] != 1)
                fault++;
            if(p[i][j] && i != j){
                add(i, j);
                gr[i].pb(j);
                gr[j].pb(i);
            }
        }
    }
    /*for(int i = 0; i < n; i++){
        if(!used[i])
            dfs(i);
    }*/
	build(ans);
	return 1;
}
/*
5
1 0 0 1 1
0 1 1 0 0
0 1 1 0 0
1 0 0 1 1
1 0 0 1 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