oj.uz

답안 #941457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941457 2024-03-09T01:07:50 Z Programmer123 Split the Attractions (IOI19_split) C++17
40 / 100
 1902 ms 19536 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) {
    auto start_t = clock();
    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 {
        std::mt19937 Rand(std::random_device{}());
        std::uniform_int_distribution dist(0, n - 1);
        while (clock() - start_t <= 1.9 * CLOCKS_PER_SEC) {
            int root = dist(Rand);
            for (int i = 0; i < n; ++i) {
                std::shuffle(connections[i].begin(), connections[i].end(), std::default_random_engine(Rand()));
            }
            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<void(int)> Root = [&](int node) {
                parent[node] = node;
                seen[node] = true;
                if (Rand() % 2) {
                    std::queue<int> queue;
                    queue.push(node);
                    while (!queue.empty()) {
                        auto next = queue.front();
                        queue.pop();
                        for (auto x: connections[next]) {
                            if (seen[x]) continue;
                            seen[x] = true;
                            parent[x] = next;
                            children[next].push_back(x);
                            queue.push(x);
                        }
                    }
                } else {
                    std::stack<int> queue;
                    queue.push(node);
                    while (!queue.empty()) {
                        auto next = queue.top();
                        queue.pop();
                        for (auto x: connections[next]) {
                            if (seen[x]) continue;
                            seen[x] = true;
                            parent[x] = next;
                            children[next].push_back(x);
                            queue.push(x);
                        }
                    }
                }
//                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;
            };
            std::function<int(int, int)> oldroot = [&](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 += oldroot(x, node);
                }
                return size[node] = res;
            };
            std::function<int(int)> dfs = [&](int node) {
                int s = 1;
                for (auto x: children[node]) {
                    s += dfs(x);
                }
                return size[node] = s;
            };
            if (Rand() % 2) {
                Root(root);
                dfs(root);
            } else {
                oldroot(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:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < p.size(); ++i) {
      |                     ~~^~~~~~~~~~
split.cpp:25:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |         while (order.size() < n) {
      |                ~~~~~~~~~~~~~^~~
split.cpp:67:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 |     } 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 0 ms 600 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 1 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 39 ms 8404 KB ok, correct split
9 Correct 38 ms 8404 KB ok, correct split
10 Correct 54 ms 8512 KB ok, correct split
11 Correct 52 ms 8516 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 544 KB ok, correct split
4 Correct 47 ms 8868 KB ok, correct split
5 Correct 39 ms 7760 KB ok, correct split
6 Correct 38 ms 8416 KB ok, correct split
7 Correct 39 ms 8532 KB ok, correct split
8 Correct 57 ms 10068 KB ok, correct split
9 Correct 36 ms 7764 KB ok, correct split
10 Correct 43 ms 8396 KB ok, correct split
11 Correct 42 ms 8392 KB ok, correct split
12 Correct 31 ms 8404 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB ok, correct split
2 Correct 59 ms 12524 KB ok, correct split
3 Correct 24 ms 5224 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 56 ms 18192 KB ok, correct split
6 Correct 55 ms 17748 KB ok, correct split
7 Correct 54 ms 17492 KB ok, correct split
8 Correct 68 ms 19536 KB ok, correct split
9 Correct 66 ms 17260 KB ok, correct split
10 Correct 15 ms 4440 KB ok, no valid answer
11 Correct 22 ms 6492 KB ok, no valid answer
12 Correct 39 ms 11984 KB ok, no valid answer
13 Correct 48 ms 12628 KB ok, no valid answer
14 Correct 35 ms 12100 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 1 ms 348 KB ok, no valid answer
3 Correct 0 ms 600 KB ok, correct split
4 Correct 0 ms 344 KB ok, correct split
5 Correct 0 ms 344 KB ok, correct split
6 Correct 1 ms 348 KB ok, correct split
7 Correct 0 ms 348 KB ok, correct split
8 Correct 1 ms 348 KB ok, correct split
9 Correct 3 ms 860 KB ok, correct split
10 Correct 2 ms 604 KB ok, correct split
11 Correct 0 ms 348 KB ok, correct split
12 Correct 2 ms 604 KB ok, correct split
13 Correct 1 ms 348 KB ok, correct split
14 Correct 1 ms 348 KB ok, correct split
15 Correct 0 ms 348 KB ok, correct split
16 Correct 0 ms 348 KB ok, correct split
17 Correct 0 ms 348 KB ok, correct split
18 Correct 0 ms 344 KB ok, correct split
19 Correct 1 ms 344 KB ok, correct split
20 Correct 1 ms 604 KB ok, correct split
21 Correct 1 ms 860 KB ok, correct split
22 Correct 2 ms 860 KB ok, correct split
23 Correct 2 ms 856 KB ok, correct split
24 Correct 2 ms 860 KB ok, correct split
25 Correct 2 ms 860 KB ok, correct split
26 Incorrect 1902 ms 772 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 0 ms 600 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 1 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 39 ms 8404 KB ok, correct split
9 Correct 38 ms 8404 KB ok, correct split
10 Correct 54 ms 8512 KB ok, correct split
11 Correct 52 ms 8516 KB ok, correct split
12 Correct 0 ms 344 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 544 KB ok, correct split
15 Correct 47 ms 8868 KB ok, correct split
16 Correct 39 ms 7760 KB ok, correct split
17 Correct 38 ms 8416 KB ok, correct split
18 Correct 39 ms 8532 KB ok, correct split
19 Correct 57 ms 10068 KB ok, correct split
20 Correct 36 ms 7764 KB ok, correct split
21 Correct 43 ms 8396 KB ok, correct split
22 Correct 42 ms 8392 KB ok, correct split
23 Correct 31 ms 8404 KB ok, correct split
24 Correct 1 ms 344 KB ok, correct split
25 Correct 59 ms 12524 KB ok, correct split
26 Correct 24 ms 5224 KB ok, correct split
27 Correct 0 ms 348 KB ok, correct split
28 Correct 56 ms 18192 KB ok, correct split
29 Correct 55 ms 17748 KB ok, correct split
30 Correct 54 ms 17492 KB ok, correct split
31 Correct 68 ms 19536 KB ok, correct split
32 Correct 66 ms 17260 KB ok, correct split
33 Correct 15 ms 4440 KB ok, no valid answer
34 Correct 22 ms 6492 KB ok, no valid answer
35 Correct 39 ms 11984 KB ok, no valid answer
36 Correct 48 ms 12628 KB ok, no valid answer
37 Correct 35 ms 12100 KB ok, no valid answer
38 Correct 1 ms 348 KB ok, correct split
39 Correct 1 ms 348 KB ok, no valid answer
40 Correct 0 ms 600 KB ok, correct split
41 Correct 0 ms 344 KB ok, correct split
42 Correct 0 ms 344 KB ok, correct split
43 Correct 1 ms 348 KB ok, correct split
44 Correct 0 ms 348 KB ok, correct split
45 Correct 1 ms 348 KB ok, correct split
46 Correct 3 ms 860 KB ok, correct split
47 Correct 2 ms 604 KB ok, correct split
48 Correct 0 ms 348 KB ok, correct split
49 Correct 2 ms 604 KB ok, correct split
50 Correct 1 ms 348 KB ok, correct split
51 Correct 1 ms 348 KB ok, correct split
52 Correct 0 ms 348 KB ok, correct split
53 Correct 0 ms 348 KB ok, correct split
54 Correct 0 ms 348 KB ok, correct split
55 Correct 0 ms 344 KB ok, correct split
56 Correct 1 ms 344 KB ok, correct split
57 Correct 1 ms 604 KB ok, correct split
58 Correct 1 ms 860 KB ok, correct split
59 Correct 2 ms 860 KB ok, correct split
60 Correct 2 ms 856 KB ok, correct split
61 Correct 2 ms 860 KB ok, correct split
62 Correct 2 ms 860 KB ok, correct split
63 Incorrect 1902 ms 772 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -