oj.uz

답안 #686651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
686651 2023-01-25T16:51:13 Z cig32 The short shank; Redemption (BOI21_prison) C++14
100 / 100
 1928 ms 106400 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 + 5;
const int MOD = 1e9 + 7;
int stma[MAXN << 2], stupd[MAXN << 2], stidx[MAXN << 2];
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 198 ms 23424 KB Output is correct
3 Correct 193 ms 24016 KB Output is correct
4 Correct 191 ms 23496 KB Output is correct
5 Correct 161 ms 22532 KB Output is correct
6 Correct 170 ms 21116 KB Output is correct
7 Correct 483 ms 22664 KB Output is correct
8 Correct 189 ms 22348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 352 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 27 ms 5468 KB Output is correct
3 Correct 29 ms 5484 KB Output is correct
4 Correct 44 ms 5288 KB Output is correct
5 Correct 52 ms 5460 KB Output is correct
6 Correct 52 ms 5448 KB Output is correct
7 Correct 25 ms 4888 KB Output is correct
8 Correct 24 ms 4740 KB Output is correct
9 Correct 69 ms 5264 KB Output is correct
10 Correct 20 ms 5304 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 352 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 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 2 ms 468 KB Output is correct
24 Correct 2 ms 468 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 0 ms 340 KB Output is correct
37 Correct 27 ms 5468 KB Output is correct
38 Correct 29 ms 5484 KB Output is correct
39 Correct 44 ms 5288 KB Output is correct
40 Correct 52 ms 5460 KB Output is correct
41 Correct 52 ms 5448 KB Output is correct
42 Correct 25 ms 4888 KB Output is correct
43 Correct 24 ms 4740 KB Output is correct
44 Correct 69 ms 5264 KB Output is correct
45 Correct 20 ms 5304 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 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 384 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 2 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 1 ms 468 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 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 0 ms 340 KB Output is correct
71 Correct 28 ms 5452 KB Output is correct
72 Correct 28 ms 5508 KB Output is correct
73 Correct 45 ms 5400 KB Output is correct
74 Correct 51 ms 5460 KB Output is correct
75 Correct 54 ms 5456 KB Output is correct
76 Correct 25 ms 4948 KB Output is correct
77 Correct 25 ms 4684 KB Output is correct
78 Correct 69 ms 5316 KB Output is correct
79 Correct 21 ms 5316 KB Output is correct
80 Correct 34 ms 5464 KB Output is correct
81 Correct 41 ms 5536 KB Output is correct
82 Correct 40 ms 5556 KB Output is correct
83 Correct 44 ms 5376 KB Output is correct
84 Correct 41 ms 5312 KB Output is correct
85 Correct 55 ms 5384 KB Output is correct
86 Correct 45 ms 5268 KB Output is correct
87 Correct 32 ms 5096 KB Output is correct
88 Correct 59 ms 5280 KB Output is correct
89 Correct 50 ms 5264 KB Output is correct
90 Correct 43 ms 5308 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 198 ms 23424 KB Output is correct
14 Correct 193 ms 24016 KB Output is correct
15 Correct 191 ms 23496 KB Output is correct
16 Correct 161 ms 22532 KB Output is correct
17 Correct 170 ms 21116 KB Output is correct
18 Correct 483 ms 22664 KB Output is correct
19 Correct 189 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 352 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 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 2 ms 468 KB Output is correct
32 Correct 2 ms 468 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 0 ms 340 KB Output is correct
45 Correct 27 ms 5468 KB Output is correct
46 Correct 29 ms 5484 KB Output is correct
47 Correct 44 ms 5288 KB Output is correct
48 Correct 52 ms 5460 KB Output is correct
49 Correct 52 ms 5448 KB Output is correct
50 Correct 25 ms 4888 KB Output is correct
51 Correct 24 ms 4740 KB Output is correct
52 Correct 69 ms 5264 KB Output is correct
53 Correct 20 ms 5304 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 1 ms 340 KB Output is correct
58 Correct 1 ms 384 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 2 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 1 ms 468 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 1 ms 468 KB Output is correct
75 Correct 1 ms 468 KB Output is correct
76 Correct 2 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 28 ms 5452 KB Output is correct
80 Correct 28 ms 5508 KB Output is correct
81 Correct 45 ms 5400 KB Output is correct
82 Correct 51 ms 5460 KB Output is correct
83 Correct 54 ms 5456 KB Output is correct
84 Correct 25 ms 4948 KB Output is correct
85 Correct 25 ms 4684 KB Output is correct
86 Correct 69 ms 5316 KB Output is correct
87 Correct 21 ms 5316 KB Output is correct
88 Correct 34 ms 5464 KB Output is correct
89 Correct 41 ms 5536 KB Output is correct
90 Correct 40 ms 5556 KB Output is correct
91 Correct 44 ms 5376 KB Output is correct
92 Correct 41 ms 5312 KB Output is correct
93 Correct 55 ms 5384 KB Output is correct
94 Correct 45 ms 5268 KB Output is correct
95 Correct 32 ms 5096 KB Output is correct
96 Correct 59 ms 5280 KB Output is correct
97 Correct 50 ms 5264 KB Output is correct
98 Correct 43 ms 5308 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 0 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 332 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 0 ms 340 KB Output is correct
110 Correct 0 ms 340 KB Output is correct
111 Correct 197 ms 23416 KB Output is correct
112 Correct 191 ms 24104 KB Output is correct
113 Correct 183 ms 23412 KB Output is correct
114 Correct 162 ms 22620 KB Output is correct
115 Correct 174 ms 21128 KB Output is correct
116 Correct 496 ms 22732 KB Output is correct
117 Correct 183 ms 22472 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 3 ms 468 KB Output is correct
125 Correct 2 ms 484 KB Output is correct
126 Correct 2 ms 468 KB Output is correct
127 Correct 1 ms 468 KB Output is correct
128 Correct 2 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 1 ms 348 KB Output is correct
132 Correct 28 ms 5488 KB Output is correct
133 Correct 28 ms 5540 KB Output is correct
134 Correct 43 ms 5404 KB Output is correct
135 Correct 52 ms 5584 KB Output is correct
136 Correct 51 ms 5368 KB Output is correct
137 Correct 25 ms 4948 KB Output is correct
138 Correct 23 ms 4772 KB Output is correct
139 Correct 68 ms 5228 KB Output is correct
140 Correct 20 ms 5264 KB Output is correct
141 Correct 36 ms 5496 KB Output is correct
142 Correct 40 ms 5536 KB Output is correct
143 Correct 38 ms 5460 KB Output is correct
144 Correct 43 ms 5332 KB Output is correct
145 Correct 36 ms 5196 KB Output is correct
146 Correct 54 ms 5360 KB Output is correct
147 Correct 41 ms 5260 KB Output is correct
148 Correct 31 ms 4948 KB Output is correct
149 Correct 62 ms 5312 KB Output is correct
150 Correct 48 ms 5312 KB Output is correct
151 Correct 42 ms 5256 KB Output is correct
152 Correct 837 ms 92504 KB Output is correct
153 Correct 848 ms 93240 KB Output is correct
154 Correct 851 ms 93716 KB Output is correct
155 Correct 1129 ms 90436 KB Output is correct
156 Correct 1028 ms 89472 KB Output is correct
157 Correct 610 ms 80380 KB Output is correct
158 Correct 860 ms 85440 KB Output is correct
159 Correct 1928 ms 89540 KB Output is correct
160 Correct 1329 ms 106400 KB Output is correct
161 Correct 816 ms 103756 KB Output is correct
162 Correct 698 ms 105052 KB Output is correct