Submission #289306

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
289306	2020-09-02T14:26:10 Z	Touubs	Ancient Books (IOI17_books)	C++17	50 / 100	156 ms	8388 KB

books

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

long long minimum_walk(std::vector<int> p, int s) {
    std::vector<bool> visited(p.size());
    long long res = 0;
    int maxVis = 0;
    for (int i = 0; i < p.size() && p[i] == i && i < s; i++);

    for (int i = 0; i < p.size(); i++) {
	if (maxVis < i) res+=2;
	res += abs(p[i] - i);
	maxVis = std::max(maxVis, p[i]);
    }
    for (int i = p.size() - 1; i > s && p[i] == i ; i--, res-=2);
    return res;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < p.size() && p[i] == i && i < s; i++);
      |                     ~~^~~~~~~~~~
books.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < p.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	156 ms	8388 KB	Output is correct
31	Correct	155 ms	8312 KB	Output is correct
32	Correct	153 ms	8312 KB	Output is correct
33	Correct	135 ms	8312 KB	Output is correct
34	Correct	130 ms	8312 KB	Output is correct
35	Correct	134 ms	8312 KB	Output is correct
36	Correct	131 ms	8252 KB	Output is correct
37	Correct	133 ms	8316 KB	Output is correct
38	Correct	155 ms	8312 KB	Output is correct
39	Correct	144 ms	8312 KB	Output is correct
40	Correct	148 ms	8312 KB	Output is correct
41	Correct	156 ms	8312 KB	Output is correct
42	Correct	155 ms	8344 KB	Output is correct
43	Correct	132 ms	8316 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	288 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	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	156 ms	8388 KB	Output is correct
31	Correct	155 ms	8312 KB	Output is correct
32	Correct	153 ms	8312 KB	Output is correct
33	Correct	135 ms	8312 KB	Output is correct
34	Correct	130 ms	8312 KB	Output is correct
35	Correct	134 ms	8312 KB	Output is correct
36	Correct	131 ms	8252 KB	Output is correct
37	Correct	133 ms	8316 KB	Output is correct
38	Correct	155 ms	8312 KB	Output is correct
39	Correct	144 ms	8312 KB	Output is correct
40	Correct	148 ms	8312 KB	Output is correct
41	Correct	156 ms	8312 KB	Output is correct
42	Correct	155 ms	8344 KB	Output is correct
43	Correct	132 ms	8316 KB	Output is correct
44	Incorrect	1 ms	288 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #289306

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