oj.uz

답안 #953636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953636 2024-03-26T11:31:33 Z Desh03 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 195 ms 23476 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) 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) {
                            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 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 160 ms 23268 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 160 ms 23268 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1380 KB Output is correct
13 Correct 156 ms 23364 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 75 ms 14472 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6472 KB Output is correct
21 Correct 162 ms 23392 KB Output is correct
22 Correct 161 ms 23260 KB Output is correct
23 Correct 165 ms 23368 KB Output is correct
24 Correct 158 ms 23384 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 64 ms 13392 KB Output is correct
27 Correct 165 ms 23388 KB Output is correct
28 Correct 163 ms 23476 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 344 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 344 KB Output is correct
6 Correct 1 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 155 ms 23432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1340 KB Output is correct
13 Correct 158 ms 23392 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 77 ms 14436 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 348 KB Output is correct
21 Correct 40 ms 6200 KB Output is correct
22 Correct 173 ms 23356 KB Output is correct
23 Correct 157 ms 23376 KB Output is correct
24 Correct 160 ms 23376 KB Output is correct
25 Correct 76 ms 13324 KB Output is correct
26 Correct 66 ms 13368 KB Output is correct
27 Correct 159 ms 23340 KB Output is correct
28 Correct 164 ms 23328 KB Output is correct
29 Correct 74 ms 13480 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 6152 KB Output is correct
5 Correct 156 ms 23404 KB Output is correct
6 Correct 156 ms 23444 KB Output is correct
7 Correct 186 ms 23368 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 39 ms 6224 KB Output is correct
10 Correct 178 ms 23276 KB Output is correct
11 Correct 195 ms 23448 KB Output is correct
12 Correct 172 ms 23400 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 39 ms 6228 KB Output is correct
17 Correct 174 ms 23476 KB Output is correct
18 Correct 156 ms 23376 KB Output is correct
19 Correct 167 ms 23256 KB Output is correct
20 Correct 167 ms 23340 KB Output is correct

Subtask #5
21.0 / 21.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 160 ms 23268 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1380 KB Output is correct
13 Correct 156 ms 23364 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 75 ms 14472 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6472 KB Output is correct
21 Correct 162 ms 23392 KB Output is correct
22 Correct 161 ms 23260 KB Output is correct
23 Correct 165 ms 23368 KB Output is correct
24 Correct 158 ms 23384 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 64 ms 13392 KB Output is correct
27 Correct 165 ms 23388 KB Output is correct
28 Correct 163 ms 23476 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 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 155 ms 23432 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1340 KB Output is correct
41 Correct 158 ms 23392 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 77 ms 14436 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 348 KB Output is correct
49 Correct 40 ms 6200 KB Output is correct
50 Correct 173 ms 23356 KB Output is correct
51 Correct 157 ms 23376 KB Output is correct
52 Correct 160 ms 23376 KB Output is correct
53 Correct 76 ms 13324 KB Output is correct
54 Correct 66 ms 13368 KB Output is correct
55 Correct 159 ms 23340 KB Output is correct
56 Correct 164 ms 23328 KB Output is correct
57 Correct 74 ms 13480 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 78 ms 14884 KB Output is correct
62 Correct 1 ms 360 KB Output is correct
63 Correct 0 ms 600 KB Output is correct
64 Correct 0 ms 436 KB Output is correct
65 Correct 43 ms 6420 KB Output is correct
66 Correct 69 ms 13392 KB Output is correct
67 Correct 71 ms 13396 KB Output is correct
68 Correct 68 ms 13376 KB Output is correct
69 Correct 68 ms 13304 KB Output is correct

Subtask #6
4.0 / 4.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 160 ms 23268 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1380 KB Output is correct
13 Correct 156 ms 23364 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 75 ms 14472 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 6472 KB Output is correct
21 Correct 162 ms 23392 KB Output is correct
22 Correct 161 ms 23260 KB Output is correct
23 Correct 165 ms 23368 KB Output is correct
24 Correct 158 ms 23384 KB Output is correct
25 Correct 72 ms 13456 KB Output is correct
26 Correct 64 ms 13392 KB Output is correct
27 Correct 165 ms 23388 KB Output is correct
28 Correct 163 ms 23476 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 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 155 ms 23432 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1340 KB Output is correct
41 Correct 158 ms 23392 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 77 ms 14436 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 348 KB Output is correct
49 Correct 40 ms 6200 KB Output is correct
50 Correct 173 ms 23356 KB Output is correct
51 Correct 157 ms 23376 KB Output is correct
52 Correct 160 ms 23376 KB Output is correct
53 Correct 76 ms 13324 KB Output is correct
54 Correct 66 ms 13368 KB Output is correct
55 Correct 159 ms 23340 KB Output is correct
56 Correct 164 ms 23328 KB Output is correct
57 Correct 74 ms 13480 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 6152 KB Output is correct
62 Correct 156 ms 23404 KB Output is correct
63 Correct 156 ms 23444 KB Output is correct
64 Correct 186 ms 23368 KB Output is correct
65 Correct 1 ms 600 KB Output is correct
66 Correct 39 ms 6224 KB Output is correct
67 Correct 178 ms 23276 KB Output is correct
68 Correct 195 ms 23448 KB Output is correct
69 Correct 172 ms 23400 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 39 ms 6228 KB Output is correct
74 Correct 174 ms 23476 KB Output is correct
75 Correct 156 ms 23376 KB Output is correct
76 Correct 167 ms 23256 KB Output is correct
77 Correct 167 ms 23340 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 78 ms 14884 KB Output is correct
82 Correct 1 ms 360 KB Output is correct
83 Correct 0 ms 600 KB Output is correct
84 Correct 0 ms 436 KB Output is correct
85 Correct 43 ms 6420 KB Output is correct
86 Correct 69 ms 13392 KB Output is correct
87 Correct 71 ms 13396 KB Output is correct
88 Correct 68 ms 13376 KB Output is correct
89 Correct 68 ms 13304 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 4 ms 860 KB Output is correct
93 Correct 74 ms 14852 KB Output is correct
94 Correct 0 ms 440 KB Output is correct
95 Correct 1 ms 604 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 17 ms 3844 KB Output is correct
98 Correct 69 ms 13548 KB Output is correct
99 Correct 71 ms 13448 KB Output is correct
100 Correct 75 ms 13544 KB Output is correct
101 Correct 69 ms 13528 KB Output is correct
102 Correct 79 ms 15624 KB Output is correct
103 Correct 77 ms 15492 KB Output is correct
104 Correct 86 ms 15400 KB Output is correct
105 Correct 79 ms 14340 KB Output is correct