oj.uz

Submission #953267

# Submission time Handle Problem Language Result Execution time Memory
953267 2024-03-25T18:40:45 Z Desh03 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 193 ms 24264 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 (p[i][j] == 2) two = 1;
                if (p[i][j] == 3) three = 1;
                if (!vis[j] && p[i][j]) {    
                    q.push(j);
                }
            }
        }
        for (int u : nodes) {
            for (int j = 0; j < n; j++) {
                if (!vis_[j] && p[u][j]) {
                    return 0;
                }
            }
        } 
        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:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int j = 0; j < nodes.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~
supertrees.cpp:39:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for (int k = j + 1; k < nodes.size(); k++) {
      |                                 ~~^~~~~~~~~~~~~~
supertrees.cpp:70:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for (int k = 0; k < trees[j].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:71:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |                 for (int l = k + 1; l < trees[j].size(); l++) {
      |                                     ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:83:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |             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 600 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 1116 KB Output is correct
7 Correct 166 ms 22120 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 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 1116 KB Output is correct
7 Correct 166 ms 22120 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 1104 KB Output is correct
13 Correct 175 ms 22064 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 74 ms 12820 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 40 ms 5864 KB Output is correct
21 Correct 160 ms 22096 KB Output is correct
22 Correct 158 ms 22096 KB Output is correct
23 Correct 167 ms 22264 KB Output is correct
24 Correct 159 ms 22096 KB Output is correct
25 Correct 72 ms 12056 KB Output is correct
26 Correct 64 ms 14164 KB Output is correct
27 Correct 193 ms 24064 KB Output is correct
28 Correct 158 ms 23892 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 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 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 157 ms 21984 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 1300 KB Output is correct
13 Correct 161 ms 22148 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 1056 KB Output is correct
17 Correct 70 ms 12864 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 41 ms 5716 KB Output is correct
22 Correct 159 ms 22028 KB Output is correct
23 Correct 158 ms 22036 KB Output is correct
24 Correct 165 ms 22204 KB Output is correct
25 Correct 67 ms 12040 KB Output is correct
26 Correct 66 ms 12296 KB Output is correct
27 Correct 159 ms 24112 KB Output is correct
28 Correct 167 ms 24092 KB Output is correct
29 Correct 67 ms 14160 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 40 ms 5816 KB Output is correct
5 Correct 159 ms 22084 KB Output is correct
6 Correct 157 ms 22024 KB Output is correct
7 Correct 165 ms 22184 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 41 ms 5760 KB Output is correct
10 Correct 159 ms 22020 KB Output is correct
11 Correct 157 ms 22148 KB Output is correct
12 Correct 165 ms 21996 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 5776 KB Output is correct
17 Correct 165 ms 22020 KB Output is correct
18 Correct 160 ms 22096 KB Output is correct
19 Correct 162 ms 22424 KB Output is correct
20 Correct 161 ms 22100 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 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 1116 KB Output is correct
7 Correct 166 ms 22120 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 1104 KB Output is correct
13 Correct 175 ms 22064 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 74 ms 12820 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 40 ms 5864 KB Output is correct
21 Correct 160 ms 22096 KB Output is correct
22 Correct 158 ms 22096 KB Output is correct
23 Correct 167 ms 22264 KB Output is correct
24 Correct 159 ms 22096 KB Output is correct
25 Correct 72 ms 12056 KB Output is correct
26 Correct 64 ms 14164 KB Output is correct
27 Correct 193 ms 24064 KB Output is correct
28 Correct 158 ms 23892 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 344 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 157 ms 21984 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1300 KB Output is correct
41 Correct 161 ms 22148 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 1056 KB Output is correct
45 Correct 70 ms 12864 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 41 ms 5716 KB Output is correct
50 Correct 159 ms 22028 KB Output is correct
51 Correct 158 ms 22036 KB Output is correct
52 Correct 165 ms 22204 KB Output is correct
53 Correct 67 ms 12040 KB Output is correct
54 Correct 66 ms 12296 KB Output is correct
55 Correct 159 ms 24112 KB Output is correct
56 Correct 167 ms 24092 KB Output is correct
57 Correct 67 ms 14160 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 72 ms 14928 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 40 ms 6228 KB Output is correct
66 Correct 66 ms 14164 KB Output is correct
67 Correct 67 ms 14160 KB Output is correct
68 Correct 69 ms 14068 KB Output is correct
69 Correct 63 ms 14216 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 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 1116 KB Output is correct
7 Correct 166 ms 22120 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 1104 KB Output is correct
13 Correct 175 ms 22064 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 74 ms 12820 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 40 ms 5864 KB Output is correct
21 Correct 160 ms 22096 KB Output is correct
22 Correct 158 ms 22096 KB Output is correct
23 Correct 167 ms 22264 KB Output is correct
24 Correct 159 ms 22096 KB Output is correct
25 Correct 72 ms 12056 KB Output is correct
26 Correct 64 ms 14164 KB Output is correct
27 Correct 193 ms 24064 KB Output is correct
28 Correct 158 ms 23892 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 344 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 157 ms 21984 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1300 KB Output is correct
41 Correct 161 ms 22148 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 1056 KB Output is correct
45 Correct 70 ms 12864 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 41 ms 5716 KB Output is correct
50 Correct 159 ms 22028 KB Output is correct
51 Correct 158 ms 22036 KB Output is correct
52 Correct 165 ms 22204 KB Output is correct
53 Correct 67 ms 12040 KB Output is correct
54 Correct 66 ms 12296 KB Output is correct
55 Correct 159 ms 24112 KB Output is correct
56 Correct 167 ms 24092 KB Output is correct
57 Correct 67 ms 14160 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 40 ms 5816 KB Output is correct
62 Correct 159 ms 22084 KB Output is correct
63 Correct 157 ms 22024 KB Output is correct
64 Correct 165 ms 22184 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 41 ms 5760 KB Output is correct
67 Correct 159 ms 22020 KB Output is correct
68 Correct 157 ms 22148 KB Output is correct
69 Correct 165 ms 21996 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 5776 KB Output is correct
74 Correct 165 ms 22020 KB Output is correct
75 Correct 160 ms 22096 KB Output is correct
76 Correct 162 ms 22424 KB Output is correct
77 Correct 161 ms 22100 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 72 ms 14928 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 40 ms 6228 KB Output is correct
86 Correct 66 ms 14164 KB Output is correct
87 Correct 67 ms 14160 KB Output is correct
88 Correct 69 ms 14068 KB Output is correct
89 Correct 63 ms 14216 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 70 ms 15352 KB Output is correct
94 Correct 0 ms 344 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 3700 KB Output is correct
98 Correct 66 ms 14164 KB Output is correct
99 Correct 70 ms 14164 KB Output is correct
100 Correct 68 ms 14200 KB Output is correct
101 Correct 66 ms 14164 KB Output is correct
102 Incorrect 167 ms 24264 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -