oj.uz

Submission #72835

# Submission time Handle Problem Language Result Execution time Memory
72835 2018-08-27T04:09:57 Z funcsr Ancient Books (IOI17_books) C++17
50 / 100
 398 ms 36860 KB 
#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 = 0;
  bool contains = false;
  rep(i, N) if (!used[i]) {
    if (i == A[i]) continue;
    int x = i;
    int left = x, right = x;
    int w = INF;
    while (!used[x]) {
      w = min(w, abs(x-S));
      left = min(left, x);
      right = max(x, right);
      if (x < A[x]) {
        T[x]++;
        T[A[x]]--;
      }
      used[x] = true;
      x = A[x];
    }
    if (left <= S && S <= right) m = max(m, w);
  }

  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);
  }
  cost += m;
  return 2LL*cost;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:25:8: warning: unused variable 'contains' [-Wunused-variable]
   bool contains = false;
        ^~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23804 KB Output is correct
2 Correct 22 ms 23804 KB Output is correct
3 Correct 21 ms 23836 KB Output is correct
4 Correct 21 ms 23852 KB Output is correct
5 Correct 25 ms 23852 KB Output is correct
6 Correct 21 ms 23916 KB Output is correct
7 Correct 24 ms 23948 KB Output is correct
8 Correct 26 ms 23952 KB Output is correct
9 Correct 23 ms 23952 KB Output is correct
10 Correct 21 ms 23952 KB Output is correct
11 Correct 21 ms 23952 KB Output is correct
12 Correct 22 ms 23960 KB Output is correct
13 Correct 24 ms 24008 KB Output is correct
14 Correct 22 ms 24148 KB Output is correct
15 Correct 23 ms 24148 KB Output is correct
16 Correct 22 ms 24148 KB Output is correct
17 Correct 23 ms 24148 KB Output is correct
18 Correct 22 ms 24148 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23804 KB Output is correct
2 Correct 22 ms 23804 KB Output is correct
3 Correct 21 ms 23836 KB Output is correct
4 Correct 21 ms 23852 KB Output is correct
5 Correct 25 ms 23852 KB Output is correct
6 Correct 21 ms 23916 KB Output is correct
7 Correct 24 ms 23948 KB Output is correct
8 Correct 26 ms 23952 KB Output is correct
9 Correct 23 ms 23952 KB Output is correct
10 Correct 21 ms 23952 KB Output is correct
11 Correct 21 ms 23952 KB Output is correct
12 Correct 22 ms 23960 KB Output is correct
13 Correct 24 ms 24008 KB Output is correct
14 Correct 22 ms 24148 KB Output is correct
15 Correct 23 ms 24148 KB Output is correct
16 Correct 22 ms 24148 KB Output is correct
17 Correct 23 ms 24148 KB Output is correct
18 Correct 22 ms 24148 KB Output is correct
19 Correct 24 ms 24148 KB Output is correct
20 Correct 30 ms 24148 KB Output is correct
21 Correct 30 ms 24148 KB Output is correct
22 Correct 28 ms 24148 KB Output is correct
23 Correct 21 ms 24148 KB Output is correct
24 Correct 20 ms 24148 KB Output is correct
25 Correct 29 ms 24148 KB Output is correct
26 Correct 22 ms 24148 KB Output is correct
27 Correct 24 ms 24188 KB Output is correct
28 Correct 31 ms 24188 KB Output is correct
29 Correct 27 ms 24188 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23804 KB Output is correct
2 Correct 22 ms 23804 KB Output is correct
3 Correct 21 ms 23836 KB Output is correct
4 Correct 21 ms 23852 KB Output is correct
5 Correct 25 ms 23852 KB Output is correct
6 Correct 21 ms 23916 KB Output is correct
7 Correct 24 ms 23948 KB Output is correct
8 Correct 26 ms 23952 KB Output is correct
9 Correct 23 ms 23952 KB Output is correct
10 Correct 21 ms 23952 KB Output is correct
11 Correct 21 ms 23952 KB Output is correct
12 Correct 22 ms 23960 KB Output is correct
13 Correct 24 ms 24008 KB Output is correct
14 Correct 22 ms 24148 KB Output is correct
15 Correct 23 ms 24148 KB Output is correct
16 Correct 22 ms 24148 KB Output is correct
17 Correct 23 ms 24148 KB Output is correct
18 Correct 22 ms 24148 KB Output is correct
19 Correct 24 ms 24148 KB Output is correct
20 Correct 30 ms 24148 KB Output is correct
21 Correct 30 ms 24148 KB Output is correct
22 Correct 28 ms 24148 KB Output is correct
23 Correct 21 ms 24148 KB Output is correct
24 Correct 20 ms 24148 KB Output is correct
25 Correct 29 ms 24148 KB Output is correct
26 Correct 22 ms 24148 KB Output is correct
27 Correct 24 ms 24188 KB Output is correct
28 Correct 31 ms 24188 KB Output is correct
29 Correct 27 ms 24188 KB Output is correct
30 Correct 398 ms 36732 KB Output is correct
31 Correct 383 ms 36776 KB Output is correct
32 Correct 295 ms 36776 KB Output is correct
33 Correct 188 ms 36820 KB Output is correct
34 Correct 195 ms 36820 KB Output is correct
35 Correct 195 ms 36860 KB Output is correct
36 Correct 191 ms 36860 KB Output is correct
37 Correct 189 ms 36860 KB Output is correct
38 Correct 191 ms 36860 KB Output is correct
39 Correct 188 ms 36860 KB Output is correct
40 Correct 228 ms 36860 KB Output is correct
41 Correct 214 ms 36860 KB Output is correct
42 Correct 212 ms 36860 KB Output is correct
43 Correct 196 ms 36860 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 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

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23804 KB Output is correct
2 Correct 22 ms 23804 KB Output is correct
3 Correct 21 ms 23836 KB Output is correct
4 Correct 21 ms 23852 KB Output is correct
5 Correct 25 ms 23852 KB Output is correct
6 Correct 21 ms 23916 KB Output is correct
7 Correct 24 ms 23948 KB Output is correct
8 Correct 26 ms 23952 KB Output is correct
9 Correct 23 ms 23952 KB Output is correct
10 Correct 21 ms 23952 KB Output is correct
11 Correct 21 ms 23952 KB Output is correct
12 Correct 22 ms 23960 KB Output is correct
13 Correct 24 ms 24008 KB Output is correct
14 Correct 22 ms 24148 KB Output is correct
15 Correct 23 ms 24148 KB Output is correct
16 Correct 22 ms 24148 KB Output is correct
17 Correct 23 ms 24148 KB Output is correct
18 Correct 22 ms 24148 KB Output is correct
19 Correct 24 ms 24148 KB Output is correct
20 Correct 30 ms 24148 KB Output is correct
21 Correct 30 ms 24148 KB Output is correct
22 Correct 28 ms 24148 KB Output is correct
23 Correct 21 ms 24148 KB Output is correct
24 Correct 20 ms 24148 KB Output is correct
25 Correct 29 ms 24148 KB Output is correct
26 Correct 22 ms 24148 KB Output is correct
27 Correct 24 ms 24188 KB Output is correct
28 Correct 31 ms 24188 KB Output is correct
29 Correct 27 ms 24188 KB Output is correct
30 Correct 398 ms 36732 KB Output is correct
31 Correct 383 ms 36776 KB Output is correct
32 Correct 295 ms 36776 KB Output is correct
33 Correct 188 ms 36820 KB Output is correct
34 Correct 195 ms 36820 KB Output is correct
35 Correct 195 ms 36860 KB Output is correct
36 Correct 191 ms 36860 KB Output is correct
37 Correct 189 ms 36860 KB Output is correct
38 Correct 191 ms 36860 KB Output is correct
39 Correct 188 ms 36860 KB Output is correct
40 Correct 228 ms 36860 KB Output is correct
41 Correct 214 ms 36860 KB Output is correct
42 Correct 212 ms 36860 KB Output is correct
43 Correct 196 ms 36860 KB Output is correct
44 Incorrect 25 ms 36860 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45 Halted 0 ms 0 KB -