Submission #105224

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
105224	2019-04-11T03:12:57 Z	bert30702	Ancient Books (IOI17_books)	C++17	12 / 100	3 ms	384 KB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
const int MX = 1e6 + 100;
int G[MX];
long long minimum_walk(vector<int> p, int s) {
	while(p.back() == p.size() - 1 and p.back() != s) p.pop_back();
	int n = p.size();
	long long sum = 0;
	for(int i = 0; i < n; i ++) {
		G[p[i]] = max(G[p[i]], i);
		G[i]    = max(G[i], p[i]);
		sum += abs(i - p[i]);
	}
	for(int i = 0; i + 1 < n; i ++) {
		if(p[i] == i and i != s) continue;
		int ptr = i + 1;
		while(ptr <= G[i]) {
			G[i] = max(G[i], G[ptr]);
			ptr ++;
		}
		if(ptr < n) sum += 2;
		i = ptr - 1;
	}
	return sum;
}
//main () {
//	cout << minimum_walk({2, 3, 0, 1}, 0);
//}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:7:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(p.back() == p.size() - 1 and p.back() != s) p.pop_back();
        ~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1

12.0 / 12.0

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

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	256 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	3 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	3 ms	256 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	3 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	256 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	3 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	3 ms	256 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	3 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	256 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	384 KB	Output is correct
2	Correct	3 ms	256 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	3 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	3 ms	256 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Incorrect	3 ms	384 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-