oj.uz

Submission #928043

# Submission time Handle Problem Language Result Execution time Memory
928043 2024-02-15T18:50:10 Z EJIC_B_KEDAX Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 157 ms 22356 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++) {
        if (group2[i].size() == 2){
            return 0;
        }
        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:83:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for (int j = 0; j < group2[i].size() && group2[i].size() > 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1292 KB Output is correct
7 Correct 145 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1292 KB Output is correct
7 Correct 145 ms 22100 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 6 ms 1116 KB Output is correct
13 Correct 147 ms 22052 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 64 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 36 ms 5780 KB Output is correct
21 Correct 144 ms 22100 KB Output is correct
22 Correct 145 ms 22024 KB Output is correct
23 Correct 151 ms 22176 KB Output is correct
24 Correct 147 ms 22092 KB Output is correct
25 Correct 57 ms 12112 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 150 ms 22096 KB Output is correct
28 Correct 149 ms 22144 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 151 ms 22120 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 1312 KB Output is correct
13 Correct 150 ms 22100 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 856 KB Output is correct
17 Correct 70 ms 12300 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 37 ms 5724 KB Output is correct
22 Correct 156 ms 22356 KB Output is correct
23 Correct 149 ms 22100 KB Output is correct
24 Correct 155 ms 22096 KB Output is correct
25 Correct 62 ms 12372 KB Output is correct
26 Correct 58 ms 12296 KB Output is correct
27 Correct 150 ms 22048 KB Output is correct
28 Correct 153 ms 22088 KB Output is correct
29 Correct 63 ms 12368 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory 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 37 ms 5724 KB Output is correct
5 Correct 147 ms 22232 KB Output is correct
6 Correct 153 ms 22100 KB Output is correct
7 Correct 152 ms 22032 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 38 ms 5720 KB Output is correct
10 Correct 152 ms 22040 KB Output is correct
11 Correct 147 ms 22256 KB Output is correct
12 Correct 157 ms 22284 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 40 ms 5888 KB Output is correct
17 Correct 150 ms 22044 KB Output is correct
18 Correct 145 ms 22096 KB Output is correct
19 Correct 148 ms 22100 KB Output is correct
20 Correct 149 ms 22284 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1292 KB Output is correct
7 Correct 145 ms 22100 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 6 ms 1116 KB Output is correct
13 Correct 147 ms 22052 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 64 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 36 ms 5780 KB Output is correct
21 Correct 144 ms 22100 KB Output is correct
22 Correct 145 ms 22024 KB Output is correct
23 Correct 151 ms 22176 KB Output is correct
24 Correct 147 ms 22092 KB Output is correct
25 Correct 57 ms 12112 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 150 ms 22096 KB Output is correct
28 Correct 149 ms 22144 KB Output is correct
29 Correct 0 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 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1116 KB Output is correct
37 Correct 151 ms 22120 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1312 KB Output is correct
41 Correct 150 ms 22100 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 70 ms 12300 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 37 ms 5724 KB Output is correct
50 Correct 156 ms 22356 KB Output is correct
51 Correct 149 ms 22100 KB Output is correct
52 Correct 155 ms 22096 KB Output is correct
53 Correct 62 ms 12372 KB Output is correct
54 Correct 58 ms 12296 KB Output is correct
55 Correct 150 ms 22048 KB Output is correct
56 Correct 153 ms 22088 KB Output is correct
57 Correct 63 ms 12368 KB Output is correct
58 Correct 0 ms 600 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 61 ms 12304 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 42 ms 5716 KB Output is correct
66 Correct 68 ms 12372 KB Output is correct
67 Correct 57 ms 12112 KB Output is correct
68 Correct 58 ms 12320 KB Output is correct
69 Correct 61 ms 12368 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1292 KB Output is correct
7 Correct 145 ms 22100 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 6 ms 1116 KB Output is correct
13 Correct 147 ms 22052 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 64 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 36 ms 5780 KB Output is correct
21 Correct 144 ms 22100 KB Output is correct
22 Correct 145 ms 22024 KB Output is correct
23 Correct 151 ms 22176 KB Output is correct
24 Correct 147 ms 22092 KB Output is correct
25 Correct 57 ms 12112 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 150 ms 22096 KB Output is correct
28 Correct 149 ms 22144 KB Output is correct
29 Correct 0 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 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1116 KB Output is correct
37 Correct 151 ms 22120 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1312 KB Output is correct
41 Correct 150 ms 22100 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 70 ms 12300 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 37 ms 5724 KB Output is correct
50 Correct 156 ms 22356 KB Output is correct
51 Correct 149 ms 22100 KB Output is correct
52 Correct 155 ms 22096 KB Output is correct
53 Correct 62 ms 12372 KB Output is correct
54 Correct 58 ms 12296 KB Output is correct
55 Correct 150 ms 22048 KB Output is correct
56 Correct 153 ms 22088 KB Output is correct
57 Correct 63 ms 12368 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 37 ms 5724 KB Output is correct
62 Correct 147 ms 22232 KB Output is correct
63 Correct 153 ms 22100 KB Output is correct
64 Correct 152 ms 22032 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 38 ms 5720 KB Output is correct
67 Correct 152 ms 22040 KB Output is correct
68 Correct 147 ms 22256 KB Output is correct
69 Correct 157 ms 22284 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 40 ms 5888 KB Output is correct
74 Correct 150 ms 22044 KB Output is correct
75 Correct 145 ms 22096 KB Output is correct
76 Correct 148 ms 22100 KB Output is correct
77 Correct 149 ms 22284 KB Output is correct
78 Correct 0 ms 600 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 61 ms 12304 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 42 ms 5716 KB Output is correct
86 Correct 68 ms 12372 KB Output is correct
87 Correct 57 ms 12112 KB Output is correct
88 Correct 58 ms 12320 KB Output is correct
89 Correct 61 ms 12368 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 62 ms 12372 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 15 ms 3224 KB Output is correct
98 Correct 59 ms 12300 KB Output is correct
99 Correct 60 ms 12112 KB Output is correct
100 Correct 60 ms 12112 KB Output is correct
101 Correct 69 ms 12316 KB Output is correct
102 Correct 57 ms 12112 KB Output is correct
103 Correct 65 ms 12312 KB Output is correct
104 Correct 59 ms 12120 KB Output is correct
105 Correct 62 ms 12112 KB Output is correct