oj.uz

Submission #421195

# Submission time Handle Problem Language Result Execution time Memory
421195 2021-06-08T20:54:42 Z Apiram Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 276 ms 24132 KB 
#include <bits/stdc++.h>

#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p) {
    int n = p.size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 3) return 0;
        }
    }
    vector<vector<int>> answer;
    for (int i = 0; i < n; i++) {
        vector<int> row;
        row.resize(n);
        answer.push_back(row);
    }
    vector<bool> visited(n);
    vector<int> componentIndex(n);
    vector<int> lineIndex(n);
    for (int aa = 0; aa < n; aa++) {
        if (visited[aa]) continue;
        queue<int> qcomponent;
        qcomponent.push(aa);
        vector<int> cycle;
        while (!qcomponent.empty()) {
            int x = qcomponent.front();
            qcomponent.pop();
            if (visited[x]) continue;
            vector<int> curline;
            queue<int> qline;
            qline.push(x);
            cycle.push_back(x);
            while (!qline.empty()) {
                int y = qline.front();
                qline.pop();
                if (visited[y]) continue;
                curline.push_back(y);
                visited[y] = true;
                componentIndex[y] = aa;
                lineIndex[y] = x;
                for (int i = 0; i < n; i++) {
                    if (p[y][i] == 2)
                        qcomponent.push(i);
                    else if (p[y][i] == 1)
                        qline.push(i);
                }
            }
            // for (int i : curline) printf("%d ", i); printf("\n");
            if (curline.size() > 1) {
                for (int i = 0; i < (int)curline.size() - 1; i++) {
                    int a = curline[i];
                    int b = curline[i + 1];
                    answer[a][b] = answer[b][a] = 1;
                }
            }
        }
        if (cycle.size() == 2) return 0;
        if (cycle.size() == 1) continue;
        for (int i = 0; i < (int)cycle.size(); i++) {
            int a = cycle[i];
            int b = cycle[(i + 1) % cycle.size()];
            answer[a][b] = answer[b][a] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (lineIndex[i] == lineIndex[j]) {
                if (p[i][j] != 1) return 0;
            } else if (componentIndex[i] == componentIndex[j]) {
                if (p[i][j] != 2) return 0;
            } else {
                if (p[i][j] != 0) return 0;
            }
        }
    }
    build(answer);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 261 ms 22032 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 261 ms 22032 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 224 ms 22008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 115 ms 14148 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 60 ms 5756 KB Output is correct
21 Correct 241 ms 22048 KB Output is correct
22 Correct 239 ms 22012 KB Output is correct
23 Correct 240 ms 22132 KB Output is correct
24 Correct 223 ms 21928 KB Output is correct
25 Correct 106 ms 12160 KB Output is correct
26 Correct 97 ms 12028 KB Output is correct
27 Correct 241 ms 22024 KB Output is correct
28 Correct 226 ms 21944 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1228 KB Output is correct
9 Correct 256 ms 24040 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1256 KB Output is correct
13 Correct 234 ms 23940 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 964 KB Output is correct
17 Correct 115 ms 16120 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 57 ms 6248 KB Output is correct
22 Correct 230 ms 23928 KB Output is correct
23 Correct 228 ms 23900 KB Output is correct
24 Correct 246 ms 24112 KB Output is correct
25 Correct 96 ms 14056 KB Output is correct
26 Correct 115 ms 14060 KB Output is correct
27 Correct 226 ms 23924 KB Output is correct
28 Correct 239 ms 23940 KB Output is correct
29 Correct 118 ms 14148 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 57 ms 6240 KB Output is correct
5 Correct 233 ms 24132 KB Output is correct
6 Correct 276 ms 23924 KB Output is correct
7 Correct 244 ms 24072 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 57 ms 6208 KB Output is correct
10 Correct 236 ms 23920 KB Output is correct
11 Correct 227 ms 23988 KB Output is correct
12 Correct 239 ms 23980 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 284 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 57 ms 6248 KB Output is correct
17 Correct 231 ms 23916 KB Output is correct
18 Correct 246 ms 23920 KB Output is correct
19 Correct 226 ms 23996 KB Output is correct
20 Correct 230 ms 23892 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 261 ms 22032 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 224 ms 22008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 115 ms 14148 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 60 ms 5756 KB Output is correct
21 Correct 241 ms 22048 KB Output is correct
22 Correct 239 ms 22012 KB Output is correct
23 Correct 240 ms 22132 KB Output is correct
24 Correct 223 ms 21928 KB Output is correct
25 Correct 106 ms 12160 KB Output is correct
26 Correct 97 ms 12028 KB Output is correct
27 Correct 241 ms 22024 KB Output is correct
28 Correct 226 ms 21944 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1228 KB Output is correct
37 Correct 256 ms 24040 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1256 KB Output is correct
41 Correct 234 ms 23940 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 6 ms 964 KB Output is correct
45 Correct 115 ms 16120 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 57 ms 6248 KB Output is correct
50 Correct 230 ms 23928 KB Output is correct
51 Correct 228 ms 23900 KB Output is correct
52 Correct 246 ms 24112 KB Output is correct
53 Correct 96 ms 14056 KB Output is correct
54 Correct 115 ms 14060 KB Output is correct
55 Correct 226 ms 23924 KB Output is correct
56 Correct 239 ms 23940 KB Output is correct
57 Correct 118 ms 14148 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 972 KB Output is correct
61 Correct 125 ms 16760 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 59 ms 6260 KB Output is correct
66 Correct 102 ms 14188 KB Output is correct
67 Correct 120 ms 14052 KB Output is correct
68 Correct 99 ms 14060 KB Output is correct
69 Correct 95 ms 14020 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 261 ms 22032 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 224 ms 22008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 115 ms 14148 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 60 ms 5756 KB Output is correct
21 Correct 241 ms 22048 KB Output is correct
22 Correct 239 ms 22012 KB Output is correct
23 Correct 240 ms 22132 KB Output is correct
24 Correct 223 ms 21928 KB Output is correct
25 Correct 106 ms 12160 KB Output is correct
26 Correct 97 ms 12028 KB Output is correct
27 Correct 241 ms 22024 KB Output is correct
28 Correct 226 ms 21944 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1228 KB Output is correct
37 Correct 256 ms 24040 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1256 KB Output is correct
41 Correct 234 ms 23940 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 6 ms 964 KB Output is correct
45 Correct 115 ms 16120 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 57 ms 6248 KB Output is correct
50 Correct 230 ms 23928 KB Output is correct
51 Correct 228 ms 23900 KB Output is correct
52 Correct 246 ms 24112 KB Output is correct
53 Correct 96 ms 14056 KB Output is correct
54 Correct 115 ms 14060 KB Output is correct
55 Correct 226 ms 23924 KB Output is correct
56 Correct 239 ms 23940 KB Output is correct
57 Correct 118 ms 14148 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 57 ms 6240 KB Output is correct
62 Correct 233 ms 24132 KB Output is correct
63 Correct 276 ms 23924 KB Output is correct
64 Correct 244 ms 24072 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 57 ms 6208 KB Output is correct
67 Correct 236 ms 23920 KB Output is correct
68 Correct 227 ms 23988 KB Output is correct
69 Correct 239 ms 23980 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 284 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 57 ms 6248 KB Output is correct
74 Correct 231 ms 23916 KB Output is correct
75 Correct 246 ms 23920 KB Output is correct
76 Correct 226 ms 23996 KB Output is correct
77 Correct 230 ms 23892 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 5 ms 972 KB Output is correct
81 Correct 125 ms 16760 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 59 ms 6260 KB Output is correct
86 Correct 102 ms 14188 KB Output is correct
87 Correct 120 ms 14052 KB Output is correct
88 Correct 99 ms 14060 KB Output is correct
89 Correct 95 ms 14020 KB Output is correct
90 Correct 0 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 4 ms 588 KB Output is correct
93 Correct 98 ms 10012 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 23 ms 2668 KB Output is correct
98 Correct 93 ms 10104 KB Output is correct
99 Correct 94 ms 10096 KB Output is correct
100 Correct 96 ms 10052 KB Output is correct
101 Correct 92 ms 10028 KB Output is correct
102 Correct 92 ms 10052 KB Output is correct
103 Correct 96 ms 10096 KB Output is correct
104 Correct 95 ms 10088 KB Output is correct
105 Correct 133 ms 10100 KB Output is correct