Submission #73113

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
73113	2018-08-27T16:30:15 Z	aleksam	Ancient Books (IOI17_books)	C++14	50 / 100	319 ms	25956 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
		}
	}
	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);
	}
	int scom=0, lcom=0, rcom=0;
	for(int i=0; i<numcyc; ++i){
		ans+=C[i].sum;
		if(C[i].l<=rcom){
			//Mogu da ga uhvatim, i dalje sam u istoj komponenti
		}
		else{
			if(s>=lcom && s<=rcom)//Menjam komponentu
				scom=numcom;
			numcom++;
			lcom=C[i].l;
		}
		if(C[i].r>rcom)
			rcom=C[i].r;
	}
	ans+=2*numcom;
	ans+=scom<numcom-scom?scom:numcom-scom;
	
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	248 KB	Output is correct
2	Correct	3 ms	356 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	2 ms	560 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	560 KB	Output is correct
9	Correct	3 ms	560 KB	Output is correct
10	Correct	3 ms	560 KB	Output is correct
11	Correct	2 ms	560 KB	Output is correct
12	Correct	2 ms	560 KB	Output is correct
13	Correct	2 ms	560 KB	Output is correct
14	Correct	2 ms	560 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	2 ms	628 KB	Output is correct
17	Correct	2 ms	628 KB	Output is correct
18	Correct	2 ms	628 KB	Output is correct
19	Correct	3 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	3 ms	636 KB	Output is correct
22	Correct	3 ms	636 KB	Output is correct
23	Correct	3 ms	636 KB	Output is correct
24	Correct	3 ms	636 KB	Output is correct
25	Correct	3 ms	636 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	3 ms	636 KB	Output is correct
28	Correct	3 ms	636 KB	Output is correct
29	Correct	3 ms	636 KB	Output is correct
30	Correct	312 ms	9420 KB	Output is correct
31	Correct	319 ms	9468 KB	Output is correct
32	Correct	155 ms	9468 KB	Output is correct
33	Correct	186 ms	25768 KB	Output is correct
34	Correct	209 ms	25768 KB	Output is correct
35	Correct	188 ms	25892 KB	Output is correct
36	Correct	191 ms	25892 KB	Output is correct
37	Correct	187 ms	25892 KB	Output is correct
38	Correct	192 ms	25892 KB	Output is correct
39	Correct	175 ms	25892 KB	Output is correct
40	Correct	186 ms	25892 KB	Output is correct
41	Correct	250 ms	25892 KB	Output is correct
42	Correct	288 ms	25892 KB	Output is correct
43	Correct	198 ms	25956 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	25956 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	3 ms	248 KB	Output is correct
2	Correct	3 ms	356 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	2 ms	560 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	560 KB	Output is correct
9	Correct	3 ms	560 KB	Output is correct
10	Correct	3 ms	560 KB	Output is correct
11	Correct	2 ms	560 KB	Output is correct
12	Correct	2 ms	560 KB	Output is correct
13	Correct	2 ms	560 KB	Output is correct
14	Correct	2 ms	560 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	2 ms	628 KB	Output is correct
17	Correct	2 ms	628 KB	Output is correct
18	Correct	2 ms	628 KB	Output is correct
19	Correct	3 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	3 ms	636 KB	Output is correct
22	Correct	3 ms	636 KB	Output is correct
23	Correct	3 ms	636 KB	Output is correct
24	Correct	3 ms	636 KB	Output is correct
25	Correct	3 ms	636 KB	Output is correct
26	Correct	2 ms	636 KB	Output is correct
27	Correct	3 ms	636 KB	Output is correct
28	Correct	3 ms	636 KB	Output is correct
29	Correct	3 ms	636 KB	Output is correct
30	Correct	312 ms	9420 KB	Output is correct
31	Correct	319 ms	9468 KB	Output is correct
32	Correct	155 ms	9468 KB	Output is correct
33	Correct	186 ms	25768 KB	Output is correct
34	Correct	209 ms	25768 KB	Output is correct
35	Correct	188 ms	25892 KB	Output is correct
36	Correct	191 ms	25892 KB	Output is correct
37	Correct	187 ms	25892 KB	Output is correct
38	Correct	192 ms	25892 KB	Output is correct
39	Correct	175 ms	25892 KB	Output is correct
40	Correct	186 ms	25892 KB	Output is correct
41	Correct	250 ms	25892 KB	Output is correct
42	Correct	288 ms	25892 KB	Output is correct
43	Correct	198 ms	25956 KB	Output is correct
44	Incorrect	2 ms	25956 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #73113

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