제출 #808071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
808071		drdilyor	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	212 KiB

supertrees

#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;
const int inf = 1e9;

#define debug(args...) cout << "[" << #args << "]: "; debug_out(args);
void debug_out() {
    cout << endl;
}
template<typename H, typename... T>
void debug_out(vector<H> h, T... t) {
    cout << "{";
    for (H i : h) cout << i << ", ";
    cout << "}, ";
    debug_out(t...);
}
template<typename H, typename... T>
void debug_out(H h, T... t) {
    cout << h << ", ";
    debug_out(t...);
}

struct DSU {
    int n;
    vector<int> par;
    DSU(int n) : n(n), par(n) {
        for (int i = 0; i < n; i++)
            par[i] = i;
    }
    void merge(int a, int b) {
        par[get(b)] = get(a);
    }
    int get(int i) {
        return par[i] == i ? i : par[i] = get(par[i]);
    }
};

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector ans(n, vector<int>(n));

    DSU cc1(n), cc(n);
    for (int i = 0;i  < n;i++)
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 1)
                cc1.merge(i, j);
            if (p[i][j])
                cc.merge(i, j);
        }

    for (int i = 0; i < n; i++) {
        int j = cc1.get(i);
        if (j == i) continue;
        ans[i][j] = ans[j][i] = 1;
    }

    for (int i = 0; i < n; i++) {
        if (cc.get(i) != i) continue;
        vector<int> full{i};
        for (int j = 0; j < n; j++) {
            if (j == i) continue;
            if (cc.get(j) == cc.get(i))
                full.push_back(cc1.get(j));
        }
        debug(full);
        sort(full.begin(), full.end());
        full.erase(unique(full.begin(), full.end()), full.end());
        if (full.size() <= 1) continue;
        int m = full.size();
        for (int j = 0; j < m; j++) {
            ans[full[j]][full[(j + 1) % m]] = 1;
            ans[full[(j + 1) % m]][full[j]] = 1;
        }
    }

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