oj.uz

Submission #367990

# Submission time Handle Problem Language Result Execution time Memory
367990 2021-02-19T08:09:54 Z KoD Fun Tour (APIO20_fun) C++17
100 / 100
 370 ms 21732 KB 
#include "fun.h"

#include <vector>
#include <algorithm>
#include <iostream>

template <class T>
using Vec = std::vector<T>;

Vec<int> createFunTour(int N, int Q) {
    // Step 1. find centroid (N-1 queries)
    int centroid = 0;
    Vec<int> subtree(N);
    subtree[0] = N;
    for (int i = 1; i < N; ++i) {
        subtree[i] = attractionsBehind(0, i);
        if (subtree[i] * 2 >= N && subtree[i] < subtree[centroid]) {
            centroid = i;
        }
    }
    // Step 2. compute distances from the centroid (N-1 queries)
    Vec<int> dist(N);
    for (int i = 0; i < N; ++i) {
        if (i != centroid) {
            dist[i] = hoursRequired(centroid, i);
        }
    }
    // Step 3. find direct children of the centroid (0 queries)
    Vec<int> children;
    for (int i = 0; i < N; ++i) {
        if (dist[i] == 1) {
            children.push_back(i);
        }
    }
    // Step 4. classify vertices (at most 2N-2 queries)
    Vec<int> belong(N, (int) children.size() - 1);
    for (int i = 0; i < (int) children.size() - 1; ++i) {
        const auto root = children[i];
        for (int u = 0; u < N; ++u) {
            if (u != centroid && dist[u] > hoursRequired(root, u)) {
                belong[u] = i;
            }
        }
    }
    // Step 5. construct a fun tour (0 queries)
    Vec<int> ret;
    ret.reserve(N);
    Vec<Vec<int>> vertices(children.size());
    for (int i = 0; i < N; ++i) {
        if (i != centroid) {
            vertices[belong[i]].push_back(i);
        }
    }
    for (auto &vec: vertices) {
        std::sort(vec.begin(), vec.end(), [&](const int i, const int j) {
            return dist[i] < dist[j];
        });
    }
    const auto farthest = [&](const int i) {
        return vertices[i].empty() ? -1 : dist[vertices[i].back()];
    };
    const auto select_max = [&](const int avoid) {
        int select = -1, score = -1;
        for (int i = 0; i < (int) children.size(); ++i) {
            if (i != avoid) {
                const auto tmp = farthest(i);
                if (score < tmp) {
                    select = i;
                    score = tmp;
                }
            }
        }
        return select;
    };
    int pivot = -1, last = -1, remain = N;
    while (true) {
        for (int i = 0; i < (int) children.size(); ++i) {
            if (2 * ((int) vertices[i].size()) == remain) {
                pivot = i;
            }
        }
        if (pivot != -1) {
            break;
        }
        const auto select = select_max(last);
        ret.push_back(vertices[select].back());
        vertices[select].pop_back();
        last = select;
        remain -= 1;
    }
    if (ret.size() >= 2) {
        const auto u = ret[ret.size() - 1];
        const auto v = ret[ret.size() - 2];
        if (belong[v] != pivot && dist[v] > dist[u]) {
            ret.pop_back();
            vertices[belong[u]].push_back(u);
        }
    }
    while (true) {
        if (vertices[pivot].empty()) {
            break;
        }
        ret.push_back(vertices[pivot].back());
        vertices[pivot].pop_back();
        const auto select = select_max(pivot);
        if (select == -1) {
            break;
        }
        ret.push_back(vertices[select].back());
        vertices[select].pop_back();
    }
    ret.push_back(centroid);
    return ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 142 ms 16652 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 2 ms 620 KB Output is correct
21 Correct 4 ms 748 KB Output is correct
22 Correct 7 ms 1260 KB Output is correct
23 Correct 14 ms 2412 KB Output is correct
24 Correct 18 ms 3052 KB Output is correct
25 Correct 82 ms 9732 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 11 ms 1792 KB Output is correct
15 Correct 161 ms 16740 KB Output is correct
16 Correct 156 ms 16488 KB Output is correct
17 Correct 27 ms 4076 KB Output is correct
18 Correct 67 ms 7732 KB Output is correct
19 Correct 123 ms 12860 KB Output is correct
20 Correct 5 ms 876 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 142 ms 16652 KB Output is correct
45 Correct 1 ms 496 KB Output is correct
46 Correct 2 ms 620 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 7 ms 1260 KB Output is correct
49 Correct 14 ms 2412 KB Output is correct
50 Correct 18 ms 3052 KB Output is correct
51 Correct 82 ms 9732 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 11 ms 1792 KB Output is correct
54 Correct 161 ms 16740 KB Output is correct
55 Correct 156 ms 16488 KB Output is correct
56 Correct 27 ms 4076 KB Output is correct
57 Correct 67 ms 7732 KB Output is correct
58 Correct 123 ms 12860 KB Output is correct
59 Correct 5 ms 876 KB Output is correct
60 Correct 185 ms 16868 KB Output is correct
61 Correct 216 ms 19172 KB Output is correct
62 Correct 186 ms 16868 KB Output is correct
63 Correct 218 ms 20580 KB Output is correct
64 Correct 205 ms 20580 KB Output is correct
65 Correct 244 ms 16612 KB Output is correct
66 Correct 275 ms 18916 KB Output is correct
67 Correct 254 ms 20972 KB Output is correct
68 Correct 248 ms 19812 KB Output is correct
69 Correct 354 ms 21476 KB Output is correct
70 Correct 192 ms 16612 KB Output is correct
71 Correct 241 ms 20564 KB Output is correct
72 Correct 261 ms 19172 KB Output is correct
73 Correct 268 ms 19788 KB Output is correct
74 Correct 370 ms 21604 KB Output is correct
75 Correct 210 ms 16612 KB Output is correct
76 Correct 210 ms 20580 KB Output is correct
77 Correct 268 ms 20580 KB Output is correct
78 Correct 245 ms 19812 KB Output is correct
79 Correct 280 ms 21348 KB Output is correct
80 Correct 302 ms 21732 KB Output is correct
81 Correct 198 ms 16612 KB Output is correct
82 Correct 210 ms 16612 KB Output is correct
83 Correct 228 ms 16996 KB Output is correct
84 Correct 80 ms 7236 KB Output is correct