oj.uz

답안 #928031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928031 2024-02-15T18:26:34 Z EJIC_B_KEDAX 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 159 ms 22348 KB 
#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);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 0 && 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);
        }
        group[i].clear();
    }
    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 (p[i][j] < 2 && get(i) == get(j) && i < j) {
                return 0;
            }
        }
        group[get(i)].push_back(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < group[i].size() && group[i].size() > 1; j++) {
            b[group[i][(j - 1 + group[i].size()) % group[i].size()]][group[i][j]] = 1;
            b[group[i][j]][group[i][(j - 1 + group[i].size()) % group[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;
}

Compilation message

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:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (int j = 0; j < group[i].size() && group[i].size() > 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22048 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22048 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22044 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 69 ms 12048 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5724 KB Output is correct
21 Correct 154 ms 22224 KB Output is correct
22 Correct 151 ms 22028 KB Output is correct
23 Correct 154 ms 22100 KB Output is correct
24 Correct 150 ms 22100 KB Output is correct
25 Correct 63 ms 12112 KB Output is correct
26 Correct 61 ms 12116 KB Output is correct
27 Correct 159 ms 22264 KB Output is correct
28 Correct 147 ms 22096 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 38 ms 5868 KB Output is correct
5 Correct 151 ms 22176 KB Output is correct
6 Correct 156 ms 22096 KB Output is correct
7 Correct 154 ms 22096 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5816 KB Output is correct
10 Correct 158 ms 22248 KB Output is correct
11 Correct 153 ms 22096 KB Output is correct
12 Correct 157 ms 22096 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 39 ms 5712 KB Output is correct
17 Correct 156 ms 22348 KB Output is correct
18 Correct 151 ms 22048 KB Output is correct
19 Correct 158 ms 22100 KB Output is correct
20 Correct 154 ms 22100 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22048 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22044 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 69 ms 12048 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5724 KB Output is correct
21 Correct 154 ms 22224 KB Output is correct
22 Correct 151 ms 22028 KB Output is correct
23 Correct 154 ms 22100 KB Output is correct
24 Correct 150 ms 22100 KB Output is correct
25 Correct 63 ms 12112 KB Output is correct
26 Correct 61 ms 12116 KB Output is correct
27 Correct 159 ms 22264 KB Output is correct
28 Correct 147 ms 22096 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 151 ms 22048 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22044 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 69 ms 12048 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5724 KB Output is correct
21 Correct 154 ms 22224 KB Output is correct
22 Correct 151 ms 22028 KB Output is correct
23 Correct 154 ms 22100 KB Output is correct
24 Correct 150 ms 22100 KB Output is correct
25 Correct 63 ms 12112 KB Output is correct
26 Correct 61 ms 12116 KB Output is correct
27 Correct 159 ms 22264 KB Output is correct
28 Correct 147 ms 22096 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -