oj.uz

답안 #385651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385651 2021-04-04T16:40:54 Z two_sides 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 277 ms 24300 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(vector <vector <int>> p) {
	int n = p.size();
	vector <vector <int>> b(n, vector <int> (n));
        vector <int> vis(n), root(n), cmp;
        auto add_edge = [&](int u, int v) {
            b[u][v] = b[v][u] = 1;
        };
        queue <int> que;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (p[i][j] == 3) return 0;
        for (int i = 0, u; i < n; i++) {
            if (vis[i]) continue;
            vis[i] = root[i] = 1;
            que.push(i); cmp.clear();
            while (que.size()) {
                u = que.front(); que.pop();
                cmp.push_back(u);
                for (int v = 0; v < n; v++)
                    if (p[u][v] == 1 && !vis[v]) {
                        vis[v] = 1; que.push(v);
                    }
            }
            for (int j = 1; j < cmp.size(); j++) {
                add_edge(cmp[j - 1], cmp[j]);
                for (int k = 0; k < j; k++)
                    if (p[cmp[j]][cmp[k]] != 1)
                        return 0;
            }
        }
        fill(vis.begin(), vis.end(), 0);
        for (int i = 0, u; i < n; i++) {
            if (!root[i] || vis[i]) continue;
            vis[i] = 1; que.push(i); cmp.clear();
            while (que.size()) {
                u = que.front(); que.pop();
                cmp.push_back(u);
                for (int v = 0; v < n; v++)
                    if (root[v] && p[u][v] == 2 && !vis[v]) {
                        vis[v] = 1; que.push(v);
                    }
            }
            if (cmp.size() == 2) return 0;
            if (cmp.size() == 1) continue;
            add_edge(cmp.front(), cmp.back());
            for (int j = 1; j < cmp.size(); j++) {
                add_edge(cmp[j - 1], cmp[j]);
                for (int k = 0; k < j; k++)
                    if (p[cmp[k]][cmp[j]] != 2)
                        return 0;
            }
        }
        build(b); return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:29:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             for (int j = 1; j < cmp.size(); j++) {
      |                             ~~^~~~~~~~~~~~
supertrees.cpp:51:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for (int j = 1; j < cmp.size(); j++) {
      |                             ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 248 ms 24016 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 248 ms 24016 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 250 ms 23660 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 116 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6252 KB Output is correct
21 Correct 250 ms 24044 KB Output is correct
22 Correct 269 ms 24044 KB Output is correct
23 Correct 253 ms 24172 KB Output is correct
24 Correct 260 ms 24172 KB Output is correct
25 Correct 107 ms 14188 KB Output is correct
26 Correct 100 ms 14188 KB Output is correct
27 Correct 254 ms 24044 KB Output is correct
28 Correct 248 ms 24108 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 264 ms 24132 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 248 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 119 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 64 ms 6252 KB Output is correct
22 Correct 251 ms 24044 KB Output is correct
23 Correct 247 ms 24044 KB Output is correct
24 Correct 255 ms 24064 KB Output is correct
25 Correct 109 ms 14188 KB Output is correct
26 Correct 111 ms 14188 KB Output is correct
27 Correct 251 ms 23660 KB Output is correct
28 Correct 277 ms 24144 KB Output is correct
29 Correct 106 ms 14188 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 372 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 62 ms 6252 KB Output is correct
5 Correct 246 ms 24300 KB Output is correct
6 Correct 250 ms 24044 KB Output is correct
7 Correct 255 ms 24064 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 63 ms 6252 KB Output is correct
10 Correct 251 ms 24172 KB Output is correct
11 Correct 249 ms 24144 KB Output is correct
12 Correct 257 ms 24172 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 65 ms 6380 KB Output is correct
17 Correct 259 ms 24044 KB Output is correct
18 Correct 256 ms 24044 KB Output is correct
19 Correct 251 ms 24044 KB Output is correct
20 Correct 249 ms 24044 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 248 ms 24016 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 250 ms 23660 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 116 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6252 KB Output is correct
21 Correct 250 ms 24044 KB Output is correct
22 Correct 269 ms 24044 KB Output is correct
23 Correct 253 ms 24172 KB Output is correct
24 Correct 260 ms 24172 KB Output is correct
25 Correct 107 ms 14188 KB Output is correct
26 Correct 100 ms 14188 KB Output is correct
27 Correct 254 ms 24044 KB Output is correct
28 Correct 248 ms 24108 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 264 ms 24132 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 248 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 876 KB Output is correct
45 Correct 119 ms 14188 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6252 KB Output is correct
50 Correct 251 ms 24044 KB Output is correct
51 Correct 247 ms 24044 KB Output is correct
52 Correct 255 ms 24064 KB Output is correct
53 Correct 109 ms 14188 KB Output is correct
54 Correct 111 ms 14188 KB Output is correct
55 Correct 251 ms 23660 KB Output is correct
56 Correct 277 ms 24144 KB Output is correct
57 Correct 106 ms 14188 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 7 ms 876 KB Output is correct
61 Correct 114 ms 14188 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 62 ms 6252 KB Output is correct
66 Correct 108 ms 14188 KB Output is correct
67 Correct 102 ms 14188 KB Output is correct
68 Correct 108 ms 14160 KB Output is correct
69 Correct 111 ms 14188 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 248 ms 24016 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 250 ms 23660 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 116 ms 14188 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6252 KB Output is correct
21 Correct 250 ms 24044 KB Output is correct
22 Correct 269 ms 24044 KB Output is correct
23 Correct 253 ms 24172 KB Output is correct
24 Correct 260 ms 24172 KB Output is correct
25 Correct 107 ms 14188 KB Output is correct
26 Correct 100 ms 14188 KB Output is correct
27 Correct 254 ms 24044 KB Output is correct
28 Correct 248 ms 24108 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 264 ms 24132 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 248 ms 24172 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 6 ms 876 KB Output is correct
45 Correct 119 ms 14188 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 64 ms 6252 KB Output is correct
50 Correct 251 ms 24044 KB Output is correct
51 Correct 247 ms 24044 KB Output is correct
52 Correct 255 ms 24064 KB Output is correct
53 Correct 109 ms 14188 KB Output is correct
54 Correct 111 ms 14188 KB Output is correct
55 Correct 251 ms 23660 KB Output is correct
56 Correct 277 ms 24144 KB Output is correct
57 Correct 106 ms 14188 KB Output is correct
58 Correct 1 ms 372 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 62 ms 6252 KB Output is correct
62 Correct 246 ms 24300 KB Output is correct
63 Correct 250 ms 24044 KB Output is correct
64 Correct 255 ms 24064 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 63 ms 6252 KB Output is correct
67 Correct 251 ms 24172 KB Output is correct
68 Correct 249 ms 24144 KB Output is correct
69 Correct 257 ms 24172 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 65 ms 6380 KB Output is correct
74 Correct 259 ms 24044 KB Output is correct
75 Correct 256 ms 24044 KB Output is correct
76 Correct 251 ms 24044 KB Output is correct
77 Correct 249 ms 24044 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 7 ms 876 KB Output is correct
81 Correct 114 ms 14188 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 62 ms 6252 KB Output is correct
86 Correct 108 ms 14188 KB Output is correct
87 Correct 102 ms 14188 KB Output is correct
88 Correct 108 ms 14160 KB Output is correct
89 Correct 111 ms 14188 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 876 KB Output is correct
93 Correct 105 ms 14188 KB Output is correct
94 Correct 1 ms 364 KB Output is correct
95 Correct 2 ms 364 KB Output is correct
96 Correct 2 ms 364 KB Output is correct
97 Correct 27 ms 3820 KB Output is correct
98 Correct 101 ms 14188 KB Output is correct
99 Correct 101 ms 14188 KB Output is correct
100 Correct 102 ms 14188 KB Output is correct
101 Correct 104 ms 14188 KB Output is correct
102 Correct 98 ms 14188 KB Output is correct
103 Correct 99 ms 14188 KB Output is correct
104 Correct 99 ms 14188 KB Output is correct
105 Correct 113 ms 14188 KB Output is correct