oj.uz

Submission #424383

# Submission time Handle Problem Language Result Execution time Memory
424383 2021-06-11T21:03:15 Z timmyfeng Ancient Books (IOI17_books) C++17
100 / 100
 256 ms 27720 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000000;

int first[N], last[N], cycles[N];
bool visited[N];

long long minimum_walk(vector<int> perm, int start) {
    int n = perm.size();
    long long ans = 0;

    int low = start, high = start;
    for (int i = 0; i < n; ++i) {
        ans += abs(perm[i] - i);
        if (!visited[i]) {
            int j = i, k = i;
            while (!visited[j]) {
                visited[j] = true;
                k = max(k, j);
                j = perm[j];
            }

            do {
                first[j] = i, last[j] = k;
                j = perm[j];
            } while (j != i);

            if (i != k) {
                low = min(low, i), high = max(high, k);
                ++cycles[i], --cycles[k];
            }
        }
    }

    partial_sum(cycles, cycles + n, cycles);
    ans += 2 * count(cycles + low, cycles + high, 0);

    bool init = false;
    low = high = start;
    while (cycles[high] > 0) {
        int cost_h = 0, ptr_h = high, new_high = high;
        int cost_l = 0, ptr_l = low, new_low = low;

        if (init) {
            while (first[ptr_h] >= low) {
                new_high = max(new_high, last[ptr_h]);
                if (ptr_h == new_high) {
                    cost_h += 2;
                    ++new_high;
                }
                ++ptr_h;
            }

            while (last[ptr_l] <= high) {
                new_low = min(new_low, first[ptr_l]);
                if (ptr_l == new_low) {
                    cost_l += 2;
                    --new_low;
                }
                --ptr_l;
            }
        }

        ans += min(cost_h, cost_l);
        while (new_low <= ptr_l || ptr_h <= new_high) {
            int i = new_low <= ptr_l ? ptr_l-- : ptr_h++;
            new_low = min(new_low, first[i]);
            new_high = max(new_high, last[i]);
        }

        low = new_low, high = new_high, init = true;
    }

    return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 246 ms 20716 KB Output is correct
31 Correct 256 ms 20712 KB Output is correct
32 Correct 130 ms 20716 KB Output is correct
33 Correct 163 ms 20712 KB Output is correct
34 Correct 132 ms 20740 KB Output is correct
35 Correct 157 ms 20712 KB Output is correct
36 Correct 144 ms 20716 KB Output is correct
37 Correct 132 ms 20724 KB Output is correct
38 Correct 137 ms 20724 KB Output is correct
39 Correct 143 ms 20728 KB Output is correct
40 Correct 141 ms 20728 KB Output is correct
41 Correct 176 ms 20732 KB Output is correct
42 Correct 208 ms 20720 KB Output is correct
43 Correct 136 ms 20712 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 246 ms 20716 KB Output is correct
31 Correct 256 ms 20712 KB Output is correct
32 Correct 130 ms 20716 KB Output is correct
33 Correct 163 ms 20712 KB Output is correct
34 Correct 132 ms 20740 KB Output is correct
35 Correct 157 ms 20712 KB Output is correct
36 Correct 144 ms 20716 KB Output is correct
37 Correct 132 ms 20724 KB Output is correct
38 Correct 137 ms 20724 KB Output is correct
39 Correct 143 ms 20728 KB Output is correct
40 Correct 141 ms 20728 KB Output is correct
41 Correct 176 ms 20732 KB Output is correct
42 Correct 208 ms 20720 KB Output is correct
43 Correct 136 ms 20712 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 304 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 135 ms 27488 KB Output is correct
65 Correct 139 ms 27464 KB Output is correct
66 Correct 137 ms 27480 KB Output is correct
67 Correct 137 ms 27492 KB Output is correct
68 Correct 14 ms 2892 KB Output is correct
69 Correct 19 ms 2892 KB Output is correct
70 Correct 18 ms 2892 KB Output is correct
71 Correct 14 ms 2936 KB Output is correct
72 Correct 13 ms 2892 KB Output is correct
73 Correct 14 ms 2944 KB Output is correct
74 Correct 135 ms 27496 KB Output is correct
75 Correct 137 ms 27460 KB Output is correct
76 Correct 141 ms 27484 KB Output is correct
77 Correct 142 ms 27460 KB Output is correct
78 Correct 142 ms 27492 KB Output is correct
79 Correct 138 ms 27488 KB Output is correct
80 Correct 137 ms 27484 KB Output is correct
81 Correct 134 ms 27496 KB Output is correct
82 Correct 139 ms 27720 KB Output is correct
83 Correct 160 ms 27596 KB Output is correct
84 Correct 142 ms 27496 KB Output is correct
85 Correct 137 ms 27568 KB Output is correct
86 Correct 139 ms 27512 KB Output is correct
87 Correct 141 ms 27480 KB Output is correct
88 Correct 143 ms 27592 KB Output is correct
89 Correct 142 ms 27568 KB Output is correct
90 Correct 142 ms 27492 KB Output is correct
91 Correct 139 ms 27496 KB Output is correct
92 Correct 144 ms 27628 KB Output is correct