oj.uz

Submission #686655

# Submission time Handle Problem Language Result Execution time Memory
686655 2023-01-25T16:58:19 Z arvingf232 The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 93756 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
const int MAXN = 2e6 + 10;
const int MOD = 1e9 + 7;
int stma[(1 << 22)], stupd[(1 << 22)], stidx[(1 << 22)];
void build(int l, int r, int idx) {
  if(l == r) {
    stidx[idx] = l; return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, (idx<<1)+1);
  build(mid+1, r, (idx<<1)+2);
  stma[idx] = max(stma[(idx<<1)+1], stma[(idx<<1)+2]);
  stidx[idx] = (stma[(idx<<1)+1] == stma[idx] ? stidx[(idx<<1)+1] : stidx[(idx<<1)+2]);
}
void u(int l, int r, int constl, int constr, int idx, int val) {
  if(l <= constl && constr <= r) {
    stma[idx] += val;
    stupd[idx] += val;
    return;
  }
  int mid = (constl + constr) >> 1;
  stma[(idx<<1)+1] += stupd[idx];
  stma[(idx<<1)+2] += stupd[idx];
  stupd[(idx<<1)+1] += stupd[idx];
  stupd[(idx<<1)+2] += stupd[idx];
  stupd[idx] = 0;
  if(mid >= l && r >= constl) u(l, r, constl, mid, (idx<<1)+1, val);
  if(constr >= l && r >= mid+1) u(l, r, mid+1, constr, (idx<<1)+2, val);
  stma[idx] = max(stma[(idx<<1)+1], stma[(idx<<1)+2]);
  stidx[idx] = (stma[(idx<<1)+1] == stma[idx] ? stidx[(idx<<1)+1] : stidx[(idx<<1)+2]);
}
int seg[MAXN << 2];
 
void u2(int l, int r, int tar, int idx, int val) {
  if(l == r) {
    seg[idx] = val; return;
  }
  int mid = (l + r) >> 1;
  if(tar <= mid) u2(l, mid, tar, (idx<<1)+1, val);
  else u2(mid+1, r, tar, (idx<<1)+2, val);
  seg[idx] = min(seg[(idx<<1)+1], seg[(idx<<1)+2]);
}
 
int qu2(int l, int r, int constl, int constr, int idx, int val) { // first <= v
  if(l <= constl && constr <= r) {
    if(seg[idx] > val) return -1;
    while(constl < constr) {
      int mid = (constl + constr) >> 1;
      if(seg[(idx<<1)+1] <= val) constr = mid, idx = (idx<<1)+1;
      else constl = mid+1, idx = (idx<<1)+2;
    }
    return constl;
  }
  int mid = (constl + constr) >> 1;
  if(mid < l || r < constl) return qu2(l, r, mid+1, constr, (idx<<1)+2, val);
  else if(constr < l || r < mid+1) return qu2(l, r, constl, mid, (idx<<1)+1, val);
  else {
    int lc = qu2(l, r, constl, mid, (idx<<1)+1, val);
    if(lc != -1) return lc;
    return qu2(l, r, mid+1, constr, (idx<<1)+2, val);
  }
}
inline int read() {
  int x = 0, c = getchar(), neg = false;
  while(('0' > c || c > '9') && c!='-' && c!=EOF) c = getchar();
  if(c == '-') neg = true, c = getchar();
  while('0' <= c && c <= '9') x = x*10 + (c^'0'), c = getchar();
  if(neg) x = -x;
  return x; // returns 0 if EOF
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int32_t n, d, t;
  n = read();
  d = read();
  t = read();
  pair<int, int> tri[n+1];
  for(int i=1; i<=n; i++) {
    int32_t x = read();
    tri[i] = {x-i, i};
  }
  sort(tri+1, tri+1+n);
  build(1, n-1, 0);
  int ans = 0;
  int pr = 0;
  priority_queue<int> ok;
  int sv[n+1];
  for(int i=n; i>=1; i--) {
    while(pr+1 <= n && tri[pr+1].first <= t-i) {
      pr++;
      if(tri[pr].second <= i) ok.push(tri[pr].second);
    }
    int bruh = (ok.size() ? ok.top() : -1);
    if(bruh == i) ok.pop();
    sv[i]= bruh;
    if(bruh != -1) {
      ans++;
      if(bruh < i) {
        u(bruh, i-1, 1, n-1, 0, 1);
      }
      u2(1, n, i, 0, bruh);
    }
    else {
      u2(1, n, i, 0, MOD);
    }
  }
  while(d--) {
    int ss = stidx[0];
    int prv=ans;
    while(1) {
      int idx = qu2(ss+1, n, 1, n, 0, ss); 
      if(idx == -1) break;
      u2(1, n, idx, 0, MOD); 
      u(sv[idx], idx-1, 1, n-1, 0, -1);
      ans--;
    }
    if(prv == ans) break;
  }
  cout << ans << "\n";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 210 ms 23472 KB Output is correct
3 Correct 200 ms 24052 KB Output is correct
4 Correct 203 ms 23416 KB Output is correct
5 Correct 185 ms 22528 KB Output is correct
6 Correct 198 ms 21224 KB Output is correct
7 Correct 654 ms 22656 KB Output is correct
8 Correct 206 ms 22348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 34 ms 5520 KB Output is correct
3 Correct 32 ms 5460 KB Output is correct
4 Correct 57 ms 5360 KB Output is correct
5 Correct 62 ms 5480 KB Output is correct
6 Correct 62 ms 5460 KB Output is correct
7 Correct 28 ms 4872 KB Output is correct
8 Correct 27 ms 4684 KB Output is correct
9 Correct 98 ms 5260 KB Output is correct
10 Correct 21 ms 5332 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 34 ms 5520 KB Output is correct
38 Correct 32 ms 5460 KB Output is correct
39 Correct 57 ms 5360 KB Output is correct
40 Correct 62 ms 5480 KB Output is correct
41 Correct 62 ms 5460 KB Output is correct
42 Correct 28 ms 4872 KB Output is correct
43 Correct 27 ms 4684 KB Output is correct
44 Correct 98 ms 5260 KB Output is correct
45 Correct 21 ms 5332 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 3 ms 468 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 30 ms 5528 KB Output is correct
72 Correct 32 ms 5540 KB Output is correct
73 Correct 51 ms 5420 KB Output is correct
74 Correct 62 ms 5388 KB Output is correct
75 Correct 62 ms 5460 KB Output is correct
76 Correct 34 ms 4876 KB Output is correct
77 Correct 27 ms 4764 KB Output is correct
78 Correct 95 ms 5312 KB Output is correct
79 Correct 22 ms 5204 KB Output is correct
80 Correct 39 ms 5500 KB Output is correct
81 Correct 44 ms 5452 KB Output is correct
82 Correct 46 ms 5564 KB Output is correct
83 Correct 56 ms 5384 KB Output is correct
84 Correct 42 ms 5236 KB Output is correct
85 Correct 69 ms 5288 KB Output is correct
86 Correct 47 ms 5216 KB Output is correct
87 Correct 35 ms 4948 KB Output is correct
88 Correct 76 ms 5232 KB Output is correct
89 Correct 61 ms 5212 KB Output is correct
90 Correct 53 ms 5320 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 210 ms 23472 KB Output is correct
14 Correct 200 ms 24052 KB Output is correct
15 Correct 203 ms 23416 KB Output is correct
16 Correct 185 ms 22528 KB Output is correct
17 Correct 198 ms 21224 KB Output is correct
18 Correct 654 ms 22656 KB Output is correct
19 Correct 206 ms 22348 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 34 ms 5520 KB Output is correct
46 Correct 32 ms 5460 KB Output is correct
47 Correct 57 ms 5360 KB Output is correct
48 Correct 62 ms 5480 KB Output is correct
49 Correct 62 ms 5460 KB Output is correct
50 Correct 28 ms 4872 KB Output is correct
51 Correct 27 ms 4684 KB Output is correct
52 Correct 98 ms 5260 KB Output is correct
53 Correct 21 ms 5332 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 3 ms 468 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 2 ms 468 KB Output is correct
71 Correct 2 ms 468 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 2 ms 468 KB Output is correct
75 Correct 1 ms 468 KB Output is correct
76 Correct 3 ms 468 KB Output is correct
77 Correct 2 ms 468 KB Output is correct
78 Correct 0 ms 340 KB Output is correct
79 Correct 30 ms 5528 KB Output is correct
80 Correct 32 ms 5540 KB Output is correct
81 Correct 51 ms 5420 KB Output is correct
82 Correct 62 ms 5388 KB Output is correct
83 Correct 62 ms 5460 KB Output is correct
84 Correct 34 ms 4876 KB Output is correct
85 Correct 27 ms 4764 KB Output is correct
86 Correct 95 ms 5312 KB Output is correct
87 Correct 22 ms 5204 KB Output is correct
88 Correct 39 ms 5500 KB Output is correct
89 Correct 44 ms 5452 KB Output is correct
90 Correct 46 ms 5564 KB Output is correct
91 Correct 56 ms 5384 KB Output is correct
92 Correct 42 ms 5236 KB Output is correct
93 Correct 69 ms 5288 KB Output is correct
94 Correct 47 ms 5216 KB Output is correct
95 Correct 35 ms 4948 KB Output is correct
96 Correct 76 ms 5232 KB Output is correct
97 Correct 61 ms 5212 KB Output is correct
98 Correct 53 ms 5320 KB Output is correct
99 Correct 0 ms 340 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 340 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 1 ms 340 KB Output is correct
111 Correct 215 ms 23400 KB Output is correct
112 Correct 199 ms 24052 KB Output is correct
113 Correct 215 ms 23340 KB Output is correct
114 Correct 179 ms 22620 KB Output is correct
115 Correct 197 ms 21136 KB Output is correct
116 Correct 685 ms 22624 KB Output is correct
117 Correct 203 ms 22348 KB Output is correct
118 Correct 2 ms 468 KB Output is correct
119 Correct 2 ms 468 KB Output is correct
120 Correct 2 ms 468 KB Output is correct
121 Correct 2 ms 468 KB Output is correct
122 Correct 2 ms 468 KB Output is correct
123 Correct 2 ms 468 KB Output is correct
124 Correct 2 ms 468 KB Output is correct
125 Correct 1 ms 468 KB Output is correct
126 Correct 2 ms 468 KB Output is correct
127 Correct 1 ms 468 KB Output is correct
128 Correct 1 ms 468 KB Output is correct
129 Correct 2 ms 468 KB Output is correct
130 Correct 2 ms 468 KB Output is correct
131 Correct 0 ms 340 KB Output is correct
132 Correct 31 ms 5460 KB Output is correct
133 Correct 29 ms 5504 KB Output is correct
134 Correct 51 ms 5392 KB Output is correct
135 Correct 74 ms 5440 KB Output is correct
136 Correct 62 ms 5432 KB Output is correct
137 Correct 27 ms 4940 KB Output is correct
138 Correct 26 ms 4704 KB Output is correct
139 Correct 95 ms 5320 KB Output is correct
140 Correct 22 ms 5196 KB Output is correct
141 Correct 36 ms 5440 KB Output is correct
142 Correct 44 ms 5452 KB Output is correct
143 Correct 42 ms 5460 KB Output is correct
144 Correct 51 ms 5460 KB Output is correct
145 Correct 41 ms 5304 KB Output is correct
146 Correct 66 ms 5360 KB Output is correct
147 Correct 45 ms 5132 KB Output is correct
148 Correct 35 ms 4980 KB Output is correct
149 Correct 80 ms 5316 KB Output is correct
150 Correct 58 ms 5332 KB Output is correct
151 Correct 50 ms 5320 KB Output is correct
152 Correct 917 ms 92436 KB Output is correct
153 Correct 926 ms 93136 KB Output is correct
154 Correct 911 ms 93756 KB Output is correct
155 Correct 1354 ms 90320 KB Output is correct
156 Correct 1137 ms 89560 KB Output is correct
157 Correct 648 ms 80480 KB Output is correct
158 Correct 979 ms 85536 KB Output is correct
159 Execution timed out 2091 ms 89408 KB Time limit exceeded
160 Halted 0 ms 0 KB -