oj.uz

답안 #953601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953601 2024-03-26T10:06:06 Z Desh03 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 169 ms 24404 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]) || (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;
                    }
                }
            }
        }
        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 k = j + 1; k < sz; k++) {
                for (int u : trees[j]) {
                    for (int v : trees[k]) {
                        if ((two && p[u][v] != 2) || (three && p[u][v] != three)) {
                            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: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:90:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             for (int k = 0; k < trees[j].size() - 1; k++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 24080 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 24080 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 1192 KB Output is correct
13 Correct 162 ms 23940 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 932 KB Output is correct
17 Correct 82 ms 15016 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6392 KB Output is correct
21 Correct 160 ms 24148 KB Output is correct
22 Correct 160 ms 24144 KB Output is correct
23 Correct 167 ms 24056 KB Output is correct
24 Correct 161 ms 23924 KB Output is correct
25 Correct 70 ms 14160 KB Output is correct
26 Correct 67 ms 14220 KB Output is correct
27 Correct 168 ms 24060 KB Output is correct
28 Correct 158 ms 24144 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 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 1152 KB Output is correct
9 Correct 158 ms 24020 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 165 ms 23916 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 1056 KB Output is correct
17 Correct 78 ms 15096 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 41 ms 6272 KB Output is correct
22 Correct 166 ms 24404 KB Output is correct
23 Correct 161 ms 24148 KB Output is correct
24 Correct 168 ms 23944 KB Output is correct
25 Correct 70 ms 14072 KB Output is correct
26 Correct 68 ms 14068 KB Output is correct
27 Correct 160 ms 24144 KB Output is correct
28 Correct 167 ms 24052 KB Output is correct
29 Correct 68 ms 14160 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 40 ms 6240 KB Output is correct
5 Correct 161 ms 23928 KB Output is correct
6 Correct 159 ms 23888 KB Output is correct
7 Correct 168 ms 24060 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 44 ms 6208 KB Output is correct
10 Correct 162 ms 24148 KB Output is correct
11 Correct 160 ms 23928 KB Output is correct
12 Correct 169 ms 24056 KB Output is correct
13 Correct 0 ms 348 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 6240 KB Output is correct
17 Correct 161 ms 23928 KB Output is correct
18 Correct 166 ms 24120 KB Output is correct
19 Correct 160 ms 23896 KB Output is correct
20 Correct 161 ms 23976 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 24080 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 1192 KB Output is correct
13 Correct 162 ms 23940 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 932 KB Output is correct
17 Correct 82 ms 15016 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6392 KB Output is correct
21 Correct 160 ms 24148 KB Output is correct
22 Correct 160 ms 24144 KB Output is correct
23 Correct 167 ms 24056 KB Output is correct
24 Correct 161 ms 23924 KB Output is correct
25 Correct 70 ms 14160 KB Output is correct
26 Correct 67 ms 14220 KB Output is correct
27 Correct 168 ms 24060 KB Output is correct
28 Correct 158 ms 24144 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 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 1152 KB Output is correct
37 Correct 158 ms 24020 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 165 ms 23916 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 1056 KB Output is correct
45 Correct 78 ms 15096 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 6272 KB Output is correct
50 Correct 166 ms 24404 KB Output is correct
51 Correct 161 ms 24148 KB Output is correct
52 Correct 168 ms 23944 KB Output is correct
53 Correct 70 ms 14072 KB Output is correct
54 Correct 68 ms 14068 KB Output is correct
55 Correct 160 ms 24144 KB Output is correct
56 Correct 167 ms 24052 KB Output is correct
57 Correct 68 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 932 KB Output is correct
61 Correct 77 ms 15356 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 41 ms 6264 KB Output is correct
66 Correct 68 ms 14080 KB Output is correct
67 Correct 72 ms 14156 KB Output is correct
68 Correct 68 ms 14088 KB Output is correct
69 Correct 66 ms 14200 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 165 ms 24080 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 1192 KB Output is correct
13 Correct 162 ms 23940 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 932 KB Output is correct
17 Correct 82 ms 15016 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6392 KB Output is correct
21 Correct 160 ms 24148 KB Output is correct
22 Correct 160 ms 24144 KB Output is correct
23 Correct 167 ms 24056 KB Output is correct
24 Correct 161 ms 23924 KB Output is correct
25 Correct 70 ms 14160 KB Output is correct
26 Correct 67 ms 14220 KB Output is correct
27 Correct 168 ms 24060 KB Output is correct
28 Correct 158 ms 24144 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 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 1152 KB Output is correct
37 Correct 158 ms 24020 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 165 ms 23916 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 1056 KB Output is correct
45 Correct 78 ms 15096 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 6272 KB Output is correct
50 Correct 166 ms 24404 KB Output is correct
51 Correct 161 ms 24148 KB Output is correct
52 Correct 168 ms 23944 KB Output is correct
53 Correct 70 ms 14072 KB Output is correct
54 Correct 68 ms 14068 KB Output is correct
55 Correct 160 ms 24144 KB Output is correct
56 Correct 167 ms 24052 KB Output is correct
57 Correct 68 ms 14160 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 40 ms 6240 KB Output is correct
62 Correct 161 ms 23928 KB Output is correct
63 Correct 159 ms 23888 KB Output is correct
64 Correct 168 ms 24060 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 44 ms 6208 KB Output is correct
67 Correct 162 ms 24148 KB Output is correct
68 Correct 160 ms 23928 KB Output is correct
69 Correct 169 ms 24056 KB Output is correct
70 Correct 0 ms 348 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 6240 KB Output is correct
74 Correct 161 ms 23928 KB Output is correct
75 Correct 166 ms 24120 KB Output is correct
76 Correct 160 ms 23896 KB Output is correct
77 Correct 161 ms 23976 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 932 KB Output is correct
81 Correct 77 ms 15356 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 41 ms 6264 KB Output is correct
86 Correct 68 ms 14080 KB Output is correct
87 Correct 72 ms 14156 KB Output is correct
88 Correct 68 ms 14088 KB Output is correct
89 Correct 66 ms 14200 KB Output is correct
90 Correct 1 ms 600 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 856 KB Output is correct
93 Correct 75 ms 15700 KB Output is correct
94 Correct 1 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 3708 KB Output is correct
98 Correct 68 ms 14164 KB Output is correct
99 Correct 82 ms 14212 KB Output is correct
100 Correct 69 ms 14160 KB Output is correct
101 Correct 68 ms 14160 KB Output is correct
102 Correct 75 ms 16136 KB Output is correct
103 Correct 77 ms 16212 KB Output is correct
104 Correct 90 ms 16312 KB Output is correct
105 Correct 79 ms 15188 KB Output is correct