Submission #73109

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
73109	2018-08-27T16:22:59 Z	aleksam	Ancient Books (IOI17_books)	C++14	50 / 100	320 ms	25960 KB

books

#include "books.h"

#include <bits/stdc++.h>
#define MAX_N 1000000
using namespace std;

struct cikl{
	int l, r;//Najlevlji i najdesnji
	long long sum;//suma p_i-i na ciklusu.
};

long long aps(int a){
	return a>0?a:-1*a;
}
vector<cikl> C;
int numcyc=0, numcom=0;//broj ciklova
int N;
long long ans=0;
bool mark[MAX_N];

long long minimum_walk(vector<int> p, int s){
	//Ako je s=0 i n<1000
	N=p.size();
	while(N && p[N-1]==N-1){
		N--;//Ovaj deo mi ionako ne treba
	}
	if(!N)return 0;
	for(int i=0; i<N; ++i){
		if(!mark[i]){
			numcyc++;
			cikl A;
			A.l=A.r=i;
			A.sum=0;
			int cur=i;
			do{
				cur=p[cur];
				if(cur>A.r)A.r=cur;
				if(cur<A.l)A.l=cur;
				A.sum+=aps(p[cur]-cur);
				mark[cur]=1;
			}while(i!=cur);
			C.push_back(A);
			//Ovako formiran niz ciklova je sortiran prema levom kraju--koji je uvek i
		}
	}
	int r=0;//Desna granica dosadasnjih ciklova;
	ans=0;
	for(int i=0; i<numcyc; ++i){
		//printf("C[%d]:%d %d %d;\n", i, C[i].l, C[i].r, C[i].sum);
	}
	
	for(int i=0; i<numcyc; ++i){
		ans+=C[i].sum;
		if(C[i].l<=r){
			//Mogu da ga uhvatim, i dalje sam u istoj komponenti
		}
		else{
			numcom++;
		}
		if(C[i].r>r)
			r=C[i].r;
	}
	ans+=2*numcom;
	return ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	472 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	684 KB	Output is correct
8	Correct	2 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	3 ms	684 KB	Output is correct
12	Correct	3 ms	684 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	2 ms	684 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	4 ms	684 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	472 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	684 KB	Output is correct
8	Correct	2 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	3 ms	684 KB	Output is correct
12	Correct	3 ms	684 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	2 ms	684 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	4 ms	684 KB	Output is correct
19	Correct	3 ms	684 KB	Output is correct
20	Correct	3 ms	684 KB	Output is correct
21	Correct	3 ms	684 KB	Output is correct
22	Correct	3 ms	684 KB	Output is correct
23	Correct	3 ms	684 KB	Output is correct
24	Correct	3 ms	684 KB	Output is correct
25	Correct	2 ms	684 KB	Output is correct
26	Correct	3 ms	684 KB	Output is correct
27	Correct	3 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	2 ms	748 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	472 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	684 KB	Output is correct
8	Correct	2 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	3 ms	684 KB	Output is correct
12	Correct	3 ms	684 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	2 ms	684 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	4 ms	684 KB	Output is correct
19	Correct	3 ms	684 KB	Output is correct
20	Correct	3 ms	684 KB	Output is correct
21	Correct	3 ms	684 KB	Output is correct
22	Correct	3 ms	684 KB	Output is correct
23	Correct	3 ms	684 KB	Output is correct
24	Correct	3 ms	684 KB	Output is correct
25	Correct	2 ms	684 KB	Output is correct
26	Correct	3 ms	684 KB	Output is correct
27	Correct	3 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	2 ms	748 KB	Output is correct
30	Correct	260 ms	9352 KB	Output is correct
31	Correct	320 ms	9352 KB	Output is correct
32	Correct	164 ms	9352 KB	Output is correct
33	Correct	209 ms	25880 KB	Output is correct
34	Correct	209 ms	25880 KB	Output is correct
35	Correct	180 ms	25912 KB	Output is correct
36	Correct	194 ms	25912 KB	Output is correct
37	Correct	157 ms	25912 KB	Output is correct
38	Correct	163 ms	25912 KB	Output is correct
39	Correct	190 ms	25912 KB	Output is correct
40	Correct	178 ms	25912 KB	Output is correct
41	Correct	209 ms	25912 KB	Output is correct
42	Correct	185 ms	25912 KB	Output is correct
43	Correct	224 ms	25960 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	3 ms	25960 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	472 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	684 KB	Output is correct
8	Correct	2 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	3 ms	684 KB	Output is correct
12	Correct	3 ms	684 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	3 ms	684 KB	Output is correct
15	Correct	2 ms	684 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	3 ms	684 KB	Output is correct
18	Correct	4 ms	684 KB	Output is correct
19	Correct	3 ms	684 KB	Output is correct
20	Correct	3 ms	684 KB	Output is correct
21	Correct	3 ms	684 KB	Output is correct
22	Correct	3 ms	684 KB	Output is correct
23	Correct	3 ms	684 KB	Output is correct
24	Correct	3 ms	684 KB	Output is correct
25	Correct	2 ms	684 KB	Output is correct
26	Correct	3 ms	684 KB	Output is correct
27	Correct	3 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	2 ms	748 KB	Output is correct
30	Correct	260 ms	9352 KB	Output is correct
31	Correct	320 ms	9352 KB	Output is correct
32	Correct	164 ms	9352 KB	Output is correct
33	Correct	209 ms	25880 KB	Output is correct
34	Correct	209 ms	25880 KB	Output is correct
35	Correct	180 ms	25912 KB	Output is correct
36	Correct	194 ms	25912 KB	Output is correct
37	Correct	157 ms	25912 KB	Output is correct
38	Correct	163 ms	25912 KB	Output is correct
39	Correct	190 ms	25912 KB	Output is correct
40	Correct	178 ms	25912 KB	Output is correct
41	Correct	209 ms	25912 KB	Output is correct
42	Correct	185 ms	25912 KB	Output is correct
43	Correct	224 ms	25960 KB	Output is correct
44	Incorrect	3 ms	25960 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #73109

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