Submission #207207

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
207207	2020-03-06T17:11:25 Z	AlexLuchianov	Ancient Books (IOI17_books)	C++14	50 / 100	219 ms	22812 KB

books

#include "books.h"
#include <cmath>
#include <iostream>
using namespace std;

#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;

int const nmax = 1000000;
int sumright[1 + nmax], sumleft[1 + nmax];

long long minimum_walk(std::vector<int> p, int start) {
  int n = p.size();
  ll result = 0;

  for(int i = 0; i < n; i++){
    result += fabs(p[i] - i);
    if(i < p[i]){
      sumright[i]++;
      sumright[p[i]]--;
    } else if(p[i] < i){
      sumleft[i - 1]++;
      if(0 <= p[i])
        sumleft[p[i] - 1]--;
    }
  }
  for(int i = 1; i < n; i++)
    sumright[i] += sumright[i - 1];
  for(int i = n - 1; 0 <= i; i--)
    sumleft[i] += sumleft[i + 1];

  int active = 0;
  for(int i = n; start <= i; i--){
    active |= (0 < sumright[i]);
    active |= (0 < sumleft[i]);

    if(0 == sumright[i] && 0 == sumleft[i])
      result += active * 2;
    else
      result += fabs(sumright[i] - sumleft[i]);
  }
  active = 0;
  for(int i = 0; i < start; i++){
    active |= (0 < sumright[i]);
    active |= (0 < sumleft[i]);

    if(0 == sumright[i] && 0 == sumleft[i])
      result += active * 2;
    else
      result += fabs(sumright[i] - sumleft[i]);
  }
	return result;
}
/*
6 0
0 1 2 5 4 3
*/

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	380 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	380 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	380 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	372 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	191 ms	22776 KB	Output is correct
31	Correct	190 ms	22776 KB	Output is correct
32	Correct	162 ms	22776 KB	Output is correct
33	Correct	168 ms	22776 KB	Output is correct
34	Correct	179 ms	22712 KB	Output is correct
35	Correct	219 ms	22812 KB	Output is correct
36	Correct	163 ms	22648 KB	Output is correct
37	Correct	179 ms	22776 KB	Output is correct
38	Correct	172 ms	22648 KB	Output is correct
39	Correct	170 ms	22752 KB	Output is correct
40	Correct	195 ms	22760 KB	Output is correct
41	Correct	184 ms	22648 KB	Output is correct
42	Correct	186 ms	22776 KB	Output is correct
43	Correct	180 ms	22648 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	376 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	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	380 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	380 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	380 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	372 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	191 ms	22776 KB	Output is correct
31	Correct	190 ms	22776 KB	Output is correct
32	Correct	162 ms	22776 KB	Output is correct
33	Correct	168 ms	22776 KB	Output is correct
34	Correct	179 ms	22712 KB	Output is correct
35	Correct	219 ms	22812 KB	Output is correct
36	Correct	163 ms	22648 KB	Output is correct
37	Correct	179 ms	22776 KB	Output is correct
38	Correct	172 ms	22648 KB	Output is correct
39	Correct	170 ms	22752 KB	Output is correct
40	Correct	195 ms	22760 KB	Output is correct
41	Correct	184 ms	22648 KB	Output is correct
42	Correct	186 ms	22776 KB	Output is correct
43	Correct	180 ms	22648 KB	Output is correct
44	Incorrect	5 ms	376 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #207207

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