Submission #42757

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
42757	2018-03-03T19:57:26 Z	yusufake	Ancient Books (IOI17_books)	C++	50 / 100	257 ms	24172 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,lll,rrr;
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; }
        }
        lll = ll; rrr = rr;
        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;
        if(lll != ll || rrr != rr) assert(0);
    }
    
    return x + t+t;
}
/*
int main(){
    cout << minimum_walk({1,0,2,3} , 2);
} */

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	1 ms	404 KB	Output is correct
5	Correct	1 ms	404 KB	Output is correct
6	Correct	1 ms	404 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	2 ms	700 KB	Output is correct
9	Correct	1 ms	700 KB	Output is correct
10	Correct	1 ms	700 KB	Output is correct
11	Correct	1 ms	700 KB	Output is correct
12	Correct	1 ms	700 KB	Output is correct
13	Correct	1 ms	700 KB	Output is correct
14	Correct	1 ms	700 KB	Output is correct
15	Correct	1 ms	700 KB	Output is correct
16	Correct	1 ms	700 KB	Output is correct
17	Correct	1 ms	700 KB	Output is correct
18	Correct	1 ms	700 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	1 ms	404 KB	Output is correct
5	Correct	1 ms	404 KB	Output is correct
6	Correct	1 ms	404 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	2 ms	700 KB	Output is correct
9	Correct	1 ms	700 KB	Output is correct
10	Correct	1 ms	700 KB	Output is correct
11	Correct	1 ms	700 KB	Output is correct
12	Correct	1 ms	700 KB	Output is correct
13	Correct	1 ms	700 KB	Output is correct
14	Correct	1 ms	700 KB	Output is correct
15	Correct	1 ms	700 KB	Output is correct
16	Correct	1 ms	700 KB	Output is correct
17	Correct	1 ms	700 KB	Output is correct
18	Correct	1 ms	700 KB	Output is correct
19	Correct	2 ms	700 KB	Output is correct
20	Correct	1 ms	700 KB	Output is correct
21	Correct	2 ms	700 KB	Output is correct
22	Correct	2 ms	700 KB	Output is correct
23	Correct	2 ms	700 KB	Output is correct
24	Correct	2 ms	700 KB	Output is correct
25	Correct	2 ms	700 KB	Output is correct
26	Correct	2 ms	700 KB	Output is correct
27	Correct	2 ms	700 KB	Output is correct
28	Correct	2 ms	700 KB	Output is correct
29	Correct	2 ms	700 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	1 ms	404 KB	Output is correct
5	Correct	1 ms	404 KB	Output is correct
6	Correct	1 ms	404 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	2 ms	700 KB	Output is correct
9	Correct	1 ms	700 KB	Output is correct
10	Correct	1 ms	700 KB	Output is correct
11	Correct	1 ms	700 KB	Output is correct
12	Correct	1 ms	700 KB	Output is correct
13	Correct	1 ms	700 KB	Output is correct
14	Correct	1 ms	700 KB	Output is correct
15	Correct	1 ms	700 KB	Output is correct
16	Correct	1 ms	700 KB	Output is correct
17	Correct	1 ms	700 KB	Output is correct
18	Correct	1 ms	700 KB	Output is correct
19	Correct	2 ms	700 KB	Output is correct
20	Correct	1 ms	700 KB	Output is correct
21	Correct	2 ms	700 KB	Output is correct
22	Correct	2 ms	700 KB	Output is correct
23	Correct	2 ms	700 KB	Output is correct
24	Correct	2 ms	700 KB	Output is correct
25	Correct	2 ms	700 KB	Output is correct
26	Correct	2 ms	700 KB	Output is correct
27	Correct	2 ms	700 KB	Output is correct
28	Correct	2 ms	700 KB	Output is correct
29	Correct	2 ms	700 KB	Output is correct
30	Correct	244 ms	20152 KB	Output is correct
31	Correct	257 ms	20204 KB	Output is correct
32	Correct	148 ms	24044 KB	Output is correct
33	Correct	163 ms	24044 KB	Output is correct
34	Correct	163 ms	24044 KB	Output is correct
35	Correct	163 ms	24044 KB	Output is correct
36	Correct	163 ms	24172 KB	Output is correct
37	Correct	164 ms	24172 KB	Output is correct
38	Correct	174 ms	24172 KB	Output is correct
39	Correct	165 ms	24172 KB	Output is correct
40	Correct	188 ms	24172 KB	Output is correct
41	Correct	219 ms	24172 KB	Output is correct
42	Correct	220 ms	24172 KB	Output is correct
43	Correct	173 ms	24172 KB	Output is correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	24172 KB	Output is correct
2	Correct	2 ms	24172 KB	Output is correct
3	Correct	2 ms	24172 KB	Output is correct
4	Runtime error	2 ms	24172 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
5	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	1 ms	404 KB	Output is correct
5	Correct	1 ms	404 KB	Output is correct
6	Correct	1 ms	404 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	2 ms	700 KB	Output is correct
9	Correct	1 ms	700 KB	Output is correct
10	Correct	1 ms	700 KB	Output is correct
11	Correct	1 ms	700 KB	Output is correct
12	Correct	1 ms	700 KB	Output is correct
13	Correct	1 ms	700 KB	Output is correct
14	Correct	1 ms	700 KB	Output is correct
15	Correct	1 ms	700 KB	Output is correct
16	Correct	1 ms	700 KB	Output is correct
17	Correct	1 ms	700 KB	Output is correct
18	Correct	1 ms	700 KB	Output is correct
19	Correct	2 ms	700 KB	Output is correct
20	Correct	1 ms	700 KB	Output is correct
21	Correct	2 ms	700 KB	Output is correct
22	Correct	2 ms	700 KB	Output is correct
23	Correct	2 ms	700 KB	Output is correct
24	Correct	2 ms	700 KB	Output is correct
25	Correct	2 ms	700 KB	Output is correct
26	Correct	2 ms	700 KB	Output is correct
27	Correct	2 ms	700 KB	Output is correct
28	Correct	2 ms	700 KB	Output is correct
29	Correct	2 ms	700 KB	Output is correct
30	Correct	244 ms	20152 KB	Output is correct
31	Correct	257 ms	20204 KB	Output is correct
32	Correct	148 ms	24044 KB	Output is correct
33	Correct	163 ms	24044 KB	Output is correct
34	Correct	163 ms	24044 KB	Output is correct
35	Correct	163 ms	24044 KB	Output is correct
36	Correct	163 ms	24172 KB	Output is correct
37	Correct	164 ms	24172 KB	Output is correct
38	Correct	174 ms	24172 KB	Output is correct
39	Correct	165 ms	24172 KB	Output is correct
40	Correct	188 ms	24172 KB	Output is correct
41	Correct	219 ms	24172 KB	Output is correct
42	Correct	220 ms	24172 KB	Output is correct
43	Correct	173 ms	24172 KB	Output is correct
44	Correct	2 ms	24172 KB	Output is correct
45	Correct	2 ms	24172 KB	Output is correct
46	Correct	2 ms	24172 KB	Output is correct
47	Runtime error	2 ms	24172 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
48	Halted	0 ms	0 KB	-