답안 #335745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335745	2020-12-13T20:11:45 Z	couplefire	고대 책들 (IOI17_books)	C++17	50 / 100	412 ms	74024 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;

long long minimum_walk(vector<int> p, int s) {
    int n = p.size();
    vector<bool> visited(n, 0);
    vector<vector<int>> cycles;
    long long ans = 0;
    for(int i = 0; i<n; i++) ans += abs(p[i]-i);
    for(int i = 0; i<n; i++){
        if(visited[p[i]]) continue;
        cycles.push_back({});
        int j = p[i];
        while(!visited[j]){
            visited[j] = 1;
            cycles.back().push_back(j);
            j = p[j];
        }
    }
    vector<int> del(n+1, 0);
    vector<int> add(n+1, 0);
    for(auto x : cycles){
        int mi = n, ma = -1;
        for(auto y : x){
            mi = min(mi, y);
            ma = max(ma, y);
        }
        add[mi]++;
        del[ma+1]++;
    }
    int cur = 0;
    int cnt = 0;
    for(int i = 0; i<=s; i++){
        cur -= del[i];
        if(cur == 0 && i != 0) cnt++;
        cur += add[i];
    }
    for(int i = s+1; i<n; i++){
        cur -= del[i];
        if(cur == 0) cnt++;
        cur += add[i];
    }
    for(int i = n-1; i>=s+1 && p[i] == i; i--) cnt--;
    for(int i = 0; i<s && p[i] == i; i++) cnt--;
	return ans+2ll*cnt;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	71 ms	380 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	71 ms	380 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	249 ms	26836 KB	Output is correct
31	Correct	279 ms	25884 KB	Output is correct
32	Correct	412 ms	74024 KB	Output is correct
33	Correct	245 ms	57660 KB	Output is correct
34	Correct	240 ms	57704 KB	Output is correct
35	Correct	235 ms	53388 KB	Output is correct
36	Correct	208 ms	36260 KB	Output is correct
37	Correct	163 ms	26636 KB	Output is correct
38	Correct	159 ms	25452 KB	Output is correct
39	Correct	140 ms	25324 KB	Output is correct
40	Correct	141 ms	24552 KB	Output is correct
41	Correct	152 ms	28540 KB	Output is correct
42	Correct	155 ms	26340 KB	Output is correct
43	Correct	249 ms	63428 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 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	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	71 ms	380 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	249 ms	26836 KB	Output is correct
31	Correct	279 ms	25884 KB	Output is correct
32	Correct	412 ms	74024 KB	Output is correct
33	Correct	245 ms	57660 KB	Output is correct
34	Correct	240 ms	57704 KB	Output is correct
35	Correct	235 ms	53388 KB	Output is correct
36	Correct	208 ms	36260 KB	Output is correct
37	Correct	163 ms	26636 KB	Output is correct
38	Correct	159 ms	25452 KB	Output is correct
39	Correct	140 ms	25324 KB	Output is correct
40	Correct	141 ms	24552 KB	Output is correct
41	Correct	152 ms	28540 KB	Output is correct
42	Correct	155 ms	26340 KB	Output is correct
43	Correct	249 ms	63428 KB	Output is correct
44	Incorrect	1 ms	364 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #335745

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0