제출 #1295502

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1295502		kawhiet	슈퍼트리 잇기 (IOI20_supertrees)	C++20	40 / 100	101 ms	26428 KiB

supertrees

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

vector<int> cur;

void dfs(int u, vector<vector<int>> &g, vector<bool> &vis) {
    cur.push_back(u);
    vis[u] = 1;
    for (auto v : g[u]) {
        if (!vis[v]) {
            dfs(v, g, vis);
        }
    }
}

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> twos(n), ones(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 2) {
                twos[i].push_back(j);
            } else if (p[i][j] == 1) {
                ones[i].push_back(j);
            }
        }
    }
    vector<bool> vis1(n), vis2(n);
    vector<vector<int>> a, b;
    for (int i = 0; i < n; i++) {
        if (!vis1[i]) {
            cur.clear();
            dfs(i, ones, vis1);
            a.push_back(cur);
        }
        if (!vis2[i]) {
            cur.clear();
            dfs(i, twos, vis2);
            b.push_back(cur);
        }
    }
    for (auto k : a) {
        for (auto x : k) {
            for (auto y : k) {
                if (p[x][y] == 0) {
                    return 0;
                }
            }
        }
    }
    for (auto k : b) {
        for (auto x : k) {
            for (auto y : k) {
                if (p[x][y] == 0) {
                    return 0;
                }
            }
        }
    }
    vector<vector<int>> ans(n, vector<int>(n));
    for (auto k : a) {
        for (int i = 1; i < k.size(); i++) {
            ans[k[i]][k[i - 1]] = 1;
            ans[k[i - 1]][k[i]] = 1;
        }
    }
    for (auto k : b) {
        if (k.size() == 1) {
            continue;
        }
        if (k.size() == 2) {
            return 0;
        }
        for (int i = 1; i < k.size(); i++) {
            ans[k[i]][k[i - 1]] = 1;
            ans[k[i - 1]][k[i]] = 1;
        }
        ans[k.back()][k[0]] = 1;
        ans[k[0]][k.back()] = 1;
    }
    build(ans);
    return 1;
}

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