Submission #430355

#	Time	Username	Problem	Language	Result	Execution time	Memory
430355		MrFrancho	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	204 KiB

supertrees

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

int construct(vector<vector<int>> p) {
    int N = p.size();
    vector<int> group(N,-1);
	bool vis[N]{};
    vector<vector<int>> answer(N);

    for(int i = 0; i < N; i++) {
    	answer[i].assign(N,0);
    }

    int prev;
    for (int i = 0; i < N; i++) {
        if(!vis[i]) {
        	prev = i;
        	vis[i] = true;
        	group[i] = i;
        	for(int j = 0; j < N; j++) {
        		if(i != j && p[i][j] == 2) {
        			if(vis[j]) return 0;
        			vis[j] = true;
        			answer[prev][j] = answer[j][prev] = 1;
        			group[j] = i;
        			prev = j;
        		}
        	}
        	if(prev != i)
        		answer[prev][i] = answer[i][prev] = 1;
        }
    }

    /*for(int i = 0; i < connectedGroups.size(); i++) {
        cout << i << ":\n";
        for(auto x: connectedGroups[i])
            cout << x << endl;
    }*/

    for (int i = 0; i < N; i++) {
    	for (int j = 0; j < N; j++) {
    		if((i != j) && ((group[i] == group[j]) != (p[i][j] == 2))) {
    			return 0;
    		}
   		}
    }

    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