답안 #708144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708144	2023-03-11T06:22:03 Z	Cyanmond	고대 책들 (IOI17_books)	C++17	50 / 100	184 ms	23788 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;
    };
    const auto u = solve(s);
    i64 m = inf;
    for (int i = s; i < n; ++i) {
        if (imos2[i] == 0) {
            m = std::min(m, (i64)i - s);
        }
    }
    for (int i = s; i >= 0; --i) {
        if (imos2[i] == 0) {
            m = std::min(m, (i64)s - i);
        }
    }
    return baseCost + (2 * solve(s) + (imos[s] == 0 ? 0 : m));
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:53:16: warning: unused variable 'u' [-Wunused-variable]
   53 |     const auto u = solve(s);
      |                ^

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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 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	140 ms	23668 KB	Output is correct
31	Correct	184 ms	23656 KB	Output is correct
32	Correct	118 ms	23756 KB	Output is correct
33	Correct	123 ms	23756 KB	Output is correct
34	Correct	124 ms	23656 KB	Output is correct
35	Correct	137 ms	23756 KB	Output is correct
36	Correct	143 ms	23748 KB	Output is correct
37	Correct	120 ms	23660 KB	Output is correct
38	Correct	122 ms	23656 KB	Output is correct
39	Correct	120 ms	23660 KB	Output is correct
40	Correct	163 ms	23788 KB	Output is correct
41	Correct	127 ms	23756 KB	Output is correct
42	Correct	127 ms	23784 KB	Output is correct
43	Correct	120 ms	23656 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: '3169'
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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 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	140 ms	23668 KB	Output is correct
31	Correct	184 ms	23656 KB	Output is correct
32	Correct	118 ms	23756 KB	Output is correct
33	Correct	123 ms	23756 KB	Output is correct
34	Correct	124 ms	23656 KB	Output is correct
35	Correct	137 ms	23756 KB	Output is correct
36	Correct	143 ms	23748 KB	Output is correct
37	Correct	120 ms	23660 KB	Output is correct
38	Correct	122 ms	23656 KB	Output is correct
39	Correct	120 ms	23660 KB	Output is correct
40	Correct	163 ms	23788 KB	Output is correct
41	Correct	127 ms	23756 KB	Output is correct
42	Correct	127 ms	23784 KB	Output is correct
43	Correct	120 ms	23656 KB	Output is correct
44	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3169'
45	Halted	0 ms	0 KB	-