oj.uz

Submission #659395

# Submission time Handle Problem Language Result Execution time Memory
659395 2022-11-17T15:31:54 Z 600Mihnea The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 150396 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2000000 + 7;
const int INF = (int) 1e9 + 7;
int n;
int d;
int t;
int trebel[N];
bool block[N];
int ant[N];
bool valid[N];
set<int> valids;

pair<int, int> tree_min_valid[4 * N];

void st_valid(int v, int tl, int tr, int i, int x) {
  if (tr < i || i < tl) {
    return;
  }
  if (tl == tr) {
    assert(tl == i);
    assert(tr == i);
    tree_min_valid[v] = {x, i};
    return;
  }
  int tm = (tl + tr) / 2;
  st_valid(2 * v, tl, tm, i, x);
  st_valid(2 * v + 1, tm + 1, tr, i, x);
  tree_min_valid[v] = min(tree_min_valid[2 * v], tree_min_valid[2 * v + 1]);
}

pair<int, int> get_min_valid(int v, int tl, int tr, int l, int r) {
  if (tr < l || r < tl) {
    return {INF, -1};
  }
  if (l <= tl && tr <= r) {
    return tree_min_valid[v];
  }
  int tm = (tl + tr) / 2;
  return min(get_min_valid(2 * v, tl, tm, l, r), get_min_valid(2 * v + 1, tm + 1, tr, l, r));
}

pair<int, int> tree[4 * N];
int lazy[4 * N];

void push(int v, int tl, int tr) {
  if (lazy[v]) {
    tree[v].first += lazy[v];
    if (tl < tr) {
      lazy[2 * v] += lazy[v];
      lazy[2 * v + 1] += lazy[v];
    }
    lazy[v] = 0;
  }
}

void add(int v, int tl, int tr, int l, int r, int x) {
  push(v, tl, tr);
  if (tr < l || r < tl) {
    return;
  }
  if (l <= tl && tr <= r) {
    lazy[v] += x;
    push(v, tl, tr);
    return;
  }
  int tm = (tl + tr) / 2;
  add(2 * v, tl, tm, l, r, x);
  add(2 * v + 1, tm + 1, tr, l, r, x);
  tree[v] = max(tree[2 * v], tree[2 * v + 1]);
}

void build(int v, int tl, int tr) {
  if (tl == tr) {
    tree[v] = {0, tl};
  } else {
    int tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
    tree[v] = max(tree[2 * v], tree[2 * v + 1]);
  }
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

///  freopen ("input.txt", "r", stdin);

  for (int i = 0; i < 4 * N; i++) {
    tree_min_valid[i] = {INF, -1};
  }

  cin >> n >> d >> t;
  for (int i = 1; i <= n; i++) {
    cin >> trebel[i];
  }
  build(1, 1, n - 1);
  vector<int> stk;
  for (int i = 1; i <= n; i++) {
    while (!stk.empty() && trebel[stk.back()] - stk.back() >= trebel[i] - i) {
      stk.pop_back();
    }
    stk.push_back(i);
    int L = 0, R = (int) stk.size() - 1;
    while (L <= R) {
      int mid = (L + R) / 2;
      int j = stk[mid];
      if (trebel[j] + i - j <= t) {
        ant[i] = j;
        L = mid + 1;
      } else {
        R = mid - 1;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    valid[i] = (ant[i] > 0);
    if (valid[i]) {
      st_valid(1, 1, n, i, ant[i]);
    }
  }
  for (int j = 1; j <= n; j++) {
    if (valid[j]) {
      add(1, 1, n - 1, ant[j], j, +1);
    }
  }

  for (int iqd = 1; iqd <= d; iqd++) {
    push(1, 1, n - 1);
    int jj = tree[1].second;
    assert(1 <= jj && jj < n);
    assert(!block[jj]);
    add(1, 1, n - 1, jj, jj, -(int) 1e9);
    block[jj] = 1;
    while (1) {
      auto it = get_min_valid(1, 1, n, jj + 1, n);
      int j = it.second;
      if (it.first <= jj) {
        assert(it.first == ant[j]);
        valid[j] = 0;
        if (ant[j] <= j - 1) {
          add(1, 1, n - 1, ant[j], j - 1, -1);
        }
        st_valid(1, 1, n, j, INF);
      } else {
        break;
      }
    }
  }
  int sol = 0;
  for (int i = 1; i <= n; i++) {
    sol += valid[i];
  }
  cout << sol << "\n";

  return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 28 ms 62952 KB Output is correct
3 Correct 27 ms 62932 KB Output is correct
4 Correct 29 ms 62936 KB Output is correct
5 Correct 31 ms 63008 KB Output is correct
6 Correct 27 ms 62992 KB Output is correct
7 Correct 29 ms 62956 KB Output is correct
8 Correct 28 ms 62972 KB Output is correct
9 Correct 28 ms 63008 KB Output is correct
10 Correct 28 ms 62944 KB Output is correct
11 Correct 28 ms 62980 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 320 ms 79452 KB Output is correct
3 Correct 299 ms 84092 KB Output is correct
4 Correct 316 ms 83464 KB Output is correct
5 Correct 275 ms 81508 KB Output is correct
6 Correct 255 ms 82012 KB Output is correct
7 Correct 758 ms 83616 KB Output is correct
8 Correct 338 ms 83312 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 28 ms 62952 KB Output is correct
3 Correct 27 ms 62932 KB Output is correct
4 Correct 29 ms 62936 KB Output is correct
5 Correct 31 ms 63008 KB Output is correct
6 Correct 27 ms 62992 KB Output is correct
7 Correct 29 ms 62956 KB Output is correct
8 Correct 28 ms 62972 KB Output is correct
9 Correct 28 ms 63008 KB Output is correct
10 Correct 28 ms 62944 KB Output is correct
11 Correct 28 ms 62980 KB Output is correct
12 Correct 28 ms 62940 KB Output is correct
13 Correct 35 ms 62944 KB Output is correct
14 Correct 28 ms 62924 KB Output is correct
15 Correct 31 ms 62984 KB Output is correct
16 Correct 31 ms 62924 KB Output is correct
17 Correct 31 ms 62996 KB Output is correct
18 Correct 34 ms 62896 KB Output is correct
19 Correct 32 ms 62924 KB Output is correct
20 Correct 29 ms 62928 KB Output is correct
21 Correct 28 ms 62968 KB Output is correct
22 Correct 29 ms 63004 KB Output is correct
23 Correct 34 ms 63060 KB Output is correct
24 Correct 30 ms 63052 KB Output is correct
25 Correct 31 ms 63032 KB Output is correct
26 Correct 34 ms 63048 KB Output is correct
27 Correct 35 ms 63060 KB Output is correct
28 Correct 32 ms 63092 KB Output is correct
29 Correct 40 ms 63052 KB Output is correct
30 Correct 41 ms 63048 KB Output is correct
31 Correct 31 ms 63060 KB Output is correct
32 Correct 31 ms 63052 KB Output is correct
33 Correct 30 ms 63076 KB Output is correct
34 Correct 31 ms 63060 KB Output is correct
35 Correct 37 ms 63128 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 62988 KB Output is correct
2 Correct 69 ms 66728 KB Output is correct
3 Correct 85 ms 67452 KB Output is correct
4 Correct 92 ms 67084 KB Output is correct
5 Correct 104 ms 67476 KB Output is correct
6 Correct 145 ms 67464 KB Output is correct
7 Correct 60 ms 66848 KB Output is correct
8 Correct 58 ms 66716 KB Output is correct
9 Correct 128 ms 67240 KB Output is correct
10 Correct 65 ms 67076 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 28 ms 62952 KB Output is correct
3 Correct 27 ms 62932 KB Output is correct
4 Correct 29 ms 62936 KB Output is correct
5 Correct 31 ms 63008 KB Output is correct
6 Correct 27 ms 62992 KB Output is correct
7 Correct 29 ms 62956 KB Output is correct
8 Correct 28 ms 62972 KB Output is correct
9 Correct 28 ms 63008 KB Output is correct
10 Correct 28 ms 62944 KB Output is correct
11 Correct 28 ms 62980 KB Output is correct
12 Correct 28 ms 62940 KB Output is correct
13 Correct 35 ms 62944 KB Output is correct
14 Correct 28 ms 62924 KB Output is correct
15 Correct 31 ms 62984 KB Output is correct
16 Correct 31 ms 62924 KB Output is correct
17 Correct 31 ms 62996 KB Output is correct
18 Correct 34 ms 62896 KB Output is correct
19 Correct 32 ms 62924 KB Output is correct
20 Correct 29 ms 62928 KB Output is correct
21 Correct 28 ms 62968 KB Output is correct
22 Correct 29 ms 63004 KB Output is correct
23 Correct 34 ms 63060 KB Output is correct
24 Correct 30 ms 63052 KB Output is correct
25 Correct 31 ms 63032 KB Output is correct
26 Correct 34 ms 63048 KB Output is correct
27 Correct 35 ms 63060 KB Output is correct
28 Correct 32 ms 63092 KB Output is correct
29 Correct 40 ms 63052 KB Output is correct
30 Correct 41 ms 63048 KB Output is correct
31 Correct 31 ms 63060 KB Output is correct
32 Correct 31 ms 63052 KB Output is correct
33 Correct 30 ms 63076 KB Output is correct
34 Correct 31 ms 63060 KB Output is correct
35 Correct 37 ms 63128 KB Output is correct
36 Correct 32 ms 62988 KB Output is correct
37 Correct 69 ms 66728 KB Output is correct
38 Correct 85 ms 67452 KB Output is correct
39 Correct 92 ms 67084 KB Output is correct
40 Correct 104 ms 67476 KB Output is correct
41 Correct 145 ms 67464 KB Output is correct
42 Correct 60 ms 66848 KB Output is correct
43 Correct 58 ms 66716 KB Output is correct
44 Correct 128 ms 67240 KB Output is correct
45 Correct 65 ms 67076 KB Output is correct
46 Correct 32 ms 62932 KB Output is correct
47 Correct 28 ms 62932 KB Output is correct
48 Correct 28 ms 62972 KB Output is correct
49 Correct 28 ms 62920 KB Output is correct
50 Correct 31 ms 62920 KB Output is correct
51 Correct 33 ms 62952 KB Output is correct
52 Correct 30 ms 62940 KB Output is correct
53 Correct 29 ms 62956 KB Output is correct
54 Correct 29 ms 62988 KB Output is correct
55 Correct 29 ms 62932 KB Output is correct
56 Correct 33 ms 63000 KB Output is correct
57 Correct 30 ms 63084 KB Output is correct
58 Correct 31 ms 63052 KB Output is correct
59 Correct 32 ms 63124 KB Output is correct
60 Correct 35 ms 63052 KB Output is correct
61 Correct 34 ms 63100 KB Output is correct
62 Correct 31 ms 63052 KB Output is correct
63 Correct 35 ms 63140 KB Output is correct
64 Correct 33 ms 63164 KB Output is correct
65 Correct 34 ms 63088 KB Output is correct
66 Correct 32 ms 63052 KB Output is correct
67 Correct 36 ms 63092 KB Output is correct
68 Correct 34 ms 63104 KB Output is correct
69 Correct 33 ms 63108 KB Output is correct
70 Correct 29 ms 62896 KB Output is correct
71 Correct 65 ms 67452 KB Output is correct
72 Correct 68 ms 67436 KB Output is correct
73 Correct 106 ms 67084 KB Output is correct
74 Correct 109 ms 67476 KB Output is correct
75 Correct 105 ms 67404 KB Output is correct
76 Correct 62 ms 66920 KB Output is correct
77 Correct 58 ms 66772 KB Output is correct
78 Correct 134 ms 67352 KB Output is correct
79 Correct 62 ms 67040 KB Output is correct
80 Correct 75 ms 67504 KB Output is correct
81 Correct 90 ms 67496 KB Output is correct
82 Correct 87 ms 67432 KB Output is correct
83 Correct 107 ms 67124 KB Output is correct
84 Correct 89 ms 66996 KB Output is correct
85 Correct 107 ms 67464 KB Output is correct
86 Correct 89 ms 67148 KB Output is correct
87 Correct 75 ms 66924 KB Output is correct
88 Correct 117 ms 67336 KB Output is correct
89 Correct 97 ms 67224 KB Output is correct
90 Correct 96 ms 67216 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62932 KB Output is correct
2 Correct 28 ms 62952 KB Output is correct
3 Correct 27 ms 62932 KB Output is correct
4 Correct 29 ms 62936 KB Output is correct
5 Correct 31 ms 63008 KB Output is correct
6 Correct 27 ms 62992 KB Output is correct
7 Correct 29 ms 62956 KB Output is correct
8 Correct 28 ms 62972 KB Output is correct
9 Correct 28 ms 63008 KB Output is correct
10 Correct 28 ms 62944 KB Output is correct
11 Correct 28 ms 62980 KB Output is correct
12 Correct 27 ms 62932 KB Output is correct
13 Correct 320 ms 79452 KB Output is correct
14 Correct 299 ms 84092 KB Output is correct
15 Correct 316 ms 83464 KB Output is correct
16 Correct 275 ms 81508 KB Output is correct
17 Correct 255 ms 82012 KB Output is correct
18 Correct 758 ms 83616 KB Output is correct
19 Correct 338 ms 83312 KB Output is correct
20 Correct 28 ms 62940 KB Output is correct
21 Correct 35 ms 62944 KB Output is correct
22 Correct 28 ms 62924 KB Output is correct
23 Correct 31 ms 62984 KB Output is correct
24 Correct 31 ms 62924 KB Output is correct
25 Correct 31 ms 62996 KB Output is correct
26 Correct 34 ms 62896 KB Output is correct
27 Correct 32 ms 62924 KB Output is correct
28 Correct 29 ms 62928 KB Output is correct
29 Correct 28 ms 62968 KB Output is correct
30 Correct 29 ms 63004 KB Output is correct
31 Correct 34 ms 63060 KB Output is correct
32 Correct 30 ms 63052 KB Output is correct
33 Correct 31 ms 63032 KB Output is correct
34 Correct 34 ms 63048 KB Output is correct
35 Correct 35 ms 63060 KB Output is correct
36 Correct 32 ms 63092 KB Output is correct
37 Correct 40 ms 63052 KB Output is correct
38 Correct 41 ms 63048 KB Output is correct
39 Correct 31 ms 63060 KB Output is correct
40 Correct 31 ms 63052 KB Output is correct
41 Correct 30 ms 63076 KB Output is correct
42 Correct 31 ms 63060 KB Output is correct
43 Correct 37 ms 63128 KB Output is correct
44 Correct 32 ms 62988 KB Output is correct
45 Correct 69 ms 66728 KB Output is correct
46 Correct 85 ms 67452 KB Output is correct
47 Correct 92 ms 67084 KB Output is correct
48 Correct 104 ms 67476 KB Output is correct
49 Correct 145 ms 67464 KB Output is correct
50 Correct 60 ms 66848 KB Output is correct
51 Correct 58 ms 66716 KB Output is correct
52 Correct 128 ms 67240 KB Output is correct
53 Correct 65 ms 67076 KB Output is correct
54 Correct 32 ms 62932 KB Output is correct
55 Correct 28 ms 62932 KB Output is correct
56 Correct 28 ms 62972 KB Output is correct
57 Correct 28 ms 62920 KB Output is correct
58 Correct 31 ms 62920 KB Output is correct
59 Correct 33 ms 62952 KB Output is correct
60 Correct 30 ms 62940 KB Output is correct
61 Correct 29 ms 62956 KB Output is correct
62 Correct 29 ms 62988 KB Output is correct
63 Correct 29 ms 62932 KB Output is correct
64 Correct 33 ms 63000 KB Output is correct
65 Correct 30 ms 63084 KB Output is correct
66 Correct 31 ms 63052 KB Output is correct
67 Correct 32 ms 63124 KB Output is correct
68 Correct 35 ms 63052 KB Output is correct
69 Correct 34 ms 63100 KB Output is correct
70 Correct 31 ms 63052 KB Output is correct
71 Correct 35 ms 63140 KB Output is correct
72 Correct 33 ms 63164 KB Output is correct
73 Correct 34 ms 63088 KB Output is correct
74 Correct 32 ms 63052 KB Output is correct
75 Correct 36 ms 63092 KB Output is correct
76 Correct 34 ms 63104 KB Output is correct
77 Correct 33 ms 63108 KB Output is correct
78 Correct 29 ms 62896 KB Output is correct
79 Correct 65 ms 67452 KB Output is correct
80 Correct 68 ms 67436 KB Output is correct
81 Correct 106 ms 67084 KB Output is correct
82 Correct 109 ms 67476 KB Output is correct
83 Correct 105 ms 67404 KB Output is correct
84 Correct 62 ms 66920 KB Output is correct
85 Correct 58 ms 66772 KB Output is correct
86 Correct 134 ms 67352 KB Output is correct
87 Correct 62 ms 67040 KB Output is correct
88 Correct 75 ms 67504 KB Output is correct
89 Correct 90 ms 67496 KB Output is correct
90 Correct 87 ms 67432 KB Output is correct
91 Correct 107 ms 67124 KB Output is correct
92 Correct 89 ms 66996 KB Output is correct
93 Correct 107 ms 67464 KB Output is correct
94 Correct 89 ms 67148 KB Output is correct
95 Correct 75 ms 66924 KB Output is correct
96 Correct 117 ms 67336 KB Output is correct
97 Correct 97 ms 67224 KB Output is correct
98 Correct 96 ms 67216 KB Output is correct
99 Correct 28 ms 62904 KB Output is correct
100 Correct 28 ms 62924 KB Output is correct
101 Correct 29 ms 62988 KB Output is correct
102 Correct 29 ms 63008 KB Output is correct
103 Correct 32 ms 62956 KB Output is correct
104 Correct 30 ms 62964 KB Output is correct
105 Correct 30 ms 62984 KB Output is correct
106 Correct 30 ms 62884 KB Output is correct
107 Correct 32 ms 62916 KB Output is correct
108 Correct 35 ms 62920 KB Output is correct
109 Correct 29 ms 62932 KB Output is correct
110 Correct 30 ms 62976 KB Output is correct
111 Correct 282 ms 84380 KB Output is correct
112 Correct 288 ms 84160 KB Output is correct
113 Correct 311 ms 83376 KB Output is correct
114 Correct 276 ms 81628 KB Output is correct
115 Correct 243 ms 82116 KB Output is correct
116 Correct 728 ms 83508 KB Output is correct
117 Correct 280 ms 83348 KB Output is correct
118 Correct 34 ms 63048 KB Output is correct
119 Correct 38 ms 63180 KB Output is correct
120 Correct 31 ms 63184 KB Output is correct
121 Correct 31 ms 63036 KB Output is correct
122 Correct 31 ms 63052 KB Output is correct
123 Correct 31 ms 63060 KB Output is correct
124 Correct 31 ms 63140 KB Output is correct
125 Correct 30 ms 63180 KB Output is correct
126 Correct 31 ms 63124 KB Output is correct
127 Correct 35 ms 63052 KB Output is correct
128 Correct 31 ms 63104 KB Output is correct
129 Correct 32 ms 63036 KB Output is correct
130 Correct 34 ms 63132 KB Output is correct
131 Correct 30 ms 63076 KB Output is correct
132 Correct 75 ms 67404 KB Output is correct
133 Correct 77 ms 67400 KB Output is correct
134 Correct 90 ms 67096 KB Output is correct
135 Correct 104 ms 67480 KB Output is correct
136 Correct 112 ms 67404 KB Output is correct
137 Correct 63 ms 67052 KB Output is correct
138 Correct 59 ms 66716 KB Output is correct
139 Correct 118 ms 67200 KB Output is correct
140 Correct 59 ms 67064 KB Output is correct
141 Correct 75 ms 67492 KB Output is correct
142 Correct 117 ms 67428 KB Output is correct
143 Correct 86 ms 67492 KB Output is correct
144 Correct 94 ms 67196 KB Output is correct
145 Correct 88 ms 66892 KB Output is correct
146 Correct 105 ms 67440 KB Output is correct
147 Correct 95 ms 67196 KB Output is correct
148 Correct 74 ms 66984 KB Output is correct
149 Correct 105 ms 67232 KB Output is correct
150 Correct 96 ms 67188 KB Output is correct
151 Correct 88 ms 67228 KB Output is correct
152 Correct 1166 ms 150396 KB Output is correct
153 Correct 1150 ms 150180 KB Output is correct
154 Correct 1126 ms 150208 KB Output is correct
155 Correct 1866 ms 143924 KB Output is correct
156 Correct 1673 ms 139228 KB Output is correct
157 Correct 739 ms 138512 KB Output is correct
158 Correct 1148 ms 143564 KB Output is correct
159 Execution timed out 2015 ms 146428 KB Time limit exceeded
160 Halted 0 ms 0 KB -