oj.uz

Submission #290687

# Submission time Handle Problem Language Result Execution time Memory
290687 2020-09-04T10:33:08 Z Kastanda Fun Tour (APIO20_fun) C++11
66 / 100
 567 ms 50292 KB 
// M
#include<bits/stdc++.h>
#include "fun.h"
using namespace std;
const int N = 100005;
int n, Centroid, H[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];});

        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 (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];});
                        while (tmp.size() && vec[0].size())
                        {
                                P.push_back(vec[0].back());
                                vec[0].pop_back();
                                P.push_back(tmp.back());
                                tmp.pop_back();
                        }
                        assert(!tmp.size());
                        if (vec[0].size())
                        {
                                assert((int)vec[0].size() == 1);
                                P.push_back(vec[0][0]);
                        }
                        P.push_back(Centroid);
                        return P;
                }
                int j = -1, h = -1;
                for (int i = 0; i < k; i ++)
                        if (i != last && vec[i].size())
                                h = max(h, H[vec[i].back()]);
                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;
                if (j == -1 || !vec[j].size())
                        break;
                P.push_back(vec[j].back());
                vec[j].pop_back();
                last = j;
        }
        P.push_back(Centroid);
        int Cnt = 0;
        for (int i = 0; i < k; i ++)
                if (vec[i].size())
                        Cnt ++;
        assert(Cnt <= 1);
        if (Cnt)
        {
                int j = 0;
                while (!vec[j].size())
                        j ++;
                assert((int)vec[j].size() == 1);
                P.push_back(vec[j].back());
        }
        assert((int)P.size() == n);
        return P;
}

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 4 ms 5024 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 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 3 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 4 ms 5024 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 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 3 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 4 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 3 ms 4992 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 3 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 4992 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 4992 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 4 ms 5024 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 4 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 4 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 3 ms 4992 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 5248 KB Output is correct
18 Correct 296 ms 44608 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 22 ms 7680 KB Output is correct
23 Correct 31 ms 10240 KB Output is correct
24 Correct 43 ms 11896 KB Output is correct
25 Correct 162 ms 27536 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 4 ms 5024 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 4 ms 5248 KB Output is correct
9 Correct 3 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 4992 KB Output is correct
13 Correct 5 ms 5376 KB Output is correct
14 Correct 26 ms 8832 KB Output is correct
15 Correct 352 ms 44528 KB Output is correct
16 Correct 338 ms 44788 KB Output is correct
17 Correct 69 ms 14840 KB Output is correct
18 Correct 150 ms 23232 KB Output is correct
19 Correct 242 ms 34792 KB Output is correct
20 Correct 12 ms 6656 KB Output is correct

Subtask #5
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 4 ms 5024 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 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 3 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 4 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 3 ms 4992 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 3 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 4992 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 4992 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 5248 KB Output is correct
44 Correct 296 ms 44608 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 22 ms 7680 KB Output is correct
49 Correct 31 ms 10240 KB Output is correct
50 Correct 43 ms 11896 KB Output is correct
51 Correct 162 ms 27536 KB Output is correct
52 Correct 5 ms 5376 KB Output is correct
53 Correct 26 ms 8832 KB Output is correct
54 Correct 352 ms 44528 KB Output is correct
55 Correct 338 ms 44788 KB Output is correct
56 Correct 69 ms 14840 KB Output is correct
57 Correct 150 ms 23232 KB Output is correct
58 Correct 242 ms 34792 KB Output is correct
59 Correct 12 ms 6656 KB Output is correct
60 Correct 319 ms 38640 KB Output is correct
61 Correct 375 ms 41072 KB Output is correct
62 Correct 359 ms 45040 KB Output is correct
63 Correct 434 ms 50292 KB Output is correct
64 Correct 356 ms 42580 KB Output is correct
65 Correct 391 ms 45680 KB Output is correct
66 Correct 482 ms 47984 KB Output is correct
67 Correct 414 ms 47344 KB Output is correct
68 Correct 526 ms 50288 KB Output is correct
69 Correct 561 ms 48288 KB Output is correct
70 Correct 374 ms 45552 KB Output is correct
71 Correct 395 ms 49520 KB Output is correct
72 Correct 476 ms 45932 KB Output is correct
73 Correct 465 ms 47472 KB Output is correct
74 Correct 567 ms 48856 KB Output is correct
75 Correct 406 ms 45440 KB Output is correct
76 Correct 459 ms 49648 KB Output is correct
77 Correct 439 ms 50032 KB Output is correct
78 Correct 414 ms 46448 KB Output is correct
79 Correct 498 ms 48880 KB Output is correct
80 Correct 460 ms 43632 KB Output is correct
81 Correct 386 ms 44528 KB Output is correct
82 Correct 367 ms 44144 KB Output is correct
83 Incorrect 380 ms 43632 KB Tour is not fun
84 Halted 0 ms 0 KB -