oj.uz

Submission #300160

# Submission time Handle Problem Language Result Execution time Memory
300160 2020-09-16T22:00:12 Z model_code Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 314 ms 22264 KB 
// limli-construct
#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 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1244 KB Output is correct
7 Correct 259 ms 22116 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1244 KB Output is correct
7 Correct 259 ms 22116 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 123 ms 14200 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 247 ms 22228 KB Output is correct
22 Correct 265 ms 22240 KB Output is correct
23 Correct 258 ms 22128 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 132 ms 12280 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 280 ms 22128 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 247 ms 22088 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1276 KB Output is correct
13 Correct 265 ms 22124 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 132 ms 14200 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 62 ms 5752 KB Output is correct
22 Correct 246 ms 22096 KB Output is correct
23 Correct 310 ms 22080 KB Output is correct
24 Correct 254 ms 22156 KB Output is correct
25 Correct 101 ms 12152 KB Output is correct
26 Correct 115 ms 12280 KB Output is correct
27 Correct 240 ms 22264 KB Output is correct
28 Correct 278 ms 22128 KB Output is correct
29 Correct 102 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 74 ms 5788 KB Output is correct
5 Correct 255 ms 22112 KB Output is correct
6 Correct 262 ms 22092 KB Output is correct
7 Correct 257 ms 22136 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 62 ms 5752 KB Output is correct
10 Correct 250 ms 22136 KB Output is correct
11 Correct 255 ms 22112 KB Output is correct
12 Correct 314 ms 22132 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 61 ms 5752 KB Output is correct
17 Correct 259 ms 22264 KB Output is correct
18 Correct 245 ms 22136 KB Output is correct
19 Correct 261 ms 22104 KB Output is correct
20 Correct 250 ms 22104 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1244 KB Output is correct
7 Correct 259 ms 22116 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 123 ms 14200 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 247 ms 22228 KB Output is correct
22 Correct 265 ms 22240 KB Output is correct
23 Correct 258 ms 22128 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 132 ms 12280 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 280 ms 22128 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 247 ms 22088 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1276 KB Output is correct
41 Correct 265 ms 22124 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 132 ms 14200 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 62 ms 5752 KB Output is correct
50 Correct 246 ms 22096 KB Output is correct
51 Correct 310 ms 22080 KB Output is correct
52 Correct 254 ms 22156 KB Output is correct
53 Correct 101 ms 12152 KB Output is correct
54 Correct 115 ms 12280 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 278 ms 22128 KB Output is correct
57 Correct 102 ms 12280 KB Output is correct
58 Correct 1 ms 288 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 129 ms 14840 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 65 ms 5752 KB Output is correct
66 Correct 112 ms 12280 KB Output is correct
67 Correct 112 ms 12280 KB Output is correct
68 Correct 112 ms 12152 KB Output is correct
69 Correct 103 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1244 KB Output is correct
7 Correct 259 ms 22116 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 123 ms 14200 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 247 ms 22228 KB Output is correct
22 Correct 265 ms 22240 KB Output is correct
23 Correct 258 ms 22128 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 132 ms 12280 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 280 ms 22128 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 247 ms 22088 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1276 KB Output is correct
41 Correct 265 ms 22124 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 132 ms 14200 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 62 ms 5752 KB Output is correct
50 Correct 246 ms 22096 KB Output is correct
51 Correct 310 ms 22080 KB Output is correct
52 Correct 254 ms 22156 KB Output is correct
53 Correct 101 ms 12152 KB Output is correct
54 Correct 115 ms 12280 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 278 ms 22128 KB Output is correct
57 Correct 102 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 74 ms 5788 KB Output is correct
62 Correct 255 ms 22112 KB Output is correct
63 Correct 262 ms 22092 KB Output is correct
64 Correct 257 ms 22136 KB Output is correct
65 Correct 1 ms 416 KB Output is correct
66 Correct 62 ms 5752 KB Output is correct
67 Correct 250 ms 22136 KB Output is correct
68 Correct 255 ms 22112 KB Output is correct
69 Correct 314 ms 22132 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 61 ms 5752 KB Output is correct
74 Correct 259 ms 22264 KB Output is correct
75 Correct 245 ms 22136 KB Output is correct
76 Correct 261 ms 22104 KB Output is correct
77 Correct 250 ms 22104 KB Output is correct
78 Correct 1 ms 288 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 11 ms 896 KB Output is correct
81 Correct 129 ms 14840 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 65 ms 5752 KB Output is correct
86 Correct 112 ms 12280 KB Output is correct
87 Correct 112 ms 12280 KB Output is correct
88 Correct 112 ms 12152 KB Output is correct
89 Correct 103 ms 12280 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 109 ms 8152 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 416 KB Output is correct
97 Correct 25 ms 2296 KB Output is correct
98 Correct 98 ms 8152 KB Output is correct
99 Correct 110 ms 8288 KB Output is correct
100 Correct 100 ms 8184 KB Output is correct
101 Correct 96 ms 8184 KB Output is correct
102 Correct 111 ms 8148 KB Output is correct
103 Correct 122 ms 8184 KB Output is correct
104 Correct 109 ms 8152 KB Output is correct
105 Correct 108 ms 8184 KB Output is correct