oj.uz

답안 #928042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928042 2024-02-15T18:42:18 Z EJIC_B_KEDAX 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 177 ms 22300 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), 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]) {
                    for (int jj : group[j]) {
                        if (p[ii][jj] != 2) {
                            return 0;
                        }
                    }
                }
            } else if (i < j) {
                for (int ii : group[i]) {
                    for (int jj : group[j]) {
                        if (p[ii][jj] != 0) {
                            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[group2[i][(j - 1 + group2[i].size()) % group2[i].size()]][group2[i][j]] = 1;
            b[group2[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;
}

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

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 151 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 170 ms 22240 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 67 ms 12312 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 548 KB Output is correct
20 Correct 38 ms 5720 KB Output is correct
21 Correct 151 ms 22028 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 153 ms 22096 KB Output is correct
24 Correct 160 ms 22300 KB Output is correct
25 Correct 59 ms 12316 KB Output is correct
26 Correct 59 ms 12300 KB Output is correct
27 Correct 173 ms 22096 KB Output is correct
28 Correct 158 ms 22284 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 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 5716 KB Output is correct
5 Correct 151 ms 22096 KB Output is correct
6 Correct 152 ms 22100 KB Output is correct
7 Correct 155 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 47 ms 5716 KB Output is correct
10 Correct 155 ms 22096 KB Output is correct
11 Correct 154 ms 22088 KB Output is correct
12 Correct 161 ms 22096 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 39 ms 5784 KB Output is correct
17 Correct 156 ms 22048 KB Output is correct
18 Correct 177 ms 22284 KB Output is correct
19 Correct 152 ms 22096 KB Output is correct
20 Correct 153 ms 22296 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 151 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 170 ms 22240 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 67 ms 12312 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 548 KB Output is correct
20 Correct 38 ms 5720 KB Output is correct
21 Correct 151 ms 22028 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 153 ms 22096 KB Output is correct
24 Correct 160 ms 22300 KB Output is correct
25 Correct 59 ms 12316 KB Output is correct
26 Correct 59 ms 12300 KB Output is correct
27 Correct 173 ms 22096 KB Output is correct
28 Correct 158 ms 22284 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 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 1 ms 348 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 151 ms 22164 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 170 ms 22240 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 67 ms 12312 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 548 KB Output is correct
20 Correct 38 ms 5720 KB Output is correct
21 Correct 151 ms 22028 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 153 ms 22096 KB Output is correct
24 Correct 160 ms 22300 KB Output is correct
25 Correct 59 ms 12316 KB Output is correct
26 Correct 59 ms 12300 KB Output is correct
27 Correct 173 ms 22096 KB Output is correct
28 Correct 158 ms 22284 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 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 -