oj.uz

Submission #302937

# Submission time Handle Problem Language Result Execution time Memory
302937 2020-09-19T13:17:12 Z nessie09 Connecting Supertrees (IOI20_supertrees) C++14
96 / 100
 276 ms 22348 KB 
#include "supertrees.h"
#include <vector>

using std::vector;

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();

    vector<int> group(n, -1);
    vector<int> component(n, -1);
    int max_comp = 0;
    int cur_comp = -1;
    int cur_group = -1;
    int max_group = 0;

    for (int i = 0; i < n; ++i) {
        if (group[i] == -1) {
            group[i] = max_group;
            max_group += 1;
        }
        if (component[i] == -1) {
            component[i] = max_comp;
            max_comp += 1;
        }
        cur_comp = component[i];
        cur_group = group[i];

        for (int j = 0; j < n; ++j) {
            if (p[i][j] != p[j][i] || (i == j && p[i][j] != 1)) {
                return 0;
            }
            if (i == j) {
                continue;
            }

            if (p[i][j] == 1) {
                // one path, same group
                if (group[j] == -1) {
                    group[j] = cur_group;
                }
                else if (group[j] != cur_group) {
                    return 0;
                }
            }
            else {
                // 0 or more paths, different group
                if (group[j] == cur_group) {
                    return 0;
                }
            }


            if (p[i][j] != 0) {
                // at least one path, same component
                if (component[j] == -1) {
                    component[j] = cur_comp;
                }
                else if (component[j] != cur_comp) {
                    return 0;
                }
            }
            else {
                // no path, different component
                if (component[j] == cur_comp) {
                    return 0;
                }
            }
        }
    }

    vector<int> first_of_group(max_group, -1);
    vector<int> group_component(max_group, -1);
    for (int i = 0; i < n; ++i) {
        if (first_of_group[group[i]] == -1) {
            first_of_group[group[i]] = i;
            //std::cerr << "first_of_group[" << group[i] << "] = " << i << std::endl;
        }
    }
    for (int i = 0; i < max_group; ++i) {
        group_component[i] = component[first_of_group[i]];
        //std::cerr << "group_component[" << i << "] = " << group_component[i] << std::endl;
    }


    std::vector<std::vector<int>> answer;
    for (int i = 0; i < n; i++) {
        std::vector<int> row(n, 0);
        answer.push_back(row);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            if (group[j] == group[i]) {
                answer[i][j] = 1;
                break;
            }
        }
        for (int j = i-1; j >= 0; --j) {
            if (group[j] == group[i]) {
                answer[i][j] = 1;
                break;
            }
        }
        if (first_of_group[group[i]] == i) {
            int mygroup = group[i];
            int mycomp = component[i];
            int next_group = -1;
            int prev_group = -1;
            int have_next = 0;
            for (int j = 1; j < max_group; ++j) {
                next_group = (mygroup + j) % max_group;

                if (group_component[next_group] == mycomp) {
                    have_next = 1;
                    answer[i][first_of_group[next_group]] = 1;
                    answer[first_of_group[next_group]][i] = 1;
                    break;
                }
            }
            for (int j = 1; j < max_group; ++j) {
                prev_group = (mygroup - j + max_group) % max_group;

                if (group_component[prev_group] == mycomp) {
                    answer[i][first_of_group[prev_group]] = 1;
                    answer[first_of_group[prev_group]][i] = 1;
                    break;
                }
            }
            if (have_next && next_group == prev_group) {
                return 0;
            }
        }
    }

    build(answer);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 265 ms 22172 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 116 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5752 KB Output is correct
21 Correct 249 ms 22136 KB Output is correct
22 Correct 253 ms 22348 KB Output is correct
23 Correct 265 ms 22108 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 114 ms 8312 KB Output is correct
26 Correct 113 ms 8184 KB Output is correct
27 Correct 262 ms 22220 KB Output is correct
28 Correct 260 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 262 ms 22136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 256 ms 22304 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 118 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 61 ms 5752 KB Output is correct
22 Correct 252 ms 22136 KB Output is correct
23 Correct 255 ms 22088 KB Output is correct
24 Correct 260 ms 22136 KB Output is correct
25 Correct 119 ms 12236 KB Output is correct
26 Correct 113 ms 8136 KB Output is correct
27 Correct 251 ms 22136 KB Output is correct
28 Correct 258 ms 22140 KB Output is correct
29 Correct 120 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 416 KB Output is correct
4 Correct 59 ms 5752 KB Output is correct
5 Correct 256 ms 22092 KB Output is correct
6 Correct 252 ms 22296 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 61 ms 5752 KB Output is correct
10 Correct 253 ms 22136 KB Output is correct
11 Correct 256 ms 22136 KB Output is correct
12 Correct 276 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 64 ms 5880 KB Output is correct
17 Correct 256 ms 22140 KB Output is correct
18 Correct 255 ms 22136 KB Output is correct
19 Correct 258 ms 22136 KB Output is correct
20 Correct 258 ms 22140 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 265 ms 22172 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 116 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5752 KB Output is correct
21 Correct 249 ms 22136 KB Output is correct
22 Correct 253 ms 22348 KB Output is correct
23 Correct 265 ms 22108 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 114 ms 8312 KB Output is correct
26 Correct 113 ms 8184 KB Output is correct
27 Correct 262 ms 22220 KB Output is correct
28 Correct 260 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 262 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 256 ms 22304 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 118 ms 8184 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5752 KB Output is correct
50 Correct 252 ms 22136 KB Output is correct
51 Correct 255 ms 22088 KB Output is correct
52 Correct 260 ms 22136 KB Output is correct
53 Correct 119 ms 12236 KB Output is correct
54 Correct 113 ms 8136 KB Output is correct
55 Correct 251 ms 22136 KB Output is correct
56 Correct 258 ms 22140 KB Output is correct
57 Correct 120 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 118 ms 8184 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 60 ms 5752 KB Output is correct
66 Correct 114 ms 8188 KB Output is correct
67 Correct 113 ms 8184 KB Output is correct
68 Correct 114 ms 8184 KB Output is correct
69 Correct 118 ms 12280 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 0 ms 256 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 265 ms 22172 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 116 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5752 KB Output is correct
21 Correct 249 ms 22136 KB Output is correct
22 Correct 253 ms 22348 KB Output is correct
23 Correct 265 ms 22108 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 114 ms 8312 KB Output is correct
26 Correct 113 ms 8184 KB Output is correct
27 Correct 262 ms 22220 KB Output is correct
28 Correct 260 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 262 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 256 ms 22304 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 118 ms 8184 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 61 ms 5752 KB Output is correct
50 Correct 252 ms 22136 KB Output is correct
51 Correct 255 ms 22088 KB Output is correct
52 Correct 260 ms 22136 KB Output is correct
53 Correct 119 ms 12236 KB Output is correct
54 Correct 113 ms 8136 KB Output is correct
55 Correct 251 ms 22136 KB Output is correct
56 Correct 258 ms 22140 KB Output is correct
57 Correct 120 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 0 ms 416 KB Output is correct
61 Correct 59 ms 5752 KB Output is correct
62 Correct 256 ms 22092 KB Output is correct
63 Correct 252 ms 22296 KB Output is correct
64 Correct 256 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 61 ms 5752 KB Output is correct
67 Correct 253 ms 22136 KB Output is correct
68 Correct 256 ms 22136 KB Output is correct
69 Correct 276 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 64 ms 5880 KB Output is correct
74 Correct 256 ms 22140 KB Output is correct
75 Correct 255 ms 22136 KB Output is correct
76 Correct 258 ms 22136 KB Output is correct
77 Correct 258 ms 22140 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 118 ms 8184 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 60 ms 5752 KB Output is correct
86 Correct 114 ms 8188 KB Output is correct
87 Correct 113 ms 8184 KB Output is correct
88 Correct 114 ms 8184 KB Output is correct
89 Correct 118 ms 12280 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 118 ms 8184 KB Output is correct
94 Incorrect 0 ms 256 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -