제출 #928034

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

supertrees

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

using ll = long long;

using namespace std;

const int N = 1010;
int dsu[N];

int get(int x) {
    return dsu[x] == x ? x : dsu[x] = get(dsu[x]);
}

void merge(int x, int y) {
    dsu[get(x)] = get(y);
}

int construct(vector<vector<int>> p) {
    int n = (int)p.size();
    for (int i = 0; i < n; i++) {
        dsu[i] = i;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 1) {
                merge(i, j);
            }
        }
    }
    vector<vector<int>> b(n, vector<int>(n, 0)), group(n), group2(n);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] != 1 && get(i) == get(j)) {
                return 0;
            }
        }
        group[get(i)].push_back(i);
    }
    vector<int> g;
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < group[i].size(); j++) {
            b[group[i][j - 1]][group[i][j]] = 1;
            b[group[i][j]][group[i][j - 1]] = 1;
        }
        if (!group[i].empty()) {
            g.push_back(i);
        }
    }
    for (int i : g) {
        for (int j : g) {
            if (p[i][j] == 2 && i < j) {
                merge(i, j);
            }
        }
    }
    for (int i : g) {
        for (int j : g) {
            if (i != j && get(i) == get(j)) {
                for (int ii : group[i]) {
                    if (p[ii][j] != 2) {
                        return 0;
                    }
                }
            }
        }
        group2[get(i)].push_back(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < group2[i].size() && group2[i].size() > 1; j++) {
            b[group[i][(j - 1 + group2[i].size()) % group2[i].size()]][group2[i][j]] = 1;
            b[group[i][j]][group2[i][(j - 1 + group2[i].size()) % group2[i].size()]] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 3) {
                return 0;
            }
        }
    }
    build(b);
    return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:42:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int j = 1; j < group[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:70:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for (int j = 0; j < group2[i].size() && group2[i].size() > 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

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