oj.uz

Submission #561486

# Submission time Handle Problem Language Result Execution time Memory
561486 2022-05-12T23:57:27 Z nghiass001 Fun Tour (APIO20_fun) C++17
100 / 100
 235 ms 21448 KB 
#include "fun.h"
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
using namespace std;
const int maxN = 1e5 + 5;
int n, isans[maxN];
int depth[maxN], choice[maxN], sz[4];
vector<int> List[4];
vector<int> Ans;

vector<int> createFunTour(int n, int Q) {
    int u = 0, mini = n + 1;
    REP(i, 0, n) {
        int tmp = attractionsBehind(0, i);
        if (tmp >= (n + 1) / 2 && tmp < mini) u = i, mini = tmp;
    }

    vector<int> all_next;
    REP(i, 0, n) if (i != u) {
        depth[i] = hoursRequired(u, i);
        if (depth[i] == 1) {
            all_next.push_back(i);
            choice[i] = all_next.size();
        }
    }

    REP(j, 0, (int)all_next.size() - 1) {
        int node = all_next[j];
        choice[node] = j + 1;
        int tmp = sz[j + 1] = attractionsBehind(u, node);

        REP(i, 0, n) if (!choice[i] && i != u) {
            if (attractionsBehind(i, node) != tmp) choice[i] = j + 1;
        }
    }

    REP(i, 0, n) if (!choice[i]) ++sz[all_next.size()], choice[i] = all_next.size();

    {/// add root to smallest set
        int id = 1;
        FOR(i, 1, 3) if (sz[i] < sz[id]) id = i;
        choice[u] = id;
        ++sz[id];
    }

    REP(i, 0, n) {
        List[choice[i]].push_back(i);
    }
    FOR(i, 1, 3) {
        depth[n] = -1;
        List[i].push_back(n);
        sort(List[i].begin(), List[i].end(), [] (int x, int y) { return depth[x] < depth[y]; });
    }
    /// solve

    int type_now = 0;
    int pre_depth = 0;

    REP(step, 0, n) {
        int type_next = 0;
        if (sz[1] + sz[2] <= sz[3] && type_now != 3) {
            if (type_now == 0) type_next = 3;
            else if (pre_depth >= depth[List[type_now ^ 3].back()]) type_next = 3;
        }
        if (sz[1] + sz[3] <= sz[2] && type_now != 2) {
            if (type_now == 0) type_next = 2;
            else if (pre_depth >= depth[List[type_now ^ 2].back()]) type_next = 2;
        }
        if (sz[2] + sz[3] <= sz[1] && type_now != 1) {
            if (type_now == 0) type_next = 1;
            else if (pre_depth >= depth[List[type_now ^ 1].back()]) type_next = 1;
        }
        if (type_next == 0) {
            int len_max = -1;
            FOR(i, 1, 3) if (type_now != i && sz[i] && depth[List[i].back()] > len_max) {
                type_next = i;
                len_max = depth[List[i].back()];
            }
        }
        pre_depth = depth[List[type_next].back()];
        Ans.push_back(List[type_next].back());
        List[type_next].pop_back();
        --sz[type_next];
        type_now = type_next;
    }

    return Ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 125 ms 16688 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 4 ms 700 KB Output is correct
22 Correct 6 ms 1344 KB Output is correct
23 Correct 11 ms 2388 KB Output is correct
24 Correct 15 ms 3100 KB Output is correct
25 Correct 64 ms 9724 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 7 ms 1720 KB Output is correct
15 Correct 118 ms 16720 KB Output is correct
16 Correct 123 ms 16352 KB Output is correct
17 Correct 22 ms 4048 KB Output is correct
18 Correct 49 ms 7684 KB Output is correct
19 Correct 86 ms 12960 KB Output is correct
20 Correct 4 ms 852 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 308 KB Output is correct
37 Correct 1 ms 308 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 308 KB Output is correct
44 Correct 125 ms 16688 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 4 ms 700 KB Output is correct
48 Correct 6 ms 1344 KB Output is correct
49 Correct 11 ms 2388 KB Output is correct
50 Correct 15 ms 3100 KB Output is correct
51 Correct 64 ms 9724 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 7 ms 1720 KB Output is correct
54 Correct 118 ms 16720 KB Output is correct
55 Correct 123 ms 16352 KB Output is correct
56 Correct 22 ms 4048 KB Output is correct
57 Correct 49 ms 7684 KB Output is correct
58 Correct 86 ms 12960 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 138 ms 16812 KB Output is correct
61 Correct 163 ms 18980 KB Output is correct
62 Correct 155 ms 16704 KB Output is correct
63 Correct 168 ms 20736 KB Output is correct
64 Correct 174 ms 20508 KB Output is correct
65 Correct 178 ms 16580 KB Output is correct
66 Correct 192 ms 18892 KB Output is correct
67 Correct 163 ms 20620 KB Output is correct
68 Correct 185 ms 19712 KB Output is correct
69 Correct 235 ms 21180 KB Output is correct
70 Correct 153 ms 16580 KB Output is correct
71 Correct 161 ms 20412 KB Output is correct
72 Correct 158 ms 19136 KB Output is correct
73 Correct 156 ms 19776 KB Output is correct
74 Correct 217 ms 21324 KB Output is correct
75 Correct 156 ms 16636 KB Output is correct
76 Correct 181 ms 20472 KB Output is correct
77 Correct 229 ms 20612 KB Output is correct
78 Correct 152 ms 19760 KB Output is correct
79 Correct 192 ms 21216 KB Output is correct
80 Correct 199 ms 21448 KB Output is correct
81 Correct 170 ms 16708 KB Output is correct
82 Correct 158 ms 16564 KB Output is correct
83 Correct 151 ms 16796 KB Output is correct
84 Correct 54 ms 7080 KB Output is correct