Submission #642103

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
642103	2022-09-18T13:26:58 Z	piOOE	Ancient Books (IOI17_books)	C++17	50 / 100	130 ms	18764 KB

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std;
using ll = long long;

long long minimum_walk(std::vector<int> p, int s) {
    if (is_sorted(p.begin(), p.end())) {
        return 0;
    }
    int n = p.size();
    vector<int> inv(n);
    for (int i = 0; i < n; ++i) {
        inv[p[i]] = i;
    }
    ll ans = 0;
    for (int j = 0; j < n; ++j) {
        ans += abs(p[j] - inv[p[j]]);
    }
    int L = 0, R = n;
    while (p[L] == L) ++L;
    while (p[R - 1] == R - 1) --R;
    if (s < L || s >= R) {
        int i = 0;
        int mx = -1;
        for (; i < n; ++i) {
            if (is_sorted(p.begin() + i, p.end())) break;
            if (i && mx < i) {
                ans += 2;
            }
            mx = max(mx, p[i]);
        }
        return ans;
    } else {
        int mn = n;
        for (int j = s; j < R; ++j) mn = min(mn, p[j]);
        for (int j = s - 1; j >= L; --j) {
            if (j < mn) {
                ans += 2;
            }
            mn = min(mn, p[j]);
        }
        int mx = -1;
        for (int j = L; j <= s; ++j) {
            mx = max(mx, p[j]);
        }
        for (int j = s + 1; j < R; ++j) {
            if (j > mx) ans += 2;
            mx = max(mx, p[j]);
        }
        return ans;
    }
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 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	300 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 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	300 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 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	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 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	300 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 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	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	94 ms	18652 KB	Output is correct
31	Correct	97 ms	18652 KB	Output is correct
32	Correct	95 ms	14956 KB	Output is correct
33	Correct	130 ms	18764 KB	Output is correct
34	Correct	93 ms	18660 KB	Output is correct
35	Correct	91 ms	18664 KB	Output is correct
36	Correct	93 ms	18652 KB	Output is correct
37	Correct	127 ms	18656 KB	Output is correct
38	Correct	96 ms	18636 KB	Output is correct
39	Correct	94 ms	18764 KB	Output is correct
40	Correct	90 ms	18652 KB	Output is correct
41	Correct	104 ms	18660 KB	Output is correct
42	Correct	108 ms	18652 KB	Output is correct
43	Correct	92 ms	18652 KB	Output is correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 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	300 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 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	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	94 ms	18652 KB	Output is correct
31	Correct	97 ms	18652 KB	Output is correct
32	Correct	95 ms	14956 KB	Output is correct
33	Correct	130 ms	18764 KB	Output is correct
34	Correct	93 ms	18660 KB	Output is correct
35	Correct	91 ms	18664 KB	Output is correct
36	Correct	93 ms	18652 KB	Output is correct
37	Correct	127 ms	18656 KB	Output is correct
38	Correct	96 ms	18636 KB	Output is correct
39	Correct	94 ms	18764 KB	Output is correct
40	Correct	90 ms	18652 KB	Output is correct
41	Correct	104 ms	18660 KB	Output is correct
42	Correct	108 ms	18652 KB	Output is correct
43	Correct	92 ms	18652 KB	Output is correct
44	Incorrect	0 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-