Submission #1119079

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119079		adaawf	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	2 ms	592 KiB

supertrees

#include <iostream>
#include <vector>
#include "supertrees.h"
using namespace std;
vector<int> v[1005];
int p[1005];
vector<vector<int>> res;
int Find(int x) {
    if (x == p[x]) return x;
    return p[x] = Find(p[x]);
}
void Merge(int x, int y) {
    x = Find(x);
    y = Find(y);
    if (x == y) return;
    if (v[x].size() < v[y].size()) {
        swap(x, y);
    }
    for (int w : v[y]) v[x].push_back(w);
    v[y].clear();
    res[x][y] = res[y][x] = 1;
}
void build(vector<vector<int>> b);
int construct(vector<vector<int>> a) {
    int n = a.size();
    res = vector<vector<int>>(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        p[i] = i;
        v[i].clear();
        v[i].push_back(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (a[i][j] == 1) {
                Merge(i, j);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (Find(i) == i) {
            for (int w : v[i]) {
                for (int ww : v[i]) {
                    if (a[w][ww] != 1) return 0;
                }
            }
        }
    }
    build(res);
    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