답안 #42755 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42755	2018-03-03T19:53:49 Z	yusufake	고대 책들 (IOI17_books)	C++	50 / 100	254 ms	24148 KB

books

#include<bits/stdc++.h>
 
using namespace std;
 
#define _   int v, int tl, int tr, int l, int r
#define tm  (tl+tr >> 1)
#define sol v+v,tl,tm,l,r
#define sag v+v+1,tm+1,tr,l,r
 
#define mp make_pair
#define pb push_back
#define st first
#define nd second
 
//typedef long long ll;
//typedef pair < ll , ll > pp;
 
const int mod = 1e9 + 7;
const int N   = 1e6 + 6;

int H[N],T[N],A[N],B[N],n,i,j,l,r,ll,rr,t1,t2,t,a,b;
long long x;

void relax(int &l, int &r, int &a, int &b){
    for(;l > a || r < b;){
        if(l > a) { l--; a = min(a,A[l]); b = max(b,B[l]); }
        if(r < b) { r++; a = min(a,A[r]); b = max(b,B[r]); }
    }
}

long long minimum_walk(vector < int > p, int s){
    x = 0;
    n = p.size();
	for(i=0;i<n;i++){
		x += abs(p[i] - i);
		if(H[i]) continue;
		r = i;
		for(j=i; !H[j] ; j = p[j]){
			H[j] = 1;
			r = max(r , j);
		}
        for(j=i; !T[j] ; j = p[j]){
		    T[j] = 1; A[j] = i; B[i] = r;
        }
    }
    
    for(i=0;i<n && p[i] == i; i++);
    for(j=n-1;j>=0 && p[j] == j; j--);
    
    l = r = s; a = A[s]; b = B[s];
    relax(l,r,a,b);
    for(; l > i || r < j ;){
        t1 = 0;
        if(l > i){
            for(ll = a = l, rr = b = r ; rr == r && ll > i ; )
            { ll--; t1++; a = min(A[ll],a); b = max(B[ll],b); relax(ll,rr,a,b); }    
            if(r >= j) { t += t1; break; }
        }
        t2 = 0;
        if(r < j){
            for(t2=0, ll = a = l, rr = b = r ; ll == l && rr < j ; )
            { rr++; t2++; a = min(A[rr],a); b = max(B[rr],b); relax(ll,rr,a,b); }    
            if(l <= i) { t += t2; break; }
        }
        t += min(t1,t2);
        l = ll; r = rr;
    }
    
    return x + t+t;
}
/*
int main(){
    cout << minimum_walk({1,0,2,3} , 2);
}*/

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	1 ms	496 KB	Output is correct
6	Correct	1 ms	672 KB	Output is correct
7	Correct	1 ms	672 KB	Output is correct
8	Correct	1 ms	672 KB	Output is correct
9	Correct	1 ms	672 KB	Output is correct
10	Correct	1 ms	672 KB	Output is correct
11	Correct	2 ms	672 KB	Output is correct
12	Correct	2 ms	672 KB	Output is correct
13	Correct	1 ms	672 KB	Output is correct
14	Correct	1 ms	672 KB	Output is correct
15	Correct	1 ms	672 KB	Output is correct
16	Correct	1 ms	764 KB	Output is correct
17	Correct	1 ms	764 KB	Output is correct
18	Correct	1 ms	764 KB	Output is correct
19	Correct	1 ms	764 KB	Output is correct
20	Correct	2 ms	764 KB	Output is correct
21	Correct	1 ms	764 KB	Output is correct
22	Correct	2 ms	764 KB	Output is correct
23	Correct	1 ms	764 KB	Output is correct
24	Correct	1 ms	764 KB	Output is correct
25	Correct	2 ms	764 KB	Output is correct
26	Correct	1 ms	764 KB	Output is correct
27	Correct	1 ms	764 KB	Output is correct
28	Correct	1 ms	764 KB	Output is correct
29	Correct	1 ms	764 KB	Output is correct
30	Correct	254 ms	20308 KB	Output is correct
31	Correct	240 ms	20308 KB	Output is correct
32	Correct	145 ms	23992 KB	Output is correct
33	Correct	158 ms	24044 KB	Output is correct
34	Correct	166 ms	24148 KB	Output is correct
35	Correct	183 ms	24148 KB	Output is correct
36	Correct	156 ms	24148 KB	Output is correct
37	Correct	170 ms	24148 KB	Output is correct
38	Correct	168 ms	24148 KB	Output is correct
39	Correct	167 ms	24148 KB	Output is correct
40	Correct	180 ms	24148 KB	Output is correct
41	Correct	222 ms	24148 KB	Output is correct
42	Correct	216 ms	24148 KB	Output is correct
43	Correct	155 ms	24148 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	24148 KB	Output is correct
2	Correct	1 ms	24148 KB	Output is correct
3	Correct	1 ms	24148 KB	Output is correct
4	Correct	1 ms	24148 KB	Output is correct
5	Correct	2 ms	24148 KB	Output is correct
6	Correct	1 ms	24148 KB	Output is correct
7	Correct	1 ms	24148 KB	Output is correct
8	Correct	1 ms	24148 KB	Output is correct
9	Incorrect	1 ms	24148 KB	3rd lines differ - on the 1st token, expected: '9824', found: '9810'
10	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	1 ms	496 KB	Output is correct
6	Correct	1 ms	672 KB	Output is correct
7	Correct	1 ms	672 KB	Output is correct
8	Correct	1 ms	672 KB	Output is correct
9	Correct	1 ms	672 KB	Output is correct
10	Correct	1 ms	672 KB	Output is correct
11	Correct	2 ms	672 KB	Output is correct
12	Correct	2 ms	672 KB	Output is correct
13	Correct	1 ms	672 KB	Output is correct
14	Correct	1 ms	672 KB	Output is correct
15	Correct	1 ms	672 KB	Output is correct
16	Correct	1 ms	764 KB	Output is correct
17	Correct	1 ms	764 KB	Output is correct
18	Correct	1 ms	764 KB	Output is correct
19	Correct	1 ms	764 KB	Output is correct
20	Correct	2 ms	764 KB	Output is correct
21	Correct	1 ms	764 KB	Output is correct
22	Correct	2 ms	764 KB	Output is correct
23	Correct	1 ms	764 KB	Output is correct
24	Correct	1 ms	764 KB	Output is correct
25	Correct	2 ms	764 KB	Output is correct
26	Correct	1 ms	764 KB	Output is correct
27	Correct	1 ms	764 KB	Output is correct
28	Correct	1 ms	764 KB	Output is correct
29	Correct	1 ms	764 KB	Output is correct
30	Correct	254 ms	20308 KB	Output is correct
31	Correct	240 ms	20308 KB	Output is correct
32	Correct	145 ms	23992 KB	Output is correct
33	Correct	158 ms	24044 KB	Output is correct
34	Correct	166 ms	24148 KB	Output is correct
35	Correct	183 ms	24148 KB	Output is correct
36	Correct	156 ms	24148 KB	Output is correct
37	Correct	170 ms	24148 KB	Output is correct
38	Correct	168 ms	24148 KB	Output is correct
39	Correct	167 ms	24148 KB	Output is correct
40	Correct	180 ms	24148 KB	Output is correct
41	Correct	222 ms	24148 KB	Output is correct
42	Correct	216 ms	24148 KB	Output is correct
43	Correct	155 ms	24148 KB	Output is correct
44	Correct	2 ms	24148 KB	Output is correct
45	Correct	1 ms	24148 KB	Output is correct
46	Correct	1 ms	24148 KB	Output is correct
47	Correct	1 ms	24148 KB	Output is correct
48	Correct	2 ms	24148 KB	Output is correct
49	Correct	1 ms	24148 KB	Output is correct
50	Correct	1 ms	24148 KB	Output is correct
51	Correct	1 ms	24148 KB	Output is correct
52	Incorrect	1 ms	24148 KB	3rd lines differ - on the 1st token, expected: '9824', found: '9810'
53	Halted	0 ms	0 KB	-

답안 #42755

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