oj.uz

Submission #953523

# Submission time Handle Problem Language Result Execution time Memory
953523 2024-03-26T05:23:48 Z Desh03 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 182 ms 23632 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int construct(vector<vector<int>> p) {
    int n = p.size();
    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;
        bool two = 0, three = 0;
        vector<bool> vis_(n);
        while (q.size()) {
            int u = q.front();
            q.pop();
            if (vis[u]) continue;
            vis[u] = vis_[u] = 1;
            nodes.push_back(u);
            for (int j = 0; j < n; j++) {
                if (!vis[j] && p[u][j]) {    
                    q.push(j);
                }
            }
        }
        for (int u : nodes) {
            for (int j = 0; j < n; j++) {
                if (!vis_[j] && p[u][j]) {
                    return 0;
                } else if (vis_[j]) {
                    if (p[u][j] == 3) {
                        three = 1;
                    }
                    if (p[u][j] == 2) {
                        two = 1;
                    }
                }
            }
        } 
        for (int j = 0; j < nodes.size(); j++) {
            for (int k = j + 1; k < nodes.size(); k++) {
                if (!p[nodes[j]][nodes[k]]) {
                    return 0;
                }
            }
        }
        if (two && three) return 0;
        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;
        if (three && sz < 4) 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;
            }
        }
        if (three) {
            b[trees[0].back()][trees[2].back()] = b[trees[2].back()][trees[0].back()] = 1;
        }
    }
    build(b);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 23332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 23332 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 7 ms 1372 KB Output is correct
13 Correct 160 ms 23280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 77 ms 14452 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 6228 KB Output is correct
21 Correct 163 ms 23472 KB Output is correct
22 Correct 161 ms 23376 KB Output is correct
23 Correct 167 ms 23292 KB Output is correct
24 Correct 170 ms 23532 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 66 ms 13352 KB Output is correct
27 Correct 170 ms 23424 KB Output is correct
28 Correct 160 ms 23380 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 1368 KB Output is correct
9 Correct 161 ms 23380 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 164 ms 23232 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 77 ms 14452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 408 KB Output is correct
21 Correct 43 ms 6248 KB Output is correct
22 Correct 163 ms 23364 KB Output is correct
23 Correct 169 ms 23380 KB Output is correct
24 Correct 182 ms 23460 KB Output is correct
25 Correct 69 ms 13388 KB Output is correct
26 Correct 69 ms 13696 KB Output is correct
27 Correct 161 ms 23372 KB Output is correct
28 Correct 166 ms 23324 KB Output is correct
29 Correct 70 ms 13492 KB Output is correct

Subtask #4
35.0 / 35.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 44 ms 6268 KB Output is correct
5 Correct 165 ms 23632 KB Output is correct
6 Correct 169 ms 23248 KB Output is correct
7 Correct 169 ms 23516 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 40 ms 6292 KB Output is correct
10 Correct 161 ms 23376 KB Output is correct
11 Correct 160 ms 23264 KB Output is correct
12 Correct 165 ms 23284 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 40 ms 6196 KB Output is correct
17 Correct 161 ms 23376 KB Output is correct
18 Correct 174 ms 23444 KB Output is correct
19 Correct 178 ms 23272 KB Output is correct
20 Correct 162 ms 23528 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 23332 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 7 ms 1372 KB Output is correct
13 Correct 160 ms 23280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 77 ms 14452 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 6228 KB Output is correct
21 Correct 163 ms 23472 KB Output is correct
22 Correct 161 ms 23376 KB Output is correct
23 Correct 167 ms 23292 KB Output is correct
24 Correct 170 ms 23532 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 66 ms 13352 KB Output is correct
27 Correct 170 ms 23424 KB Output is correct
28 Correct 160 ms 23380 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 161 ms 23380 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 164 ms 23232 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 77 ms 14452 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 408 KB Output is correct
49 Correct 43 ms 6248 KB Output is correct
50 Correct 163 ms 23364 KB Output is correct
51 Correct 169 ms 23380 KB Output is correct
52 Correct 182 ms 23460 KB Output is correct
53 Correct 69 ms 13388 KB Output is correct
54 Correct 69 ms 13696 KB Output is correct
55 Correct 161 ms 23372 KB Output is correct
56 Correct 166 ms 23324 KB Output is correct
57 Correct 70 ms 13492 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 81 ms 14676 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 40 ms 6224 KB Output is correct
66 Correct 67 ms 13392 KB Output is correct
67 Correct 71 ms 13332 KB Output is correct
68 Correct 65 ms 13528 KB Output is correct
69 Correct 71 ms 13584 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 23332 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 7 ms 1372 KB Output is correct
13 Correct 160 ms 23280 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 77 ms 14452 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 6228 KB Output is correct
21 Correct 163 ms 23472 KB Output is correct
22 Correct 161 ms 23376 KB Output is correct
23 Correct 167 ms 23292 KB Output is correct
24 Correct 170 ms 23532 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 66 ms 13352 KB Output is correct
27 Correct 170 ms 23424 KB Output is correct
28 Correct 160 ms 23380 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 161 ms 23380 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 164 ms 23232 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 77 ms 14452 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 408 KB Output is correct
49 Correct 43 ms 6248 KB Output is correct
50 Correct 163 ms 23364 KB Output is correct
51 Correct 169 ms 23380 KB Output is correct
52 Correct 182 ms 23460 KB Output is correct
53 Correct 69 ms 13388 KB Output is correct
54 Correct 69 ms 13696 KB Output is correct
55 Correct 161 ms 23372 KB Output is correct
56 Correct 166 ms 23324 KB Output is correct
57 Correct 70 ms 13492 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 44 ms 6268 KB Output is correct
62 Correct 165 ms 23632 KB Output is correct
63 Correct 169 ms 23248 KB Output is correct
64 Correct 169 ms 23516 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 40 ms 6292 KB Output is correct
67 Correct 161 ms 23376 KB Output is correct
68 Correct 160 ms 23264 KB Output is correct
69 Correct 165 ms 23284 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 40 ms 6196 KB Output is correct
74 Correct 161 ms 23376 KB Output is correct
75 Correct 174 ms 23444 KB Output is correct
76 Correct 178 ms 23272 KB Output is correct
77 Correct 162 ms 23528 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 81 ms 14676 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 40 ms 6224 KB Output is correct
86 Correct 67 ms 13392 KB Output is correct
87 Correct 71 ms 13332 KB Output is correct
88 Correct 65 ms 13528 KB Output is correct
89 Correct 71 ms 13584 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 76 ms 15044 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 17 ms 3676 KB Output is correct
98 Correct 66 ms 13500 KB Output is correct
99 Correct 73 ms 13352 KB Output is correct
100 Correct 68 ms 13396 KB Output is correct
101 Correct 69 ms 13412 KB Output is correct
102 Incorrect 173 ms 23336 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -