답안 #72833 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72833	2018-08-27T04:06:24 Z	funcsr	고대 책들 (IOI17_books)	C++17	50 / 100	327 ms	36888 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();
  int m = INF;
  bool contains = false;
  rep(i, N) if (!used[i]) {
    if (i == A[i]) continue;
    int x = i;
    while (!used[x]) {
      m = min(m, abs(x-S));
      if (x < A[x]) {
        if (x < S && S < A[x]) contains = true;
        T[x]++;
        T[A[x]]--;
      }
      used[x] = true;
      x = A[x];
    }
  }

  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);
  }
  //cout<<"m="<<m<<"\n";
  yes = false;
  for (int i=0; i<S; i++) {
    if (T[i])yes=true;
    cost += max(T[i], (int)yes);
  }
  if (contains) cost += m;
  return 2LL*cost;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23800 KB	Output is correct
2	Correct	24 ms	23912 KB	Output is correct
3	Correct	21 ms	23912 KB	Output is correct
4	Correct	22 ms	23912 KB	Output is correct
5	Correct	21 ms	23912 KB	Output is correct
6	Correct	22 ms	24016 KB	Output is correct
7	Correct	22 ms	24016 KB	Output is correct
8	Correct	22 ms	24080 KB	Output is correct
9	Correct	22 ms	24140 KB	Output is correct
10	Correct	23 ms	24140 KB	Output is correct
11	Correct	27 ms	24140 KB	Output is correct
12	Correct	24 ms	24140 KB	Output is correct
13	Correct	23 ms	24188 KB	Output is correct
14	Correct	23 ms	24188 KB	Output is correct
15	Correct	22 ms	24188 KB	Output is correct
16	Correct	24 ms	24188 KB	Output is correct
17	Correct	22 ms	24188 KB	Output is correct
18	Correct	24 ms	24188 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23800 KB	Output is correct
2	Correct	24 ms	23912 KB	Output is correct
3	Correct	21 ms	23912 KB	Output is correct
4	Correct	22 ms	23912 KB	Output is correct
5	Correct	21 ms	23912 KB	Output is correct
6	Correct	22 ms	24016 KB	Output is correct
7	Correct	22 ms	24016 KB	Output is correct
8	Correct	22 ms	24080 KB	Output is correct
9	Correct	22 ms	24140 KB	Output is correct
10	Correct	23 ms	24140 KB	Output is correct
11	Correct	27 ms	24140 KB	Output is correct
12	Correct	24 ms	24140 KB	Output is correct
13	Correct	23 ms	24188 KB	Output is correct
14	Correct	23 ms	24188 KB	Output is correct
15	Correct	22 ms	24188 KB	Output is correct
16	Correct	24 ms	24188 KB	Output is correct
17	Correct	22 ms	24188 KB	Output is correct
18	Correct	24 ms	24188 KB	Output is correct
19	Correct	23 ms	24188 KB	Output is correct
20	Correct	25 ms	24188 KB	Output is correct
21	Correct	26 ms	24188 KB	Output is correct
22	Correct	23 ms	24188 KB	Output is correct
23	Correct	22 ms	24188 KB	Output is correct
24	Correct	23 ms	24188 KB	Output is correct
25	Correct	23 ms	24188 KB	Output is correct
26	Correct	22 ms	24188 KB	Output is correct
27	Correct	23 ms	24188 KB	Output is correct
28	Correct	25 ms	24188 KB	Output is correct
29	Correct	22 ms	24188 KB	Output is correct
30	Correct	259 ms	36732 KB	Output is correct
31	Correct	268 ms	36744 KB	Output is correct
32	Correct	188 ms	36744 KB	Output is correct
33	Correct	216 ms	36744 KB	Output is correct
34	Correct	197 ms	36748 KB	Output is correct
35	Correct	219 ms	36772 KB	Output is correct
36	Correct	175 ms	36860 KB	Output is correct
37	Correct	206 ms	36860 KB	Output is correct
38	Correct	208 ms	36860 KB	Output is correct
39	Correct	204 ms	36860 KB	Output is correct
40	Correct	197 ms	36860 KB	Output is correct
41	Correct	255 ms	36860 KB	Output is correct
42	Correct	327 ms	36888 KB	Output is correct
43	Correct	212 ms	36888 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23800 KB	Output is correct
2	Correct	24 ms	23912 KB	Output is correct
3	Correct	21 ms	23912 KB	Output is correct
4	Correct	22 ms	23912 KB	Output is correct
5	Correct	21 ms	23912 KB	Output is correct
6	Correct	22 ms	24016 KB	Output is correct
7	Correct	22 ms	24016 KB	Output is correct
8	Correct	22 ms	24080 KB	Output is correct
9	Correct	22 ms	24140 KB	Output is correct
10	Correct	23 ms	24140 KB	Output is correct
11	Correct	27 ms	24140 KB	Output is correct
12	Correct	24 ms	24140 KB	Output is correct
13	Correct	23 ms	24188 KB	Output is correct
14	Correct	23 ms	24188 KB	Output is correct
15	Correct	22 ms	24188 KB	Output is correct
16	Correct	24 ms	24188 KB	Output is correct
17	Correct	22 ms	24188 KB	Output is correct
18	Correct	24 ms	24188 KB	Output is correct
19	Correct	23 ms	24188 KB	Output is correct
20	Correct	25 ms	24188 KB	Output is correct
21	Correct	26 ms	24188 KB	Output is correct
22	Correct	23 ms	24188 KB	Output is correct
23	Correct	22 ms	24188 KB	Output is correct
24	Correct	23 ms	24188 KB	Output is correct
25	Correct	23 ms	24188 KB	Output is correct
26	Correct	22 ms	24188 KB	Output is correct
27	Correct	23 ms	24188 KB	Output is correct
28	Correct	25 ms	24188 KB	Output is correct
29	Correct	22 ms	24188 KB	Output is correct
30	Correct	259 ms	36732 KB	Output is correct
31	Correct	268 ms	36744 KB	Output is correct
32	Correct	188 ms	36744 KB	Output is correct
33	Correct	216 ms	36744 KB	Output is correct
34	Correct	197 ms	36748 KB	Output is correct
35	Correct	219 ms	36772 KB	Output is correct
36	Correct	175 ms	36860 KB	Output is correct
37	Correct	206 ms	36860 KB	Output is correct
38	Correct	208 ms	36860 KB	Output is correct
39	Correct	204 ms	36860 KB	Output is correct
40	Correct	197 ms	36860 KB	Output is correct
41	Correct	255 ms	36860 KB	Output is correct
42	Correct	327 ms	36888 KB	Output is correct
43	Correct	212 ms	36888 KB	Output is correct
44	Incorrect	23 ms	36888 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #72833

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