제출 #394501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394501		koste4ka	슈퍼트리 잇기 (IOI20_supertrees)	C++17	56 / 100	253 ms	22184 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

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);
    }
    vector < bool > u(n);
    vector < int > now;
    vector < vector < int > > all;
    int cur;
    for (int i = 0; i < n; ++i) {
        if (u[i]) {
            continue;
        }
        now.clear();
        for (int j = i; j < n; ++j) {
            if (u[j] || p[i][j] != 1) {
                continue;
            }
            now.push_back(j);
            u[j] = 1;
        }
        for (auto v : now) {
            for (auto u : now) {
                if (p[v][u] != 1) {
                    return 0;
                }
            }
        }
        for (int j = 1; j < (int)(now.size()); ++j) {
            answer[now[j - 1]][now[j]] = 1;
            answer[now[j]][now[j - 1]] = 1;
        }
        all.push_back(now);
    }
    for (int i = 0; i < (int)(all.size()); ++i) {
        for (int j = i + 1; j < (int)(all.size()); ++j) {
            for (auto v : all[i]) {
                for (auto u : all[j]) {
                    if (p[v][u] != p[all[i][0]][all[j][0]]) {
                        return 0;
                    }
                }
            }
        }
    }
    int last;
    for (int i = 0; i < n; ++i) {
        u[i] = 0;
    }
    for (int i = 0; i < (int)(all.size()); ++i) {
        if (u[i]) {
            continue;
        }
        cur = 1;
        last = all[i].back();
        now.clear();
        now.push_back(last);
        for (int j = i + 1; j < (int)(all.size()); ++j) {
            if (!u[j] && p[last][all[j].back()] == 2) {
                answer[last][all[j].back()] = 1;
                answer[all[j].back()][last] = 1;
                last = all[j].back();
                u[j] = 1;
                ++cur;
                now.push_back(last);
            }
        }
        if (cur == 2) {
            return 0;
        }
        for (auto u : now) {
            for (auto v : now) {
                if (u != v && p[u][v] != 2) {
                    return 0;
                }
            }
        }
        if (last != all[i].back()) {
            answer[last][all[i].back()] = 1;
            answer[all[i].back()][last] = 1;
        }
    }
    build(answer);
    return 1;
}

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