oj.uz

답안 #941437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941437 2024-03-09T00:20:21 Z Programmer123 Split the Attractions (IOI19_split) C++17
40 / 100
 83 ms 19744 KB 
#include "split.h"
#include <bits/stdc++.h>

std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q) {
    std::vector<int> res(n);
    std::vector<int> connections[n];
    for (int i = 0; i < p.size(); ++i) {
        connections[p[i]].push_back(q[i]);
        connections[q[i]].push_back(p[i]);
    }
    bool s1 = true;
    for (int i = 0; i < n; ++i) {
        if (connections[i].size() > 2) s1 = false;
    }
    if (s1) {
        int start = 0;
        for (int i = 0; i < n; ++i) {
            if (connections[i].size() == 1) {
                start = i;
                break;
            }
        }
        std::vector<int> order;
        while (order.size() < n) {
            order.push_back(start);
            int next = connections[start][0];
            if (connections[next].size() == 2 && connections[next][0] == start) {
                std::swap(connections[next][0], connections[next][1]);
            }
            start = next;
        }
        for (int i = 0; i < a; ++i) {
            res[order[i]] = 1;
        }
        for (int i = a; i < a + b; ++i) {
            res[order[i]] = 2;
        }
        for (int i = a + b; i < n; ++i) {
            res[order[i]] = 3;
        }
    } else if (a == 1) {
        std::queue<int> bfs;
        bfs.push(0);
        res[0] = 2;
        int rem = b - 1;
        while (!bfs.empty()) {
            auto next = bfs.front();
            bfs.pop();
            for (auto x: connections[next]) {
                if (!rem) break;
                if (res[x]) continue;
                res[x] = 2;
                bfs.push(x);
                rem--;
            }
        }
        for (int i = 0; i < n; ++i) {
            if (res[i] == 0) {
                res[i] = 1;
                break;
            }
        }
        for (int i = 0; i < n; ++i) {
            if (res[i] == 0) res[i] = 3;
        }
    } else if (p.size() == n - 1) {
        int size[n];
        int parent[n];
        std::vector<int> children[n];
        std::function<int(int, int)> dfs = [&](int node, int from) {
            parent[node] = from;
            int res = 1;
            for (auto x: connections[node]) {
                if (x == from) continue;
                children[node].push_back(x);
                res += dfs(x, node);
            }
            return size[node] = res;
        };
        dfs(0, 0);
        std::function<int(int, int, int)> fill = [&](int node, int num, int type) {
            if (num == 0) return 0;
            num--;
            res[node] = type;
            for (auto x: children[node]) {
                num = fill(x, num, type);
            }
            return num;
        };
        std::function<void(int, int, int)> expand = [&](int node, int num, int type) {
            std::queue<int> bfs;
            bfs.push(node);
            res[node] = type;
            int rem = num - 1;
            while (!bfs.empty()) {
                auto next = bfs.front();
                bfs.pop();
                for (auto x: connections[next]) {
                    if (!rem) break;
                    if (res[x]) continue;
                    res[x] = type;
                    bfs.push(x);
                    rem--;
                }
            }
        };
        std::function<void(int)> fix = [&](int type) {
            for (int i = 0; i < n; ++i) {
                if (res[i] == 0) res[i] = type;
            }
        };
        for (int i = 0; i < n; ++i) {
            int s = size[i];
            int so = n - size[i];
            if (s >= a) {
                if (so >= b) {
                    fill(i, a, 1);
                    expand(parent[i], b, 2);
                    fix(3);
                    return res;
                }
                if (so > c) {
                    fill(i, a, 1);
                    expand(parent[i], c, 3);
                    fix(2);
                    return res;
                }
            }
            if (s >= b) {
                if (so >= a) {
                    fill(i, b, 2);
                    expand(parent[i], a, 1);
                    fix(3);
                    return res;
                }
                if (so > c) {
                    fill(i, b, 2);
                    expand(parent[i], c, 3);
                    fix(1);
                    return res;
                }
            }
            if (s >= c) {
                if (so >= b) {
                    fill(i, c, 3);
                    expand(parent[i], b, 2);
                    fix(1);
                    return res;
                }
                if (so > a) {
                    fill(i, c, 3);
                    expand(parent[i], a, 1);
                    fix(2);
                    return res;
                }
            }
        }
    } else {
        for (int root = 0; root < n; ++root) {
            int size[n];
            int parent[n];
            std::vector<int> children[n];
            bool seen[n];
            for (int i = 0; i < n; ++i) {
                seen[i] = false;
            }
            std::function<int(int, int)> dfs = [&](int node, int from) {
                seen[node] = true;
                parent[node] = from;
                int res = 1;
                for (auto x: connections[node]) {
                    if (seen[x]) continue;
                    children[node].push_back(x);
                    res += dfs(x, node);
                }
                return size[node] = res;
            };
            dfs(root, root);
            std::function<int(int, int, int)> fill = [&](int node, int num, int type) {
                if (num == 0) return 0;
                num--;
                res[node] = type;
                for (auto x: children[node]) {
                    num = fill(x, num, type);
                }
                return num;
            };
            std::function<void(int, int, int)> expand = [&](int node, int num, int type) {
                std::queue<int> bfs;
                bfs.push(node);
                res[node] = type;
                int rem = num - 1;
                while (!bfs.empty()) {
                    auto next = bfs.front();
                    bfs.pop();
                    for (auto x: connections[next]) {
                        if (!rem) break;
                        if (res[x]) continue;
                        res[x] = type;
                        bfs.push(x);
                        rem--;
                    }
                }
            };
            std::function<void(int)> fix = [&](int type) {
                for (int i = 0; i < n; ++i) {
                    if (res[i] == 0) res[i] = type;
                }
            };
            for (int i = 0; i < n; ++i) {
                int s = size[i];
                int so = n - size[i];
                if (s >= a) {
                    if (so >= b) {
                        fill(i, a, 1);
                        expand(parent[i], b, 2);
                        fix(3);
                        return res;
                    }
                    if (so > c) {
                        fill(i, a, 1);
                        expand(parent[i], c, 3);
                        fix(2);
                        return res;
                    }
                }
                if (s >= b) {
                    if (so >= a) {
                        fill(i, b, 2);
                        expand(parent[i], a, 1);
                        fix(3);
                        return res;
                    }
                    if (so > c) {
                        fill(i, b, 2);
                        expand(parent[i], c, 3);
                        fix(1);
                        return res;
                    }
                }
                if (s >= c) {
                    if (so >= b) {
                        fill(i, c, 3);
                        expand(parent[i], b, 2);
                        fix(1);
                        return res;
                    }
                    if (so > a) {
                        fill(i, c, 3);
                        expand(parent[i], a, 1);
                        fix(2);
                        return res;
                    }
                }
            }
        }
    }
    return res;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:7:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for (int i = 0; i < p.size(); ++i) {
      |                     ~~^~~~~~~~~~
split.cpp:24:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         while (order.size() < n) {
      |                ~~~~~~~~~~~~~^~~
split.cpp:66:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   66 |     } else if (p.size() == n - 1) {
      |                ~~~~~~~~~^~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 38 ms 8416 KB ok, correct split
8 Correct 43 ms 8416 KB ok, correct split
9 Correct 39 ms 8404 KB ok, correct split
10 Correct 39 ms 8412 KB ok, correct split
11 Correct 40 ms 8416 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 45 ms 8864 KB ok, correct split
5 Correct 44 ms 7760 KB ok, correct split
6 Correct 39 ms 8668 KB ok, correct split
7 Correct 40 ms 8412 KB ok, correct split
8 Correct 56 ms 10068 KB ok, correct split
9 Correct 36 ms 7668 KB ok, correct split
10 Correct 33 ms 8400 KB ok, correct split
11 Correct 32 ms 8256 KB ok, correct split
12 Correct 33 ms 8404 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 51 ms 12648 KB ok, correct split
3 Correct 21 ms 5464 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 71 ms 18548 KB ok, correct split
6 Correct 54 ms 17752 KB ok, correct split
7 Correct 61 ms 17584 KB ok, correct split
8 Correct 80 ms 19744 KB ok, correct split
9 Correct 56 ms 17088 KB ok, correct split
10 Correct 18 ms 4444 KB ok, no valid answer
11 Correct 23 ms 6488 KB ok, no valid answer
12 Correct 40 ms 11992 KB ok, no valid answer
13 Correct 46 ms 12624 KB ok, no valid answer
14 Correct 36 ms 11976 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, no valid answer
3 Correct 0 ms 348 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 1 ms 348 KB ok, correct split
7 Correct 0 ms 344 KB ok, correct split
8 Correct 1 ms 544 KB ok, correct split
9 Correct 2 ms 856 KB ok, correct split
10 Correct 2 ms 604 KB ok, correct split
11 Correct 1 ms 348 KB ok, correct split
12 Correct 2 ms 860 KB ok, correct split
13 Correct 1 ms 436 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 1 ms 348 KB ok, correct split
16 Correct 1 ms 344 KB ok, correct split
17 Correct 0 ms 348 KB ok, correct split
18 Correct 0 ms 348 KB ok, correct split
19 Correct 1 ms 348 KB ok, correct split
20 Correct 1 ms 604 KB ok, correct split
21 Correct 2 ms 860 KB ok, correct split
22 Correct 1 ms 860 KB ok, correct split
23 Correct 2 ms 704 KB ok, correct split
24 Correct 3 ms 732 KB ok, correct split
25 Correct 2 ms 860 KB ok, correct split
26 Incorrect 83 ms 796 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 38 ms 8416 KB ok, correct split
8 Correct 43 ms 8416 KB ok, correct split
9 Correct 39 ms 8404 KB ok, correct split
10 Correct 39 ms 8412 KB ok, correct split
11 Correct 40 ms 8416 KB ok, correct split
12 Correct 1 ms 344 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 45 ms 8864 KB ok, correct split
16 Correct 44 ms 7760 KB ok, correct split
17 Correct 39 ms 8668 KB ok, correct split
18 Correct 40 ms 8412 KB ok, correct split
19 Correct 56 ms 10068 KB ok, correct split
20 Correct 36 ms 7668 KB ok, correct split
21 Correct 33 ms 8400 KB ok, correct split
22 Correct 32 ms 8256 KB ok, correct split
23 Correct 33 ms 8404 KB ok, correct split
24 Correct 0 ms 348 KB ok, correct split
25 Correct 51 ms 12648 KB ok, correct split
26 Correct 21 ms 5464 KB ok, correct split
27 Correct 0 ms 348 KB ok, correct split
28 Correct 71 ms 18548 KB ok, correct split
29 Correct 54 ms 17752 KB ok, correct split
30 Correct 61 ms 17584 KB ok, correct split
31 Correct 80 ms 19744 KB ok, correct split
32 Correct 56 ms 17088 KB ok, correct split
33 Correct 18 ms 4444 KB ok, no valid answer
34 Correct 23 ms 6488 KB ok, no valid answer
35 Correct 40 ms 11992 KB ok, no valid answer
36 Correct 46 ms 12624 KB ok, no valid answer
37 Correct 36 ms 11976 KB ok, no valid answer
38 Correct 1 ms 348 KB ok, correct split
39 Correct 0 ms 348 KB ok, no valid answer
40 Correct 0 ms 348 KB ok, correct split
41 Correct 1 ms 348 KB ok, correct split
42 Correct 0 ms 348 KB ok, correct split
43 Correct 1 ms 348 KB ok, correct split
44 Correct 0 ms 344 KB ok, correct split
45 Correct 1 ms 544 KB ok, correct split
46 Correct 2 ms 856 KB ok, correct split
47 Correct 2 ms 604 KB ok, correct split
48 Correct 1 ms 348 KB ok, correct split
49 Correct 2 ms 860 KB ok, correct split
50 Correct 1 ms 436 KB ok, correct split
51 Correct 0 ms 348 KB ok, correct split
52 Correct 1 ms 348 KB ok, correct split
53 Correct 1 ms 344 KB ok, correct split
54 Correct 0 ms 348 KB ok, correct split
55 Correct 0 ms 348 KB ok, correct split
56 Correct 1 ms 348 KB ok, correct split
57 Correct 1 ms 604 KB ok, correct split
58 Correct 2 ms 860 KB ok, correct split
59 Correct 1 ms 860 KB ok, correct split
60 Correct 2 ms 704 KB ok, correct split
61 Correct 3 ms 732 KB ok, correct split
62 Correct 2 ms 860 KB ok, correct split
63 Incorrect 83 ms 796 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -