답안 #708195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708195	2023-03-11T09:35:16 Z	Cyanmond	고대 책들 (IOI17_books)	C++17	50 / 100	129 ms	30516 KB

books

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

using i64 = long long;
constexpr i64 inf = 1ll << 50;

void chmax(i64 &a, i64 b) {
    if (a < b) a = b;
}

long long minimum_walk(std::vector<int> p, int s) {
    const int n = (int)p.size();
    std::vector<i64> imos(n), imos2(n);
    for (int i = 0; i < n; ++i) {
        int a = i, b = p[i];
        if (a > b) std::swap(a, b);
        ++imos[a];
        --imos[b];
        if (a != b) {
            ++imos2[a + 1];
            --imos2[b];
        }
    }
    for (int i = 0; i < n - 1; ++i) {
        imos[i + 1] += imos[i];
        imos2[i + 1] += imos2[i];
    }
    i64 baseCost = std::accumulate(imos.begin(), imos.end(), 0ll);

    auto solve = [&](const int f) {
        i64 x = 0, c = 0;
        for (int i = f; i < n; ++i) {
            if (imos[i] == 0) {
                ++c;
            }
            if (imos[i] != 0) {
                x += c;
                c = 0;
            }
        }
        c = 0;
        for (int i = f - 1; i >= 0; --i) {
            if (imos[i] == 0) {
                ++c;
            }
            if (imos[i] != 0) {
                x += c;
                c = 0;
            }
        }
        return x;
    };
    i64 answer = inf;
    for (int i = s; i < n; ++i) {
        if (imos2[i] == 0) {
            answer = std::min(answer, baseCost + 2 * solve(i));
            break;
        }
    }
    for (int i = s; i >= 0; --i) {
        if (imos2[i] == 0) {
            answer = std::min(answer, baseCost + 2 * solve(i));
            break;
        }
    }
    return answer;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 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	0 ms	212 KB	Output is correct
26	Correct	1 ms	296 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 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	0 ms	212 KB	Output is correct
26	Correct	1 ms	296 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct
30	Correct	123 ms	30420 KB	Output is correct
31	Correct	126 ms	30420 KB	Output is correct
32	Correct	96 ms	30392 KB	Output is correct
33	Correct	118 ms	30424 KB	Output is correct
34	Correct	129 ms	30412 KB	Output is correct
35	Correct	121 ms	30364 KB	Output is correct
36	Correct	105 ms	30392 KB	Output is correct
37	Correct	110 ms	30412 KB	Output is correct
38	Correct	103 ms	30412 KB	Output is correct
39	Correct	99 ms	30392 KB	Output is correct
40	Correct	99 ms	30416 KB	Output is correct
41	Correct	106 ms	30396 KB	Output is correct
42	Correct	106 ms	30404 KB	Output is correct
43	Correct	106 ms	30516 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	296 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 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	0 ms	212 KB	Output is correct
26	Correct	1 ms	296 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct
30	Correct	123 ms	30420 KB	Output is correct
31	Correct	126 ms	30420 KB	Output is correct
32	Correct	96 ms	30392 KB	Output is correct
33	Correct	118 ms	30424 KB	Output is correct
34	Correct	129 ms	30412 KB	Output is correct
35	Correct	121 ms	30364 KB	Output is correct
36	Correct	105 ms	30392 KB	Output is correct
37	Correct	110 ms	30412 KB	Output is correct
38	Correct	103 ms	30412 KB	Output is correct
39	Correct	99 ms	30392 KB	Output is correct
40	Correct	99 ms	30416 KB	Output is correct
41	Correct	106 ms	30396 KB	Output is correct
42	Correct	106 ms	30404 KB	Output is correct
43	Correct	106 ms	30516 KB	Output is correct
44	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-