oj.uz

답안 #941489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941489 2024-03-09T02:10:25 Z Programmer123 Split the Attractions (IOI19_split) C++17
40 / 100
 1952 ms 21796 KB 
#ifndef LOCAL
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,sse4.2")
#endif

#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.95 * CLOCKS_PER_SEC) {
            if (Rand() % 2) {
                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;
                        }
                    }
                }
            } else {
                int num1, t1, num2, t2;
                do {
                    switch (Rand() % 3) {
                        case 0:
                            num1 = a;
                            t1 = 1;
                            break;
                        case 1:
                            num1 = b;
                            t1 = 2;
                            break;
                        case 2:
                            num1 = c;
                            t1 = 3;
                            break;
                    }
                    switch (Rand() % 3) {
                        case 0:
                            num2 = a;
                            t2 = 1;
                            break;
                        case 1:
                            num2 = b;
                            t2 = 2;
                            break;
                        case 2:
                            num2 = c;
                            t2 = 3;
                            break;
                    }
                } while (t1 == t2);
                int r1, r2;
                do {
                    r1 = Rand() % n;
                    r2 = Rand() % n;
                } while (r1 == r2);
                num1--;
                num2--;
                res[r1] = t1;
                res[r2] = t2;
                std::queue<int> q1, q2;
                q1.push(r1);
                q2.push(r2);
                while (true) {
                    if (num1 + num2 == 0) {
                        for (int i = 0; i < n; ++i) {
                            if (res[i] == 0) res[i] = 6 - t1 - t2;
                        }
                        return res;
                    }
                    if (num1 && q1.empty()) {
                        break;
                    }
                    if (num2 && q2.empty()) {
                        break;
                    }
                    if (num1 > num2) {
                        auto next = q1.front();
                        q1.pop();
                        for (auto x: connections[next]) {
                            if (!num1) break;
                            if (res[x] != 0) break;
                            res[x] = t1;
                            num1--;
                            q1.push(x);
                        }
                    } else {
                        auto next = q2.front();
                        q2.pop();
                        for (auto x: connections[next]) {
                            if (!num2) break;
                            if (res[x] != 0) break;
                            res[x] = t2;
                            num2--;
                            q2.push(x);
                        }
                    }
                }
                res = std::vector<int>(n);
            }
        }
    }
    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:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < p.size(); ++i) {
      |                     ~~^~~~~~~~~~
split.cpp:30:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |         while (order.size() < n) {
      |                ~~~~~~~~~~~~~^~~
split.cpp:72:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |     } else if (p.size() == n - 1) {
      |                ~~~~~~~~~^~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 344 KB ok, correct split
4 Correct 0 ms 432 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 39 ms 9232 KB ok, correct split
8 Correct 45 ms 9424 KB ok, correct split
9 Correct 40 ms 9036 KB ok, correct split
10 Correct 44 ms 9428 KB ok, correct split
11 Correct 40 ms 9172 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 1 ms 348 KB ok, correct split
4 Correct 47 ms 9812 KB ok, correct split
5 Correct 38 ms 8524 KB ok, correct split
6 Correct 39 ms 9172 KB ok, correct split
7 Correct 40 ms 9172 KB ok, correct split
8 Correct 65 ms 11348 KB ok, correct split
9 Correct 36 ms 8632 KB ok, correct split
10 Correct 33 ms 9160 KB ok, correct split
11 Correct 34 ms 9172 KB ok, correct split
12 Correct 43 ms 9196 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 66 ms 13396 KB ok, correct split
3 Correct 20 ms 5720 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 78 ms 20012 KB ok, correct split
6 Correct 78 ms 19636 KB ok, correct split
7 Correct 64 ms 19024 KB ok, correct split
8 Correct 90 ms 21796 KB ok, correct split
9 Correct 72 ms 18916 KB ok, correct split
10 Correct 20 ms 4920 KB ok, no valid answer
11 Correct 23 ms 7000 KB ok, no valid answer
12 Correct 41 ms 12748 KB ok, no valid answer
13 Correct 48 ms 13396 KB ok, no valid answer
14 Correct 37 ms 12864 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 1 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 344 KB ok, correct split
7 Correct 1 ms 348 KB ok, correct split
8 Correct 0 ms 348 KB ok, correct split
9 Correct 2 ms 604 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 0 ms 348 KB ok, correct split
14 Correct 1 ms 348 KB ok, correct split
15 Correct 0 ms 344 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 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 732 KB ok, correct split
22 Correct 2 ms 860 KB ok, correct split
23 Correct 2 ms 860 KB ok, correct split
24 Correct 2 ms 860 KB ok, correct split
25 Correct 1 ms 856 KB ok, correct split
26 Incorrect 1952 ms 856 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 348 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 344 KB ok, correct split
4 Correct 0 ms 432 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 39 ms 9232 KB ok, correct split
8 Correct 45 ms 9424 KB ok, correct split
9 Correct 40 ms 9036 KB ok, correct split
10 Correct 44 ms 9428 KB ok, correct split
11 Correct 40 ms 9172 KB ok, correct split
12 Correct 1 ms 348 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 1 ms 348 KB ok, correct split
15 Correct 47 ms 9812 KB ok, correct split
16 Correct 38 ms 8524 KB ok, correct split
17 Correct 39 ms 9172 KB ok, correct split
18 Correct 40 ms 9172 KB ok, correct split
19 Correct 65 ms 11348 KB ok, correct split
20 Correct 36 ms 8632 KB ok, correct split
21 Correct 33 ms 9160 KB ok, correct split
22 Correct 34 ms 9172 KB ok, correct split
23 Correct 43 ms 9196 KB ok, correct split
24 Correct 1 ms 348 KB ok, correct split
25 Correct 66 ms 13396 KB ok, correct split
26 Correct 20 ms 5720 KB ok, correct split
27 Correct 0 ms 348 KB ok, correct split
28 Correct 78 ms 20012 KB ok, correct split
29 Correct 78 ms 19636 KB ok, correct split
30 Correct 64 ms 19024 KB ok, correct split
31 Correct 90 ms 21796 KB ok, correct split
32 Correct 72 ms 18916 KB ok, correct split
33 Correct 20 ms 4920 KB ok, no valid answer
34 Correct 23 ms 7000 KB ok, no valid answer
35 Correct 41 ms 12748 KB ok, no valid answer
36 Correct 48 ms 13396 KB ok, no valid answer
37 Correct 37 ms 12864 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 1 ms 348 KB ok, correct split
41 Correct 1 ms 348 KB ok, correct split
42 Correct 1 ms 348 KB ok, correct split
43 Correct 0 ms 344 KB ok, correct split
44 Correct 1 ms 348 KB ok, correct split
45 Correct 0 ms 348 KB ok, correct split
46 Correct 2 ms 604 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 0 ms 348 KB ok, correct split
51 Correct 1 ms 348 KB ok, correct split
52 Correct 0 ms 344 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 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 732 KB ok, correct split
59 Correct 2 ms 860 KB ok, correct split
60 Correct 2 ms 860 KB ok, correct split
61 Correct 2 ms 860 KB ok, correct split
62 Correct 1 ms 856 KB ok, correct split
63 Incorrect 1952 ms 856 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -