oj.uz

Submission #99218

# Submission time Handle Problem Language Result Execution time Memory
99218 2019-03-01T18:20:21 Z eriksuenderhauf Ancient Books (IOI17_books) C++11
100 / 100
 330 ms 26744 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 50;
int L[MAXN], R[MAXN], vis1[MAXN], vis2[MAXN];
int ind[MAXN];

void ext(int& l, int& r) {
 int mL = min(l, min(L[ind[l]], L[ind[r]]));
 int mR = max(r, max(R[ind[l]], R[ind[r]]));
 while (mL < l || r < mR) {
  if (mL < l) {
   l--;
   mL = min(mL, L[ind[l]]);
   mR = max(mR, R[ind[l]]);
  } else {
   r++;
   mL = min(mL, L[ind[r]]);
   mR = max(mR, R[ind[r]]);
  }
 }
}

ll  minimum_walk(vector<int> p, int s) {
 int n = p.size();
 if (s != 0) {
  ll ret = 0;
  int l = s, r = s, c = 0;
  for (int i = 0; i < n; i++) ind[i] = -1;
  for (int i = 0; i < n; i++) {
   ret += (ll) abs(p[i] - i);
   if (ind[i] != -1) continue;
   int j = i;
   L[c] = i, R[c] = i;
   do {
    ind[j] = c;
//    L[c] = min(L[c], j);
    R[c] = max(R[c], j);
    j = p[j];
   } while(i != j);
   if (i != p[i])
    l = min(l, L[c]), r = max(r, R[c]);
   c++;
  }
  int curL = s, curR = s;
  do {
   ext(curL, curR);
   int c1 = 0, c2 = 0;
   int mL1 = curL, mR1 = curR;
   int f1 = 0, f2 = 0;
   while (l < mL1) {
    mL1--;
    c1 += 2;
    ext(mL1, mR1);
    if (mR1 > curR) {
     f1 = true;
     break;
    }
   }
   int mL2 = curL, mR2 = curR;
   while (mR2 < r) {
    mR2++;
    c2 += 2;
    ext(mL2, mR2);
    if (mL2 < curL) {
     f2 = true;
     break;
    }
   }
   if (f1 && f2)
    ret += min(c1, c2);
   else
    ret += c1 + c2;
   curL = min(mL1, mL2);
   curR = max(mR1, mR2);
  } while (l < curL || curR < r);
  return ret;
 }
 ll ret = 0;
 ll sum = 0;
 vis1[0] = 1;
 vis2[n] = 0;
 for (int i = 1; i < n; i++)
  vis1[i] = vis1[i-1] | (p[i] != i);
 for (int i = n - 1; i > 0; i--)
  vis2[i] = vis2[i + 1] | (p[i] != i);
 for (int i = 0; i < n; i++) {
  ret += (ll) abs(p[i] - i);
  sum += (ll) p[i];
  if (sum * 2 == 1ll * (ll) i * (1ll * (ll) i + 1) && i != n - 1 && vis1[i] && vis2[i + 1])
   ret += 2;
 }
 return ret;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 428 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 186 ms 17812 KB Output is correct
31 Correct 174 ms 18168 KB Output is correct
32 Correct 181 ms 18296 KB Output is correct
33 Correct 168 ms 18184 KB Output is correct
34 Correct 136 ms 18132 KB Output is correct
35 Correct 177 ms 18040 KB Output is correct
36 Correct 169 ms 18152 KB Output is correct
37 Correct 160 ms 18184 KB Output is correct
38 Correct 164 ms 18168 KB Output is correct
39 Correct 202 ms 18168 KB Output is correct
40 Correct 167 ms 18148 KB Output is correct
41 Correct 164 ms 22776 KB Output is correct
42 Correct 170 ms 18168 KB Output is correct
43 Correct 250 ms 18052 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 428 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 186 ms 17812 KB Output is correct
31 Correct 174 ms 18168 KB Output is correct
32 Correct 181 ms 18296 KB Output is correct
33 Correct 168 ms 18184 KB Output is correct
34 Correct 136 ms 18132 KB Output is correct
35 Correct 177 ms 18040 KB Output is correct
36 Correct 169 ms 18152 KB Output is correct
37 Correct 160 ms 18184 KB Output is correct
38 Correct 164 ms 18168 KB Output is correct
39 Correct 202 ms 18168 KB Output is correct
40 Correct 167 ms 18148 KB Output is correct
41 Correct 164 ms 22776 KB Output is correct
42 Correct 170 ms 18168 KB Output is correct
43 Correct 250 ms 18052 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 3 ms 384 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 3 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 3 ms 384 KB Output is correct
54 Correct 3 ms 384 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 3 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 384 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 3 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 384 KB Output is correct
64 Correct 176 ms 24636 KB Output is correct
65 Correct 185 ms 25308 KB Output is correct
66 Correct 160 ms 19144 KB Output is correct
67 Correct 330 ms 19064 KB Output is correct
68 Correct 29 ms 2296 KB Output is correct
69 Correct 16 ms 2304 KB Output is correct
70 Correct 24 ms 2608 KB Output is correct
71 Correct 18 ms 2680 KB Output is correct
72 Correct 20 ms 2808 KB Output is correct
73 Correct 30 ms 2132 KB Output is correct
74 Correct 179 ms 24292 KB Output is correct
75 Correct 158 ms 24228 KB Output is correct
76 Correct 171 ms 24584 KB Output is correct
77 Correct 174 ms 24656 KB Output is correct
78 Correct 177 ms 23772 KB Output is correct
79 Correct 147 ms 23800 KB Output is correct
80 Correct 175 ms 26744 KB Output is correct
81 Correct 171 ms 22744 KB Output is correct
82 Correct 150 ms 22748 KB Output is correct
83 Correct 162 ms 21896 KB Output is correct
84 Correct 172 ms 21212 KB Output is correct
85 Correct 215 ms 19904 KB Output is correct
86 Correct 174 ms 19384 KB Output is correct
87 Correct 187 ms 25480 KB Output is correct
88 Correct 149 ms 24468 KB Output is correct
89 Correct 168 ms 22472 KB Output is correct
90 Correct 200 ms 19028 KB Output is correct
91 Correct 186 ms 19008 KB Output is correct
92 Correct 156 ms 18956 KB Output is correct