답안 #72840 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72840	2018-08-27T04:28:25 Z	funcsr	고대 책들 (IOI17_books)	C++17	50 / 100	271 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;
  int m = INF,num=0,w=INF;
  int lmost = S, rmost = S;
  rep(i, N) if (!used[i]) {
    if (i == A[i]) continue;
    int x = i;
    int left = x, right = x;
    int ww = INF;
    while (!used[x]) {
      left = min(left, x);
      right = max(x, right);
      ww=min(ww,abs(S-x));

      if (x < A[x]) {
        T[x]++;
        T[A[x]]--;
      }
      used[x] = true;
      x = A[x];
    }
    if (left < S && S < right) lmost = min(lmost, left),num++,w=min(w,ww);
    if (left < S && S < right) rmost = max(rmost, right);
  }

  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);
  }
  */
  if (num==1) {
    cost += w;
  }
  else if (num >= 2) {
    cost += min(rmost-S, S-lmost);
  }
  return 2LL*cost;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:25:7: warning: unused variable 'm' [-Wunused-variable]
   int m = INF,num=0,w=INF;
       ^

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	23800 KB	Output is correct
2	Correct	24 ms	23908 KB	Output is correct
3	Correct	27 ms	23968 KB	Output is correct
4	Correct	24 ms	23968 KB	Output is correct
5	Correct	28 ms	23968 KB	Output is correct
6	Correct	28 ms	24012 KB	Output is correct
7	Correct	23 ms	24060 KB	Output is correct
8	Correct	24 ms	24060 KB	Output is correct
9	Correct	27 ms	24072 KB	Output is correct
10	Correct	25 ms	24072 KB	Output is correct
11	Correct	24 ms	24072 KB	Output is correct
12	Correct	26 ms	24072 KB	Output is correct
13	Correct	21 ms	24072 KB	Output is correct
14	Correct	25 ms	24072 KB	Output is correct
15	Correct	26 ms	24072 KB	Output is correct
16	Correct	24 ms	24072 KB	Output is correct
17	Correct	25 ms	24072 KB	Output is correct
18	Correct	24 ms	24072 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	23800 KB	Output is correct
2	Correct	24 ms	23908 KB	Output is correct
3	Correct	27 ms	23968 KB	Output is correct
4	Correct	24 ms	23968 KB	Output is correct
5	Correct	28 ms	23968 KB	Output is correct
6	Correct	28 ms	24012 KB	Output is correct
7	Correct	23 ms	24060 KB	Output is correct
8	Correct	24 ms	24060 KB	Output is correct
9	Correct	27 ms	24072 KB	Output is correct
10	Correct	25 ms	24072 KB	Output is correct
11	Correct	24 ms	24072 KB	Output is correct
12	Correct	26 ms	24072 KB	Output is correct
13	Correct	21 ms	24072 KB	Output is correct
14	Correct	25 ms	24072 KB	Output is correct
15	Correct	26 ms	24072 KB	Output is correct
16	Correct	24 ms	24072 KB	Output is correct
17	Correct	25 ms	24072 KB	Output is correct
18	Correct	24 ms	24072 KB	Output is correct
19	Correct	24 ms	24072 KB	Output is correct
20	Correct	27 ms	24092 KB	Output is correct
21	Correct	24 ms	24092 KB	Output is correct
22	Correct	25 ms	24092 KB	Output is correct
23	Correct	24 ms	24096 KB	Output is correct
24	Correct	23 ms	24096 KB	Output is correct
25	Correct	24 ms	24096 KB	Output is correct
26	Correct	23 ms	24096 KB	Output is correct
27	Correct	23 ms	24140 KB	Output is correct
28	Correct	24 ms	24140 KB	Output is correct
29	Correct	24 ms	24140 KB	Output is correct
30	Correct	271 ms	36716 KB	Output is correct
31	Correct	246 ms	36844 KB	Output is correct
32	Correct	192 ms	36844 KB	Output is correct
33	Correct	193 ms	36844 KB	Output is correct
34	Correct	194 ms	36844 KB	Output is correct
35	Correct	193 ms	36844 KB	Output is correct
36	Correct	206 ms	36844 KB	Output is correct
37	Correct	180 ms	36844 KB	Output is correct
38	Correct	204 ms	36844 KB	Output is correct
39	Correct	181 ms	36844 KB	Output is correct
40	Correct	216 ms	36844 KB	Output is correct
41	Correct	233 ms	36844 KB	Output is correct
42	Correct	260 ms	36844 KB	Output is correct
43	Correct	174 ms	36860 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	23800 KB	Output is correct
2	Correct	24 ms	23908 KB	Output is correct
3	Correct	27 ms	23968 KB	Output is correct
4	Correct	24 ms	23968 KB	Output is correct
5	Correct	28 ms	23968 KB	Output is correct
6	Correct	28 ms	24012 KB	Output is correct
7	Correct	23 ms	24060 KB	Output is correct
8	Correct	24 ms	24060 KB	Output is correct
9	Correct	27 ms	24072 KB	Output is correct
10	Correct	25 ms	24072 KB	Output is correct
11	Correct	24 ms	24072 KB	Output is correct
12	Correct	26 ms	24072 KB	Output is correct
13	Correct	21 ms	24072 KB	Output is correct
14	Correct	25 ms	24072 KB	Output is correct
15	Correct	26 ms	24072 KB	Output is correct
16	Correct	24 ms	24072 KB	Output is correct
17	Correct	25 ms	24072 KB	Output is correct
18	Correct	24 ms	24072 KB	Output is correct
19	Correct	24 ms	24072 KB	Output is correct
20	Correct	27 ms	24092 KB	Output is correct
21	Correct	24 ms	24092 KB	Output is correct
22	Correct	25 ms	24092 KB	Output is correct
23	Correct	24 ms	24096 KB	Output is correct
24	Correct	23 ms	24096 KB	Output is correct
25	Correct	24 ms	24096 KB	Output is correct
26	Correct	23 ms	24096 KB	Output is correct
27	Correct	23 ms	24140 KB	Output is correct
28	Correct	24 ms	24140 KB	Output is correct
29	Correct	24 ms	24140 KB	Output is correct
30	Correct	271 ms	36716 KB	Output is correct
31	Correct	246 ms	36844 KB	Output is correct
32	Correct	192 ms	36844 KB	Output is correct
33	Correct	193 ms	36844 KB	Output is correct
34	Correct	194 ms	36844 KB	Output is correct
35	Correct	193 ms	36844 KB	Output is correct
36	Correct	206 ms	36844 KB	Output is correct
37	Correct	180 ms	36844 KB	Output is correct
38	Correct	204 ms	36844 KB	Output is correct
39	Correct	181 ms	36844 KB	Output is correct
40	Correct	216 ms	36844 KB	Output is correct
41	Correct	233 ms	36844 KB	Output is correct
42	Correct	260 ms	36844 KB	Output is correct
43	Correct	174 ms	36860 KB	Output is correct
44	Incorrect	26 ms	36860 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3594'
45	Halted	0 ms	0 KB	-

답안 #72840

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