제출 #304865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304865		daveeed	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	261 ms	22136 KiB

supertrees

#include "supertrees.h"
#include <vector>

const int MAXN = 1000;

int parent[MAXN], sz[MAXN];

int find(int p){
    while (p != parent[p])
        p = parent[p];
    return p;
}

void merge(int p, int q) {
    int rootP = find(p);
    int rootQ = find(q);
    if (rootP == rootQ) return;
    if (sz[rootP] < sz[rootQ]) {
        parent[rootP] = rootQ;
        sz[rootQ] += sz[rootP];
    }
    else {
        parent[rootQ] = rootP;
        sz[rootP] += sz[rootQ];
    }
}

int construct(std::vector<std::vector<int> > p) {
	int n = p.size();
	std::vector<std::vector<int> > answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}

    for(int i = 0; i < n; i++){
        parent[i] = i;
    }

    bool isOne = false;
    bool isTwo = false;

    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(p[i][j])
                merge(i, j);
            if(p[i][j] == 1)
                isOne = true;
            if(p[i][j] == 2)
                isTwo = true;
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(find(i) == find(j) && !p[i][j])
                return 0;
        }
    }
    if(isOne){
        for(int i = 0; i < n; i++){
            int r = find(i);
            if(r != i){
                answer[r][i] = 1;
                answer[i][r] = 1;
            }
        }
    }
    if(isTwo){
        for(int i = 0; i < n; i++){
            int r = find(i);
            if(r == i){
                int prev = -1;
                int count = 0;
                int start = -1;
                for(int j = 0; j < n; j++){
                    if(find(j) == r){
                        if(prev == -1){
                            prev = j;
                            start = j;
                            count++;
                        }
                        else{
                            answer[prev][j] = 1;
                            answer[j][prev] = 1;
                            prev = j;
                        }
                    }
                }
                if(count == 1){
                    continue;
                }
                if(count == 2){
                    return 0;
                }
                answer[prev][start] = 1;
                answer[start][prev] = 1; 
            }
        }
    }

	build(answer);
	return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4