답안 #297037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297037	2020-09-11T08:09:46 Z	shayan_p	고대 책들 (IOI17_books)	C++17	100 / 100	196 ms	18872 KB

books

#include<bits/stdc++.h>
#include "books.h"
     
#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)
     
using namespace std;
     
typedef long long ll;
typedef pair<int, int> pii;
     
const int maxn = 1e6 + 10;
     
int cnt[maxn];
     
ll minimum_walk(vector<int> p, int s){
    int n = sz(p);
        
    int MN = s, MX = s;
    ll ans = 0;
    for(int i = 0; i < n; i++){
    	ans+= abs(p[i] - i);
    	cnt[min(i, p[i])]++;
    	cnt[max(i, p[i])]--;
    }
    int l = s, r = s;

    auto forw = [&]{
		    MX = max(MX, p[r]);
		    MN = min(MN, p[r]);
		    r++;
		};
    auto backw = [&]{
		     MN = min(MN, p[l]);
		     MX = max(MX, p[l]);
		     l--;
		 };
    auto go = [&](){
    		  while(true){
    		      bool is = 0;
    		      while(r < n && r <= MX)			  
    			  forw(), is = 1;
    		      while(l >= 0 && l >= MN)
    			  backw(), is = 1;
    		      if(!is)
    			  break;
    		  }
    	      };
    int L = -1, R = n;
    int lst = -1;
    int sm = 0;
    for(int i = 0; i < n; i++){
    	sm+= cnt[i];
    	if(sm == 0){
    	    if(i != n-1)
    		ans+= 2;
    	    if(lst < s && s <= i)
    		L = lst, R = i+1;
    	    lst = i;
    	}	
    }
     
    go();
    while(L < l || r < R){
    	ans+= 2;
	backw(), forw();
    	go();
    }
    for(int i = 0; i < s && p[i] == i; i++){
    	ans-= 2;
    }
    for(int i = n-1; i > s && p[i] == i; i--){
    	ans-= 2;
    }
    return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	195 ms	12408 KB	Output is correct
31	Correct	196 ms	12408 KB	Output is correct
32	Correct	164 ms	12408 KB	Output is correct
33	Correct	172 ms	12408 KB	Output is correct
34	Correct	168 ms	12408 KB	Output is correct
35	Correct	166 ms	12408 KB	Output is correct
36	Correct	164 ms	12408 KB	Output is correct
37	Correct	166 ms	12408 KB	Output is correct
38	Correct	173 ms	12404 KB	Output is correct
39	Correct	169 ms	12404 KB	Output is correct
40	Correct	176 ms	12412 KB	Output is correct
41	Correct	182 ms	12408 KB	Output is correct
42	Correct	177 ms	12408 KB	Output is correct
43	Correct	164 ms	12408 KB	Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	195 ms	12408 KB	Output is correct
31	Correct	196 ms	12408 KB	Output is correct
32	Correct	164 ms	12408 KB	Output is correct
33	Correct	172 ms	12408 KB	Output is correct
34	Correct	168 ms	12408 KB	Output is correct
35	Correct	166 ms	12408 KB	Output is correct
36	Correct	164 ms	12408 KB	Output is correct
37	Correct	166 ms	12408 KB	Output is correct
38	Correct	173 ms	12404 KB	Output is correct
39	Correct	169 ms	12404 KB	Output is correct
40	Correct	176 ms	12412 KB	Output is correct
41	Correct	182 ms	12408 KB	Output is correct
42	Correct	177 ms	12408 KB	Output is correct
43	Correct	164 ms	12408 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	1 ms	384 KB	Output is correct
47	Correct	1 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	1 ms	384 KB	Output is correct
50	Correct	1 ms	384 KB	Output is correct
51	Correct	1 ms	384 KB	Output is correct
52	Correct	1 ms	384 KB	Output is correct
53	Correct	1 ms	384 KB	Output is correct
54	Correct	1 ms	384 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	1 ms	384 KB	Output is correct
57	Correct	1 ms	372 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	384 KB	Output is correct
60	Correct	1 ms	256 KB	Output is correct
61	Correct	1 ms	384 KB	Output is correct
62	Correct	1 ms	384 KB	Output is correct
63	Correct	1 ms	384 KB	Output is correct
64	Correct	168 ms	18808 KB	Output is correct
65	Correct	178 ms	18736 KB	Output is correct
66	Correct	196 ms	18808 KB	Output is correct
67	Correct	180 ms	18808 KB	Output is correct
68	Correct	17 ms	2048 KB	Output is correct
69	Correct	17 ms	2048 KB	Output is correct
70	Correct	17 ms	2048 KB	Output is correct
71	Correct	16 ms	2048 KB	Output is correct
72	Correct	16 ms	2048 KB	Output is correct
73	Correct	18 ms	2048 KB	Output is correct
74	Correct	168 ms	18808 KB	Output is correct
75	Correct	180 ms	18808 KB	Output is correct
76	Correct	167 ms	18808 KB	Output is correct
77	Correct	173 ms	18808 KB	Output is correct
78	Correct	171 ms	18872 KB	Output is correct
79	Correct	172 ms	18808 KB	Output is correct
80	Correct	172 ms	18808 KB	Output is correct
81	Correct	173 ms	18808 KB	Output is correct
82	Correct	163 ms	18808 KB	Output is correct
83	Correct	171 ms	18808 KB	Output is correct
84	Correct	169 ms	18808 KB	Output is correct
85	Correct	175 ms	18808 KB	Output is correct
86	Correct	172 ms	18736 KB	Output is correct
87	Correct	175 ms	18808 KB	Output is correct
88	Correct	176 ms	18808 KB	Output is correct
89	Correct	170 ms	18808 KB	Output is correct
90	Correct	172 ms	18808 KB	Output is correct
91	Correct	181 ms	18808 KB	Output is correct
92	Correct	185 ms	18808 KB	Output is correct

답안 #297037

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 20.0 / 20.0

Subtask #5 30.0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
20.0 / 20.0

Subtask #5
30.0 / 30.0