oj.uz

Submission #769103

# Submission time Handle Problem Language Result Execution time Memory
769103 2023-06-29T07:38:16 Z t6twotwo Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 165 ms 22076 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> a) {
    int N = a.size();
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (a[i][j] == 3) {
                return 0;
            }
        }
    }
    vector<bool> vis(N);
    auto bfs = [&](int s, int t) {
        vector<int> v;
        queue<int> q;
        q.push(s);
        vis[s] = 1;
        while (!q.empty()) {
            int x = q.front();
            q.pop();
            v.push_back(x);
            for (int y = 0; y < N; y++) {
                if (!vis[y] && a[x][y] == t) {
                    vis[y] = 1;
                    q.push(y);
                }
            }
        }
        return v;
    };
    vector ans(N, vector<int>(N));
    for (int i = 0; i < N; i++) {
        if (vis[i]) {
            continue;
        }
        auto v = bfs(i, 1);
        for (int x : v) {
            for (int j = 0; j < N; j++) {
                if (a[x][j] != a[v[0]][j]) {
                    return 0;
                }
            }
        }
        for (int j = 1; j < v.size(); j++) {
            ans[i][v[j]] = ans[v[j]][i] = 1;
        }
        vis[i] = 0;
    }
    for (int i = 0; i < N; i++) {
        if (vis[i]) {
            continue;
        }
        auto v = bfs(i, 2);
        if (v.size() == 1) {
            continue;
        }
        if (v.size() == 2) {
            return 0;
        }
        for (int j = 0; j < v.size(); j++) {
            for (int k = j + 1; k < v.size(); k++) {
                if (!a[v[j]][v[k]]) {
                    return 0;
                }
            }
        }
        for (int j = 0; j < v.size(); j++) {
            int x = v[j];
            int y = v[j + 1 == v.size() ? 0 : j + 1];
            ans[x][y] = ans[y][x] = 1;
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 1; j < v.size(); j++) {
      |                         ~~^~~~~~~~~~
supertrees.cpp:61:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for (int j = 0; j < v.size(); j++) {
      |                         ~~^~~~~~~~~~
supertrees.cpp:62:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for (int k = j + 1; k < v.size(); k++) {
      |                                 ~~^~~~~~~~~~
supertrees.cpp:68:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for (int j = 0; j < v.size(); j++) {
      |                         ~~^~~~~~~~~~
supertrees.cpp:70:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             int y = v[j + 1 == v.size() ? 0 : j + 1];
      |                       ~~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 150 ms 22020 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 150 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 153 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 65 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 5716 KB Output is correct
21 Correct 151 ms 22000 KB Output is correct
22 Correct 152 ms 22028 KB Output is correct
23 Correct 155 ms 21936 KB Output is correct
24 Correct 155 ms 22016 KB Output is correct
25 Correct 62 ms 12032 KB Output is correct
26 Correct 59 ms 12044 KB Output is correct
27 Correct 159 ms 22076 KB Output is correct
28 Correct 155 ms 21964 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1136 KB Output is correct
9 Correct 154 ms 21952 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 155 ms 22016 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 67 ms 12032 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 38 ms 5684 KB Output is correct
22 Correct 154 ms 22004 KB Output is correct
23 Correct 153 ms 21952 KB Output is correct
24 Correct 160 ms 22040 KB Output is correct
25 Correct 64 ms 12044 KB Output is correct
26 Correct 68 ms 12032 KB Output is correct
27 Correct 152 ms 21992 KB Output is correct
28 Correct 164 ms 22016 KB Output is correct
29 Correct 62 ms 12036 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 37 ms 5644 KB Output is correct
5 Correct 153 ms 21936 KB Output is correct
6 Correct 154 ms 22036 KB Output is correct
7 Correct 154 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 39 ms 5708 KB Output is correct
10 Correct 158 ms 21976 KB Output is correct
11 Correct 153 ms 21976 KB Output is correct
12 Correct 159 ms 22008 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 38 ms 5652 KB Output is correct
17 Correct 155 ms 21964 KB Output is correct
18 Correct 155 ms 22020 KB Output is correct
19 Correct 153 ms 22020 KB Output is correct
20 Correct 165 ms 21960 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 150 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 153 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 65 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 5716 KB Output is correct
21 Correct 151 ms 22000 KB Output is correct
22 Correct 152 ms 22028 KB Output is correct
23 Correct 155 ms 21936 KB Output is correct
24 Correct 155 ms 22016 KB Output is correct
25 Correct 62 ms 12032 KB Output is correct
26 Correct 59 ms 12044 KB Output is correct
27 Correct 159 ms 22076 KB Output is correct
28 Correct 155 ms 21964 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1136 KB Output is correct
37 Correct 154 ms 21952 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 155 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 67 ms 12032 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 38 ms 5684 KB Output is correct
50 Correct 154 ms 22004 KB Output is correct
51 Correct 153 ms 21952 KB Output is correct
52 Correct 160 ms 22040 KB Output is correct
53 Correct 64 ms 12044 KB Output is correct
54 Correct 68 ms 12032 KB Output is correct
55 Correct 152 ms 21992 KB Output is correct
56 Correct 164 ms 22016 KB Output is correct
57 Correct 62 ms 12036 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 724 KB Output is correct
61 Correct 67 ms 12056 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 39 ms 5680 KB Output is correct
66 Correct 59 ms 12032 KB Output is correct
67 Correct 59 ms 12036 KB Output is correct
68 Correct 61 ms 12032 KB Output is correct
69 Correct 66 ms 12036 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 150 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 153 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 65 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 5716 KB Output is correct
21 Correct 151 ms 22000 KB Output is correct
22 Correct 152 ms 22028 KB Output is correct
23 Correct 155 ms 21936 KB Output is correct
24 Correct 155 ms 22016 KB Output is correct
25 Correct 62 ms 12032 KB Output is correct
26 Correct 59 ms 12044 KB Output is correct
27 Correct 159 ms 22076 KB Output is correct
28 Correct 155 ms 21964 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1136 KB Output is correct
37 Correct 154 ms 21952 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 155 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 67 ms 12032 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 38 ms 5684 KB Output is correct
50 Correct 154 ms 22004 KB Output is correct
51 Correct 153 ms 21952 KB Output is correct
52 Correct 160 ms 22040 KB Output is correct
53 Correct 64 ms 12044 KB Output is correct
54 Correct 68 ms 12032 KB Output is correct
55 Correct 152 ms 21992 KB Output is correct
56 Correct 164 ms 22016 KB Output is correct
57 Correct 62 ms 12036 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 37 ms 5644 KB Output is correct
62 Correct 153 ms 21936 KB Output is correct
63 Correct 154 ms 22036 KB Output is correct
64 Correct 154 ms 22020 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 39 ms 5708 KB Output is correct
67 Correct 158 ms 21976 KB Output is correct
68 Correct 153 ms 21976 KB Output is correct
69 Correct 159 ms 22008 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 38 ms 5652 KB Output is correct
74 Correct 155 ms 21964 KB Output is correct
75 Correct 155 ms 22020 KB Output is correct
76 Correct 153 ms 22020 KB Output is correct
77 Correct 165 ms 21960 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 3 ms 724 KB Output is correct
81 Correct 67 ms 12056 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 39 ms 5680 KB Output is correct
86 Correct 59 ms 12032 KB Output is correct
87 Correct 59 ms 12036 KB Output is correct
88 Correct 61 ms 12032 KB Output is correct
89 Correct 66 ms 12036 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 78 ms 8076 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 14 ms 2772 KB Output is correct
98 Correct 74 ms 10108 KB Output is correct
99 Correct 65 ms 10096 KB Output is correct
100 Correct 57 ms 10072 KB Output is correct
101 Correct 60 ms 10104 KB Output is correct
102 Correct 57 ms 10140 KB Output is correct
103 Correct 71 ms 10100 KB Output is correct
104 Correct 62 ms 10028 KB Output is correct
105 Correct 62 ms 10160 KB Output is correct