답안 #1067351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1067351	2024-08-20T15:26:41 Z	Ignut	고대 책들 (IOI17_books)	C++17	12 / 100	1 ms	348 KB

books

// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll minimum_walk(vector<int> p, int s) {
    int n = p.size();
    // if (n == 4 && p[0] == 3 && p[1] == 2 && p[2] == 0) n /= 0;
    int cntR[n] = {}, cntL[n] = {};
    int add[n] = {}, del[n] = {};
    // right
    for (int i = 0; i < n; i ++) {
        if (p[i] > i) {
            add[i] ++;
            del[p[i]] ++;
        }
    }
    int cr = 0;
    for (int i = 0; i < n; i ++) {
        cr += add[i];
        cr -= del[i];
        cntR[i] = cr;
    }
    // left
    for (int i = 0; i < n; i ++) add[i] = del[i] = 0;
    for (int i = 0; i < n; i ++) {
        if (p[i] < i) {
            add[i] ++;
            del[p[i]] ++;
        }
    }
    int cl = 0;
    for (int i = n - 1; i >= 0; i --) {
        cl += add[i];
        cl -= del[i];
        cntL[i] = cl;
    }

    ll res = 0;
    int pos = 0;
    while (true) {
        int R = -1;
        for (int i = 0; i < n; i ++) if (cntR[i] >= 1) R = i + 1;
        for (int i = 0; i < n; i ++) if (cntL[i] >= 1) R = max(R, i);
        // cout << "R = " << R << '\n';
        if (R < pos) break;
        for (int i = pos; i < R; i ++) cntR[i] --;
        res += R - pos;
        pos = R;
        int L = 2 * n + 123;
        for (int i = n - 1; i >= 0; i --) if (cntL[i] >= 2) L = i - 1;
        for (int i = n - 1; i >= 0; i --) if (cntR[i] >= 1) L = min(L, i);
        if (L > pos) break;
        res += pos - L;
        // cout << "L = " << L << '\n';
        for (int i = pos; i > L; i --) cntL[i] --;
        pos = L;
    }
    res += pos;
    return res;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '338572', found: '339340'
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '338572', found: '339340'
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '3304', found: '5898'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '338572', found: '339340'
20	Halted	0 ms	0 KB	-