답안 #1073867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073867	2024-08-25T00:51:05 Z	ArthuroWich	고대 책들 (IOI17_books)	C++17	50 / 100	104 ms	29896 KB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
int n, minl, maxr;
vector<int> pref, f1, f2;
int calc(int l, int r) {
    for (int i = l-1; i >= 0; i--) {
        if (pref[i] > 0) {
            l = i;
        } else {
            break;
        }
    }
    for (int i = r; i < n; i++) {
        if (pref[i] > 0) {
            r = i+1;
        }
    }
    if (l-1 < minl && r+1 > maxr) {
        return 0;
    } 
    if (l-1 < minl) {
        return 2+calc(l, r+1);
    } else if (r+1 > maxr) {
        return 2+calc(l-1, r);
    } else {
        return 2+min(calc(l-1, r), calc(l, r+1));
    }
}
long long minimum_walk(vector<int> p, int s) {
    long long int ans = 0;
    n = p.size();
    pref.resize(n+1, 0);
    f1.resize(n, 0);
    f2.resize(n, 0);
    minl = INT_MAX;
    maxr = 0;
    for (int i = 0; i < n; i++) {
        ans += abs(i-p[i]);
    }
    vector<pair<int, int>> cycles;
    vector<int> vis(n, 0);
    for (int i = 0; i < n; i++) {
        if (p[i] == i || vis[i]) {
            continue;
        }
        int a = i, l = i, r = i;
        vis[i] = 1;
        a = p[i];
        vis[a] = 1;
        l = min(l, a);
        r = max(r, a);
        while(a != i) {
            a = p[a];
            vis[a] = 1;
            l = min(l, a);
            r = max(r, a);
        }
        minl = min(minl, l);
        maxr = max(maxr, r);
        cycles.push_back({min(l, r), max(l, r)});
    }
    for (auto [i, j] : cycles) {
        pref[i] += 1;
        pref[j] -= 1; 
    }
    for (int i = 1; i < n; i++) {
        pref[i] += pref[i-1];
    }
    if (s == 0) {
        for (int i = n-1; i >= 0; i--) {
            if (pref[i] > 0) {
                f2[i] = 1;
            }
            if (i < n-1) {
                f2[i] |= f2[i+1];
            }
        }
        for (int i = n-1; i >= 0; i--) {
            if (f2[i] && pref[i] == 0) {
                ans += 2;
            }
        }
    } else {
        ans += calc(s, s);
    }
    return ans;
}

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	440 KB	Output is correct
3	Correct	0 ms	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 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	436 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	440 KB	Output is correct
3	Correct	0 ms	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 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	436 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	100 ms	27636 KB	Output is correct
31	Correct	95 ms	27724 KB	Output is correct
32	Correct	77 ms	27728 KB	Output is correct
33	Correct	85 ms	29876 KB	Output is correct
34	Correct	84 ms	29800 KB	Output is correct
35	Correct	92 ms	29808 KB	Output is correct
36	Correct	82 ms	29812 KB	Output is correct
37	Correct	79 ms	27984 KB	Output is correct
38	Correct	81 ms	27616 KB	Output is correct
39	Correct	83 ms	27816 KB	Output is correct
40	Correct	80 ms	27608 KB	Output is correct
41	Correct	92 ms	27616 KB	Output is correct
42	Correct	104 ms	27692 KB	Output is correct
43	Correct	88 ms	29896 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 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	348 KB	Output is correct
2	Correct	0 ms	440 KB	Output is correct
3	Correct	0 ms	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 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	436 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	100 ms	27636 KB	Output is correct
31	Correct	95 ms	27724 KB	Output is correct
32	Correct	77 ms	27728 KB	Output is correct
33	Correct	85 ms	29876 KB	Output is correct
34	Correct	84 ms	29800 KB	Output is correct
35	Correct	92 ms	29808 KB	Output is correct
36	Correct	82 ms	29812 KB	Output is correct
37	Correct	79 ms	27984 KB	Output is correct
38	Correct	81 ms	27616 KB	Output is correct
39	Correct	83 ms	27816 KB	Output is correct
40	Correct	80 ms	27608 KB	Output is correct
41	Correct	92 ms	27616 KB	Output is correct
42	Correct	104 ms	27692 KB	Output is correct
43	Correct	88 ms	29896 KB	Output is correct
44	Incorrect	1 ms	344 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-