Submission #71803

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
71803	2018-08-25T16:13:37 Z	nirshalmon	Ancient Books (IOI17_books)	C++14	0 / 100	3 ms	592 KB

books

#include "books.h"
#include<bits/stdc++.h>

using namespace std;

long long minimum_walk(std::vector<int> p, int s) {
	long long base = -2;
	int mx = -1;
	int f = 0, l = p.size() - 1;
	for (; f < p.size(); ++f) {
		if (p[f] != f) break;
	}
	for (; l >= 0; --l) {
		if (p[l] != l) break;
	}
	if (l == 0) return 0;
	for (int i = f; i <= l; ++i) {
		base += abs(p[i] - i);
		mx = max(p[i], mx);
		if (mx <= i) 
			base += 2;
	}
	if (s < f) base += 2 * (f - s);
	if (s > l) base += 2 * (s - l);
	return base;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:10:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; f < p.size(); ++f) {
         ~~^~~~~~~~~~

Subtask #1

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Incorrect	2 ms	592 KB	3rd lines differ - on the 1st token, expected: '0', found: '8'
10	Halted	0 ms	0 KB	-

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Incorrect	2 ms	592 KB	3rd lines differ - on the 1st token, expected: '0', found: '8'
10	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	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Incorrect	2 ms	592 KB	3rd lines differ - on the 1st token, expected: '0', found: '8'
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	3 ms	592 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	484 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Incorrect	2 ms	592 KB	3rd lines differ - on the 1st token, expected: '0', found: '8'
10	Halted	0 ms	0 KB	-