답안 #297031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297031	2020-09-11T08:04:37 Z	shayan_p	고대 책들 (IOI17_books)	C++17	50 / 100	181 ms	12320 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]);
		    r++;
		};
    auto backw = [&]{
		     MN = min(MN, 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	0 ms	256 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	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 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	256 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 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	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 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	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	512 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	0 ms	256 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	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 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	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	512 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	181 ms	12228 KB	Output is correct
31	Correct	177 ms	12156 KB	Output is correct
32	Correct	148 ms	12152 KB	Output is correct
33	Correct	145 ms	12152 KB	Output is correct
34	Correct	148 ms	12152 KB	Output is correct
35	Correct	150 ms	12280 KB	Output is correct
36	Correct	144 ms	12280 KB	Output is correct
37	Correct	151 ms	12280 KB	Output is correct
38	Correct	150 ms	12280 KB	Output is correct
39	Correct	156 ms	12320 KB	Output is correct
40	Correct	157 ms	12152 KB	Output is correct
41	Correct	171 ms	12152 KB	Output is correct
42	Correct	164 ms	12152 KB	Output is correct
43	Correct	149 ms	12280 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 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	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 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	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	512 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	181 ms	12228 KB	Output is correct
31	Correct	177 ms	12156 KB	Output is correct
32	Correct	148 ms	12152 KB	Output is correct
33	Correct	145 ms	12152 KB	Output is correct
34	Correct	148 ms	12152 KB	Output is correct
35	Correct	150 ms	12280 KB	Output is correct
36	Correct	144 ms	12280 KB	Output is correct
37	Correct	151 ms	12280 KB	Output is correct
38	Correct	150 ms	12280 KB	Output is correct
39	Correct	156 ms	12320 KB	Output is correct
40	Correct	157 ms	12152 KB	Output is correct
41	Correct	171 ms	12152 KB	Output is correct
42	Correct	164 ms	12152 KB	Output is correct
43	Correct	149 ms	12280 KB	Output is correct
44	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3312'
45	Halted	0 ms	0 KB	-