Submission #73309

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
73309	2018-08-28T07:06:41 Z	Sa1378	Ancient Books (IOI17_books)	C++17	12 / 100	4 ms	676 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N ((int)1001*1000)

int n;
ll prt[N],ans;

ll minimum_walk(vector<int> p, int s)
{
	if(s)return 0;
	n=p.size();
	for(int i=0;i<n;i++)
	{
		prt[min(i,p[i])]++;
		prt[max(i,p[i])]--;
	}
	for(int i=0;i<n;i++)
	{
		if(i)prt[i]+=prt[i-1];
		ans+=prt[i];
	}
	if(!ans)return ans;
	for(int i=0;i<n;i++)
	{
		if(prt[i])break;
		ans+=2;
	}
	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	376 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	3 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	4 ms	560 KB	Output is correct
11	Correct	3 ms	560 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	376 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	3 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	4 ms	560 KB	Output is correct
11	Correct	3 ms	560 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	3 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	2 ms	676 KB	Output is correct
22	Incorrect	2 ms	676 KB	3rd lines differ - on the 1st token, expected: '2082', found: '788'
23	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	376 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	3 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	4 ms	560 KB	Output is correct
11	Correct	3 ms	560 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	3 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	2 ms	676 KB	Output is correct
22	Incorrect	2 ms	676 KB	3rd lines differ - on the 1st token, expected: '2082', found: '788'
23	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	676 KB	3rd lines differ - on the 1st token, expected: '3304', found: '0'
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	376 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	3 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	4 ms	560 KB	Output is correct
11	Correct	3 ms	560 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	3 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	2 ms	676 KB	Output is correct
22	Incorrect	2 ms	676 KB	3rd lines differ - on the 1st token, expected: '2082', found: '788'
23	Halted	0 ms	0 KB	-