oj.uz

Submission #290723

# Submission time Handle Problem Language Result Execution time Memory
290723 2020-09-04T11:10:05 Z Kastanda Fun Tour (APIO20_fun) C++11
100 / 100
 518 ms 50800 KB 
// M
#include<bits/stdc++.h>
#include "fun.h"
using namespace std;
const int N = 100005;
int n, Centroid, H[N], B[N];
map < int , int > MP[N];
inline int GetDist(int i, int j)
{
        if (i == j)
                return 0;
        if (MP[i][j])
                return MP[i][j];
        MP[i][j] = MP[j][i] = hoursRequired(i, j);
        return MP[i][j];
}

vector < int > createFunTour(int _n, int Q)
{
        n = _n;
        Centroid = 0;
        for (int i = 1; i < n; i ++)
                if (attractionsBehind(Centroid, i) * 2 > n)
                        Centroid = i;

        vector < int > Ch, vec[3];
        for (int i = 0; i < n; i ++)
                H[i] = GetDist(Centroid, i);
        for (int i = 0; i < n; i ++)
                if (H[i] == 1)
                        Ch.push_back(i);
        assert((int)Ch.size() <= 3);
        int k = (int)Ch.size();
        for (int i = 0; i < n; i ++)
                if (H[i] >= 1)
                {
                        int j = 0;
                        while (j + 1 < k && H[i] != GetDist(Ch[j], i) + 1)
                                j ++;
                        vec[j].push_back(i);
                }
        for (int i = 0; i < k; i ++)
                sort(vec[i].begin(), vec[i].end(), [&](int v, int u){return H[v] < H[u];});

        B[Centroid] = -1;
        for (int i = 0; i < k; i ++)
                for (int v : vec[i])
                        B[v] = i;

        int last = -1;
        vector < int > P;
        while (true)
        {
                int mx = 0;
                for (int i = 0; i < k; i ++)
                        mx = max(mx, (int)vec[i].size());
                int sm = 0;
                for (int i = 0; i < k; i ++)
                        sm += (int)vec[i].size();
                if (!sm)
                        break;
                if (mx >= sm - mx)
                {
                        int j = -1;
                        assert(mx <= sm - mx + 1);
                        for (int i = 0; i < k; i ++)
                                if ((int)vec[i].size() == mx)
                                        j = i;
                        assert(j != last && j != -1);
                        vec[0].swap(vec[j]);
                        vector < int > tmp;
                        for (int a : vec[1]) tmp.push_back(a);
                        for (int a : vec[2]) tmp.push_back(a);
                        sort(tmp.begin(), tmp.end(), [&](int v, int u){return H[v] < H[u];});
                        if (tmp.size() && H[vec[0].back()] < H[tmp.back()] && P.size() && B[P.back()] != B[tmp.back()])
                                tmp.swap(vec[0]);
                        while (tmp.size() && vec[0].size())
                        {
                                P.push_back(vec[0].back());
                                vec[0].pop_back();
                                P.push_back(tmp.back());
                                tmp.pop_back();
                        }
                        if (vec[0].size())
                        {
                                assert((int)vec[0].size() == 1);
                                P.push_back(vec[0][0]);
                                P.push_back(Centroid);
                        }
                        else if (tmp.size())
                        {
                                assert((int)tmp.size() == 1);
                                P.push_back(Centroid);
                                P.push_back(tmp[0]);
                        }
                        else
                                P.push_back(Centroid);
                        assert((int)P.size() == n);

                        for (int i = 0; i + 1 < n; i ++)
                                assert(B[P[i]] != B[P[i + 1]]);

                        return P;
                }
                int j = -1, h = -1;
                for (int i = 0; i < k; i ++)
                        if (i != last && vec[i].size() && h < H[vec[i].back()])
                                h = max(h, H[vec[i].back()]), j = i;
                /*for (int i = 0; i < k; i ++)
                        if (i != last && vec[i].size() && H[vec[i].back()] == h && (j == -1 || vec[i].size() > vec[j].size()))
                                j = i;*/
                assert(j != -1 && j != last);
                if (P.size() > 1)
                        assert(H[P[(int)P.size() - 2]] >= H[vec[j].back()]);
                P.push_back(vec[j].back());
                vec[j].pop_back();
                last = j;
        }
        assert(0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 4 ms 5248 KB Output is correct
13 Correct 4 ms 5248 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5248 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 294 ms 45000 KB Output is correct
19 Correct 5 ms 5376 KB Output is correct
20 Correct 7 ms 5760 KB Output is correct
21 Correct 9 ms 6144 KB Output is correct
22 Correct 16 ms 7680 KB Output is correct
23 Correct 30 ms 10232 KB Output is correct
24 Correct 41 ms 12032 KB Output is correct
25 Correct 157 ms 27792 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 4 ms 5248 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 5 ms 5376 KB Output is correct
14 Correct 26 ms 8952 KB Output is correct
15 Correct 328 ms 45152 KB Output is correct
16 Correct 334 ms 45172 KB Output is correct
17 Correct 69 ms 14968 KB Output is correct
18 Correct 145 ms 23476 KB Output is correct
19 Correct 234 ms 35180 KB Output is correct
20 Correct 12 ms 6656 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 3 ms 4992 KB Output is correct
14 Correct 3 ms 4992 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 3 ms 4992 KB Output is correct
17 Correct 3 ms 4992 KB Output is correct
18 Correct 3 ms 4992 KB Output is correct
19 Correct 3 ms 4992 KB Output is correct
20 Correct 3 ms 4992 KB Output is correct
21 Correct 3 ms 4992 KB Output is correct
22 Correct 3 ms 4992 KB Output is correct
23 Correct 3 ms 4992 KB Output is correct
24 Correct 4 ms 5248 KB Output is correct
25 Correct 4 ms 5248 KB Output is correct
26 Correct 4 ms 4992 KB Output is correct
27 Correct 4 ms 5120 KB Output is correct
28 Correct 3 ms 4992 KB Output is correct
29 Correct 4 ms 5248 KB Output is correct
30 Correct 4 ms 4992 KB Output is correct
31 Correct 4 ms 5120 KB Output is correct
32 Correct 4 ms 5120 KB Output is correct
33 Correct 4 ms 5120 KB Output is correct
34 Correct 4 ms 5248 KB Output is correct
35 Correct 4 ms 5248 KB Output is correct
36 Correct 4 ms 5248 KB Output is correct
37 Correct 4 ms 5120 KB Output is correct
38 Correct 4 ms 5248 KB Output is correct
39 Correct 4 ms 5120 KB Output is correct
40 Correct 4 ms 5120 KB Output is correct
41 Correct 4 ms 5120 KB Output is correct
42 Correct 4 ms 5248 KB Output is correct
43 Correct 4 ms 5120 KB Output is correct
44 Correct 294 ms 45000 KB Output is correct
45 Correct 5 ms 5376 KB Output is correct
46 Correct 7 ms 5760 KB Output is correct
47 Correct 9 ms 6144 KB Output is correct
48 Correct 16 ms 7680 KB Output is correct
49 Correct 30 ms 10232 KB Output is correct
50 Correct 41 ms 12032 KB Output is correct
51 Correct 157 ms 27792 KB Output is correct
52 Correct 5 ms 5376 KB Output is correct
53 Correct 26 ms 8952 KB Output is correct
54 Correct 328 ms 45152 KB Output is correct
55 Correct 334 ms 45172 KB Output is correct
56 Correct 69 ms 14968 KB Output is correct
57 Correct 145 ms 23476 KB Output is correct
58 Correct 234 ms 35180 KB Output is correct
59 Correct 12 ms 6656 KB Output is correct
60 Correct 317 ms 39024 KB Output is correct
61 Correct 355 ms 41456 KB Output is correct
62 Correct 348 ms 45424 KB Output is correct
63 Correct 388 ms 50672 KB Output is correct
64 Correct 337 ms 42992 KB Output is correct
65 Correct 398 ms 46048 KB Output is correct
66 Correct 438 ms 48368 KB Output is correct
67 Correct 388 ms 47600 KB Output is correct
68 Correct 449 ms 50800 KB Output is correct
69 Correct 472 ms 48368 KB Output is correct
70 Correct 355 ms 45936 KB Output is correct
71 Correct 418 ms 49904 KB Output is correct
72 Correct 441 ms 46320 KB Output is correct
73 Correct 419 ms 48036 KB Output is correct
74 Correct 518 ms 49264 KB Output is correct
75 Correct 368 ms 45940 KB Output is correct
76 Correct 406 ms 50032 KB Output is correct
77 Correct 412 ms 50416 KB Output is correct
78 Correct 422 ms 47088 KB Output is correct
79 Correct 500 ms 49264 KB Output is correct
80 Correct 458 ms 44144 KB Output is correct
81 Correct 363 ms 44912 KB Output is correct
82 Correct 373 ms 44656 KB Output is correct
83 Correct 386 ms 44016 KB Output is correct
84 Correct 140 ms 21712 KB Output is correct