oj.uz

Submission #953649

# Submission time Handle Problem Language Result Execution time Memory
953649 2024-03-26T11:46:43 Z Desh03 Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 171 ms 23840 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int construct(vector<vector<int>> p) {
    int n = p.size();
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 3) {
                return 0;
            }
        }
    }
    vector<bool> vis(n);
    vector<vector<int>> b(n, vector<int> (n));
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        queue<int> q;
        q.push(i);
        vector<int> nodes;
        while (q.size()) {
            int u = q.front();
            q.pop();
            if (vis[u]) continue;
            vis[u] = 1;
            nodes.push_back(u);
            for (int j = 0; j < n; j++) {
                if (!vis[j] && p[u][j]) {
                    q.push(j);
                }
            }
        }
        bool two = 0;
        for (int i = 0; i < nodes.size(); i++) {
            for (int j = i + 1; j < nodes.size(); j++) {
                if (!p[nodes[i]][nodes[j]]) {
                    return 0;
                }
                if (p[nodes[i]][nodes[j]] == 2) {
                    two = 1;
                }
            }
        }
        vector<vector<int>> trees;
        vector<bool> vis2(n);
        for (int u : nodes) {
            if (vis2[u]) continue;
            trees.push_back({});
            queue<int> q2;
            q2.push(u);
            while (q2.size()) {
                int v = q2.front();
                q2.pop();
                if (vis2[v]) continue;
                vis2[v] = 1;
                trees.back().push_back(v);
                for (int j = 0; j < n; j++) {
                    if (!vis2[j] && p[v][j] == 1) {
                        q2.push(j);
                    }
                }
            }
        }
        int sz = trees.size();
        if (two && sz < 3) return 0;
        for (int j = 0; j < sz; j++) {
            for (int k = 0; k < trees[j].size(); k++) {
                for (int l = k + 1; l < trees[j].size(); l++) {
                    if (p[trees[j][k]][trees[j][l]] != 1) {
                        return 0;
                    }
                }
            }
        }
        for (int j = 0; j < sz; j++) {
            int u = trees[j].back(), v = trees[(j + 1) % sz].back();
            if (u != v) {
                b[u][v] = b[v][u] = 1;
            }
            for (int k = 0; k < trees[j].size() - 1; k++) {
                u = trees[j][k], v = trees[j][k + 1];
                b[u][v] = b[v][u] = 1;
            }
        }
    }
    build(b);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:35:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for (int i = 0; i < nodes.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
supertrees.cpp:36:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |             for (int j = i + 1; j < nodes.size(); j++) {
      |                                 ~~^~~~~~~~~~~~~~
supertrees.cpp:68:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for (int k = 0; k < trees[j].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:69:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |                 for (int l = k + 1; l < trees[j].size(); l++) {
      |                                     ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:81:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for (int k = 0; k < trees[j].size() - 1; k++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 7 ms 1268 KB Output is correct
7 Correct 164 ms 22448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 7 ms 1268 KB Output is correct
7 Correct 164 ms 22448 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 1116 KB Output is correct
13 Correct 171 ms 22012 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 75 ms 13064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5864 KB Output is correct
21 Correct 155 ms 23260 KB Output is correct
22 Correct 159 ms 23260 KB Output is correct
23 Correct 157 ms 23436 KB Output is correct
24 Correct 161 ms 23376 KB Output is correct
25 Correct 68 ms 13392 KB Output is correct
26 Correct 68 ms 13388 KB Output is correct
27 Correct 166 ms 23840 KB Output is correct
28 Correct 158 ms 23212 KB Output is correct

Subtask #3
19.0 / 19.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 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Correct 153 ms 21996 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 157 ms 22144 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 75 ms 13064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 41 ms 5852 KB Output is correct
22 Correct 158 ms 23372 KB Output is correct
23 Correct 159 ms 23400 KB Output is correct
24 Correct 161 ms 23436 KB Output is correct
25 Correct 81 ms 13524 KB Output is correct
26 Correct 69 ms 13524 KB Output is correct
27 Correct 158 ms 23320 KB Output is correct
28 Correct 157 ms 23324 KB Output is correct
29 Correct 67 ms 13536 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 39 ms 5780 KB Output is correct
5 Correct 157 ms 22040 KB Output is correct
6 Correct 153 ms 22100 KB Output is correct
7 Correct 162 ms 22004 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5784 KB Output is correct
10 Correct 156 ms 22136 KB Output is correct
11 Correct 151 ms 21992 KB Output is correct
12 Correct 170 ms 21952 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 40 ms 5784 KB Output is correct
17 Correct 157 ms 22020 KB Output is correct
18 Correct 155 ms 22020 KB Output is correct
19 Correct 165 ms 22276 KB Output is correct
20 Correct 156 ms 22096 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 7 ms 1268 KB Output is correct
7 Correct 164 ms 22448 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 1116 KB Output is correct
13 Correct 171 ms 22012 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 75 ms 13064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5864 KB Output is correct
21 Correct 155 ms 23260 KB Output is correct
22 Correct 159 ms 23260 KB Output is correct
23 Correct 157 ms 23436 KB Output is correct
24 Correct 161 ms 23376 KB Output is correct
25 Correct 68 ms 13392 KB Output is correct
26 Correct 68 ms 13388 KB Output is correct
27 Correct 166 ms 23840 KB Output is correct
28 Correct 158 ms 23212 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 153 ms 21996 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 8 ms 1116 KB Output is correct
41 Correct 157 ms 22144 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 75 ms 13064 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 5852 KB Output is correct
50 Correct 158 ms 23372 KB Output is correct
51 Correct 159 ms 23400 KB Output is correct
52 Correct 161 ms 23436 KB Output is correct
53 Correct 81 ms 13524 KB Output is correct
54 Correct 69 ms 13524 KB Output is correct
55 Correct 158 ms 23320 KB Output is correct
56 Correct 157 ms 23324 KB Output is correct
57 Correct 67 ms 13536 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 940 KB Output is correct
61 Correct 73 ms 14688 KB Output is correct
62 Correct 0 ms 600 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 39 ms 6268 KB Output is correct
66 Correct 66 ms 13452 KB Output is correct
67 Correct 71 ms 13416 KB Output is correct
68 Correct 66 ms 13392 KB Output is correct
69 Correct 66 ms 13392 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 7 ms 1268 KB Output is correct
7 Correct 164 ms 22448 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 1116 KB Output is correct
13 Correct 171 ms 22012 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 75 ms 13064 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 5864 KB Output is correct
21 Correct 155 ms 23260 KB Output is correct
22 Correct 159 ms 23260 KB Output is correct
23 Correct 157 ms 23436 KB Output is correct
24 Correct 161 ms 23376 KB Output is correct
25 Correct 68 ms 13392 KB Output is correct
26 Correct 68 ms 13388 KB Output is correct
27 Correct 166 ms 23840 KB Output is correct
28 Correct 158 ms 23212 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 153 ms 21996 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 8 ms 1116 KB Output is correct
41 Correct 157 ms 22144 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 75 ms 13064 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 5852 KB Output is correct
50 Correct 158 ms 23372 KB Output is correct
51 Correct 159 ms 23400 KB Output is correct
52 Correct 161 ms 23436 KB Output is correct
53 Correct 81 ms 13524 KB Output is correct
54 Correct 69 ms 13524 KB Output is correct
55 Correct 158 ms 23320 KB Output is correct
56 Correct 157 ms 23324 KB Output is correct
57 Correct 67 ms 13536 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 39 ms 5780 KB Output is correct
62 Correct 157 ms 22040 KB Output is correct
63 Correct 153 ms 22100 KB Output is correct
64 Correct 162 ms 22004 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 38 ms 5784 KB Output is correct
67 Correct 156 ms 22136 KB Output is correct
68 Correct 151 ms 21992 KB Output is correct
69 Correct 170 ms 21952 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 40 ms 5784 KB Output is correct
74 Correct 157 ms 22020 KB Output is correct
75 Correct 155 ms 22020 KB Output is correct
76 Correct 165 ms 22276 KB Output is correct
77 Correct 156 ms 22096 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 940 KB Output is correct
81 Correct 73 ms 14688 KB Output is correct
82 Correct 0 ms 600 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 39 ms 6268 KB Output is correct
86 Correct 66 ms 13452 KB Output is correct
87 Correct 71 ms 13416 KB Output is correct
88 Correct 66 ms 13392 KB Output is correct
89 Correct 66 ms 13392 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 604 KB Output is correct
93 Correct 66 ms 9556 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 440 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 16 ms 2824 KB Output is correct
98 Correct 64 ms 9452 KB Output is correct
99 Correct 64 ms 9564 KB Output is correct
100 Correct 64 ms 9524 KB Output is correct
101 Correct 63 ms 9428 KB Output is correct
102 Correct 65 ms 9552 KB Output is correct
103 Correct 59 ms 9552 KB Output is correct
104 Correct 69 ms 9656 KB Output is correct
105 Correct 72 ms 9552 KB Output is correct