oj.uz

Submission #320203

# Submission time Handle Problem Language Result Execution time Memory
320203 2020-11-07T23:13:14 Z VEGAnn Fun Tour (APIO20_fun) C++14
100 / 100
 349 ms 20444 KB 
#include "fun.h"
#include <bits/stdc++.h>
#define PB push_back
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define i2 array<int,2>
using namespace std;
const int oo = 2e9;
const int N = 100100;
vector<int> ans, chld;
vector<i2> elms[3];
int dst[N];

vector<int> createFunTour(int n, int Q) {
    if (n == 2) return {0, 1};

    int cen = -1, mn = oo, hlf = (n + 1) / 2;

    for (int i = 0; i < n; i++){
        int now = attractionsBehind(0, i);

        if (now < mn && now >= hlf){
            mn = now;
            cen = i;
        }
    }

    chld.clear();

    for (int i = 0; i < n; i++){
        if (i == cen) continue;

        int now = hoursRequired(cen, i);

        dst[i] = now;

        if (now == 1)
            chld.PB(i);
    }

    for (int i = 0; i < n; i++){
        if (i == cen) continue;

        int who = 0;

        for (int it = 1; it < sz(chld); it++){
            int now = hoursRequired(chld[it], i);

            if (now + 1 == dst[i]){
                who = it;
                break;
            }
        }

        elms[who].PB({dst[i], i});
    }

    for (int i = 0; i < sz(chld); i++){
        sort(all(elms[i]));
    }

    if (sz(elms[0]) < sz(elms[1])) swap(elms[0], elms[1]);
    if (sz(chld) == 3 && sz(elms[1]) < sz(elms[2])) swap(elms[1], elms[2]);
    if (sz(elms[0]) < sz(elms[1])) swap(elms[0], elms[1]);

    ans.clear();

    if (sz(chld) == 3 && sz(elms[0]) >= sz(elms[1]) + sz(elms[2])){
        chld.pop_back();

        for (i2 cr : elms[2])
            elms[1].PB(cr);

        sort(all(elms[1]));
    }

    if (sz(chld) == 3){
        int lst = -1;

        while (1){
            int bst = -1, id = -1;

            for (int it = 0; it < 3; it++){
                if (it == lst) continue;

                if (elms[it].back()[0] > bst){
                    bst = elms[it].back()[0];
                    id = it;
                }
            }

            ans.PB(elms[id].back()[1]);
            elms[id].pop_back();

            lst = id;

            if (sz(elms[0]) == sz(elms[1]) + sz(elms[2])) break;
            if (sz(elms[1]) == sz(elms[0]) + sz(elms[2])) break;
            if (sz(elms[2]) == sz(elms[0]) + sz(elms[1])) break;
        }

        int mx = -1, who = -1;

        for (int it = 0; it < 3; it++)
            if (sz(elms[it]) > mx){
                mx = sz(elms[it]);
                who = it;
            }

        int id = who;

        for (int it = 0; it < 3; it++){
            if (it == lst || sz(elms[it]) == 0 || it == who) continue;

            if (elms[it].back()[0] >= dst[ans.back()])
                id = it;
        }

        ans.PB(elms[id].back()[1]);
        elms[id].pop_back();

        swap(elms[0], elms[who]);

        for (i2 cr : elms[2])
            elms[1].PB(cr);

        sort(all(elms[1]));

        if (sz(elms[0]) < sz(elms[1])) swap(elms[1], elms[0]);

        while (sz(elms[1]) > 0){
            ans.PB(elms[0].back()[1]);
            ans.PB(elms[1].back()[1]);

            elms[0].pop_back();
            elms[1].pop_back();
        }

        if (sz(elms[0]) > 0)
            ans.PB(elms[0][0][1]);
    } else {
        while (sz(elms[1]) > 0){
            ans.PB(elms[0].back()[1]);
            ans.PB(elms[1].back()[1]);

            elms[0].pop_back();
            elms[1].pop_back();
        }

        if (sz(elms[0]) > 0)
            ans.PB(elms[0][0][1]);
    }

    ans.PB(cen);

    return ans;
}

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 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 364 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 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 364 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 492 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 492 KB Output is correct
32 Correct 1 ms 492 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 492 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 492 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 139 ms 15708 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 4 ms 748 KB Output is correct
22 Correct 8 ms 1260 KB Output is correct
23 Correct 14 ms 2284 KB Output is correct
24 Correct 19 ms 3052 KB Output is correct
25 Correct 80 ms 9212 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 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 10 ms 1772 KB Output is correct
15 Correct 156 ms 15452 KB Output is correct
16 Correct 148 ms 15456 KB Output is correct
17 Correct 26 ms 3820 KB Output is correct
18 Correct 65 ms 7212 KB Output is correct
19 Correct 117 ms 12084 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 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 364 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 492 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 492 KB Output is correct
32 Correct 1 ms 492 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 492 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 139 ms 15708 KB Output is correct
45 Correct 1 ms 492 KB Output is correct
46 Correct 3 ms 620 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 8 ms 1260 KB Output is correct
49 Correct 14 ms 2284 KB Output is correct
50 Correct 19 ms 3052 KB Output is correct
51 Correct 80 ms 9212 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 10 ms 1772 KB Output is correct
54 Correct 156 ms 15452 KB Output is correct
55 Correct 148 ms 15456 KB Output is correct
56 Correct 26 ms 3820 KB Output is correct
57 Correct 65 ms 7212 KB Output is correct
58 Correct 117 ms 12084 KB Output is correct
59 Correct 5 ms 876 KB Output is correct
60 Correct 190 ms 15580 KB Output is correct
61 Correct 231 ms 17884 KB Output is correct
62 Correct 198 ms 15452 KB Output is correct
63 Correct 228 ms 19420 KB Output is correct
64 Correct 224 ms 19212 KB Output is correct
65 Correct 225 ms 15592 KB Output is correct
66 Correct 280 ms 17884 KB Output is correct
67 Correct 253 ms 19204 KB Output is correct
68 Correct 254 ms 18908 KB Output is correct
69 Correct 345 ms 20192 KB Output is correct
70 Correct 205 ms 15836 KB Output is correct
71 Correct 230 ms 19796 KB Output is correct
72 Correct 254 ms 18012 KB Output is correct
73 Correct 258 ms 18780 KB Output is correct
74 Correct 349 ms 20444 KB Output is correct
75 Correct 207 ms 15836 KB Output is correct
76 Correct 223 ms 19420 KB Output is correct
77 Correct 237 ms 19420 KB Output is correct
78 Correct 237 ms 19240 KB Output is correct
79 Correct 298 ms 20188 KB Output is correct
80 Correct 304 ms 20444 KB Output is correct
81 Correct 207 ms 15448 KB Output is correct
82 Correct 228 ms 15840 KB Output is correct
83 Correct 240 ms 15464 KB Output is correct
84 Correct 84 ms 6716 KB Output is correct