답안 #72837 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72837	2018-08-27T04:15:19 Z	funcsr	고대 책들 (IOI17_books)	C++17	50 / 100	330 ms	36860 KB

books

#include "books.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cassert>
using namespace std;
#define rep(i,n)for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
typedef pair<int, int> P;

int N;
bool used[1000000];
int T[1000000];
vector<int> G[1000000];

long long minimum_walk(vector<int> A, int S) {
  N = A.size();
  vector<P> ps;
  rep(i, N) if (!used[i]) {
    if (i == A[i]) continue;
    int x = i;
    int left = x, right = x;
    int lmin = INF, rmin = INF;
    int w = INF;
    while (!used[x]) {
      w = min(w, abs(x-S));
      left = min(left, x);
      right = max(x, right);

      if (x <= S) lmin = min(lmin, S-x);
      else rmin = min(rmin, x-S);

      if (x < A[x]) {
        T[x]++;
        T[A[x]]--;
      }
      used[x] = true;
      x = A[x];
    }
    if (left < S && S < right) G[lmin].pb(rmin);
  }

  rep(i,N-1) T[i+1] += T[i];
  long long cost = 0;
  bool yes = false;
  for (int i=N-1; i>=S; i--) {
    if (T[i])yes=true;
    cost += max(T[i], (int)yes);
  }
  yes = false;
  for (int i=0; i<S; i++) {
    if (T[i])yes=true;
    cost += max(T[i], (int)yes);
  }

  int m = INF;
  int rm = 0;
  for (int left=N-1; left>=0; left--) {
    m = min(m, left+rm);
    for (int r : G[left]) rm = max(rm, r);
  }
  cost += m;
  return 2LL*cost;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23764 KB	Output is correct
2	Correct	22 ms	23948 KB	Output is correct
3	Correct	21 ms	23976 KB	Output is correct
4	Correct	23 ms	24040 KB	Output is correct
5	Correct	24 ms	24040 KB	Output is correct
6	Correct	21 ms	24040 KB	Output is correct
7	Correct	23 ms	24040 KB	Output is correct
8	Correct	22 ms	24040 KB	Output is correct
9	Correct	22 ms	24040 KB	Output is correct
10	Correct	23 ms	24040 KB	Output is correct
11	Correct	22 ms	24040 KB	Output is correct
12	Correct	24 ms	24120 KB	Output is correct
13	Correct	22 ms	24120 KB	Output is correct
14	Correct	21 ms	24120 KB	Output is correct
15	Correct	25 ms	24120 KB	Output is correct
16	Correct	23 ms	24120 KB	Output is correct
17	Correct	22 ms	24120 KB	Output is correct
18	Correct	22 ms	24120 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23764 KB	Output is correct
2	Correct	22 ms	23948 KB	Output is correct
3	Correct	21 ms	23976 KB	Output is correct
4	Correct	23 ms	24040 KB	Output is correct
5	Correct	24 ms	24040 KB	Output is correct
6	Correct	21 ms	24040 KB	Output is correct
7	Correct	23 ms	24040 KB	Output is correct
8	Correct	22 ms	24040 KB	Output is correct
9	Correct	22 ms	24040 KB	Output is correct
10	Correct	23 ms	24040 KB	Output is correct
11	Correct	22 ms	24040 KB	Output is correct
12	Correct	24 ms	24120 KB	Output is correct
13	Correct	22 ms	24120 KB	Output is correct
14	Correct	21 ms	24120 KB	Output is correct
15	Correct	25 ms	24120 KB	Output is correct
16	Correct	23 ms	24120 KB	Output is correct
17	Correct	22 ms	24120 KB	Output is correct
18	Correct	22 ms	24120 KB	Output is correct
19	Correct	22 ms	24120 KB	Output is correct
20	Correct	24 ms	24120 KB	Output is correct
21	Correct	23 ms	24120 KB	Output is correct
22	Correct	22 ms	24120 KB	Output is correct
23	Correct	22 ms	24120 KB	Output is correct
24	Correct	28 ms	24120 KB	Output is correct
25	Correct	25 ms	24120 KB	Output is correct
26	Correct	21 ms	24120 KB	Output is correct
27	Correct	25 ms	24120 KB	Output is correct
28	Correct	22 ms	24120 KB	Output is correct
29	Correct	26 ms	24120 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23764 KB	Output is correct
2	Correct	22 ms	23948 KB	Output is correct
3	Correct	21 ms	23976 KB	Output is correct
4	Correct	23 ms	24040 KB	Output is correct
5	Correct	24 ms	24040 KB	Output is correct
6	Correct	21 ms	24040 KB	Output is correct
7	Correct	23 ms	24040 KB	Output is correct
8	Correct	22 ms	24040 KB	Output is correct
9	Correct	22 ms	24040 KB	Output is correct
10	Correct	23 ms	24040 KB	Output is correct
11	Correct	22 ms	24040 KB	Output is correct
12	Correct	24 ms	24120 KB	Output is correct
13	Correct	22 ms	24120 KB	Output is correct
14	Correct	21 ms	24120 KB	Output is correct
15	Correct	25 ms	24120 KB	Output is correct
16	Correct	23 ms	24120 KB	Output is correct
17	Correct	22 ms	24120 KB	Output is correct
18	Correct	22 ms	24120 KB	Output is correct
19	Correct	22 ms	24120 KB	Output is correct
20	Correct	24 ms	24120 KB	Output is correct
21	Correct	23 ms	24120 KB	Output is correct
22	Correct	22 ms	24120 KB	Output is correct
23	Correct	22 ms	24120 KB	Output is correct
24	Correct	28 ms	24120 KB	Output is correct
25	Correct	25 ms	24120 KB	Output is correct
26	Correct	21 ms	24120 KB	Output is correct
27	Correct	25 ms	24120 KB	Output is correct
28	Correct	22 ms	24120 KB	Output is correct
29	Correct	26 ms	24120 KB	Output is correct
30	Correct	312 ms	36836 KB	Output is correct
31	Correct	307 ms	36836 KB	Output is correct
32	Correct	184 ms	36836 KB	Output is correct
33	Correct	187 ms	36836 KB	Output is correct
34	Correct	194 ms	36836 KB	Output is correct
35	Correct	181 ms	36836 KB	Output is correct
36	Correct	272 ms	36836 KB	Output is correct
37	Correct	271 ms	36836 KB	Output is correct
38	Correct	201 ms	36836 KB	Output is correct
39	Correct	215 ms	36836 KB	Output is correct
40	Correct	218 ms	36860 KB	Output is correct
41	Correct	245 ms	36860 KB	Output is correct
42	Correct	330 ms	36860 KB	Output is correct
43	Correct	209 ms	36860 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	23 ms	36860 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3590'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23764 KB	Output is correct
2	Correct	22 ms	23948 KB	Output is correct
3	Correct	21 ms	23976 KB	Output is correct
4	Correct	23 ms	24040 KB	Output is correct
5	Correct	24 ms	24040 KB	Output is correct
6	Correct	21 ms	24040 KB	Output is correct
7	Correct	23 ms	24040 KB	Output is correct
8	Correct	22 ms	24040 KB	Output is correct
9	Correct	22 ms	24040 KB	Output is correct
10	Correct	23 ms	24040 KB	Output is correct
11	Correct	22 ms	24040 KB	Output is correct
12	Correct	24 ms	24120 KB	Output is correct
13	Correct	22 ms	24120 KB	Output is correct
14	Correct	21 ms	24120 KB	Output is correct
15	Correct	25 ms	24120 KB	Output is correct
16	Correct	23 ms	24120 KB	Output is correct
17	Correct	22 ms	24120 KB	Output is correct
18	Correct	22 ms	24120 KB	Output is correct
19	Correct	22 ms	24120 KB	Output is correct
20	Correct	24 ms	24120 KB	Output is correct
21	Correct	23 ms	24120 KB	Output is correct
22	Correct	22 ms	24120 KB	Output is correct
23	Correct	22 ms	24120 KB	Output is correct
24	Correct	28 ms	24120 KB	Output is correct
25	Correct	25 ms	24120 KB	Output is correct
26	Correct	21 ms	24120 KB	Output is correct
27	Correct	25 ms	24120 KB	Output is correct
28	Correct	22 ms	24120 KB	Output is correct
29	Correct	26 ms	24120 KB	Output is correct
30	Correct	312 ms	36836 KB	Output is correct
31	Correct	307 ms	36836 KB	Output is correct
32	Correct	184 ms	36836 KB	Output is correct
33	Correct	187 ms	36836 KB	Output is correct
34	Correct	194 ms	36836 KB	Output is correct
35	Correct	181 ms	36836 KB	Output is correct
36	Correct	272 ms	36836 KB	Output is correct
37	Correct	271 ms	36836 KB	Output is correct
38	Correct	201 ms	36836 KB	Output is correct
39	Correct	215 ms	36836 KB	Output is correct
40	Correct	218 ms	36860 KB	Output is correct
41	Correct	245 ms	36860 KB	Output is correct
42	Correct	330 ms	36860 KB	Output is correct
43	Correct	209 ms	36860 KB	Output is correct
44	Incorrect	23 ms	36860 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45	Halted	0 ms	0 KB	-

답안 #72837

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