oj.uz

답안 #399807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399807 2021-05-06T16:41:29 Z anayk The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 68076 KB 
#include <iostream>
#include <vector>
#include <set>

#define int long long

#define left (id+1)
#define mid ((l+r)/2)
#define right (id+2*(mid-l+1))

const int MAXN = 2000006;

int n, d, t;

int par[MAXN];
int min[MAXN], max[MAXN], tar[MAXN];
std::set<std::pair<int, int> > best;

int root(int x) {
  if(par[x] < 0)
    return x;
  return par[x] = root(par[x]);
}

void merge(int u, int v) {
  u = root(u);
  v = root(v);

  if(u == v)
    return;

  if(par[u] > par[v])
    u ^= v ^= u ^= v;

  par[u] += par[v];
  par[v] = u;
  tar[u] = std::max(tar[u], tar[v]);
  max[u] = std::max(max[u], max[v]);
  min[u] = std::min(min[u], min[v]);
}

struct seg
{
  std::vector<int> arr, lazy;

  void push(int id, int l, int r) {
    if(lazy[id]) {
      lazy[id] = 0;
      lazy[left] = lazy[right] = 1;
      arr[left] = mid-l+1;
      arr[right] = r-mid;
    }
  }

  void update(int x, int y, int id = 0, int l = 0, int r = n-1) {
    if(y < l || r < x)
      return;

    if(x <= l && r <= y) {
      arr[id] = r-l+1;
      lazy[id] = 1;
      return;
    }

    push(id, l, r);
    update(x, y, left, l, mid);
    update(x, y, right, mid+1, r);

    arr[id] = arr[left] + arr[right];
  }

  int query(int x, int y, int id = 0, int l = 0, int r = n-1) {
    if(y < l || r < x)
      return 0;

    if(x <= l && r <= y) {
      return arr[id];
    }

    push(id, l, r);
    return query(x, y, left, l, mid) + query(x, y, right, mid+1, r);
  }
};

seg tree;

int getL(int x) {
  if(min[x] == 0)
    return -1;
  return root(min[x]-1);
}

int getR(int x) {
  if(max[x] == n-1)
    return -1;
  return root(max[x]+1);
}

void tog(int x, int y) {
  int nex = getR(x);
  if(nex == -1)
    return;
  int r = std::min(tar[x], max[nex]);
  int l = min[nex];

  int ch = r-l+1-tree.query(l, r);
  if(y == 1)
    best.insert({ch, x});
  else {
    best.erase({ch, x});
    if(y == 0) tree.update(l, r);
  }
}

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cin >> n >> d >> t;

  tree.arr = tree.lazy = std::vector<int>(2*n-1, 0);

  for(int i = 0; i < n; i++) {
    int val;
    std::cin >> val;
    par[i] = -1;
    min[i] = max[i] = i;
    tar[i] = i+t-val;
    if(tar[i] >= i)
      tree.update(i, i);
  }

  for(int i = 0; i+1 < n; i++)
    tog(i, 1);

  while(d < n-1) {
    int cur = (*best.begin()).second;
    int bef = getL(cur);
    int af = getR(cur);

    if(bef != -1)
      tog(bef, -1);
    tog(af, -1);
    tog(cur, 0);

    merge(cur, af);
    cur = root(cur);
    if(getR(cur) != -1)
      tog(cur, 1);

    if(bef != -1)
      tog(bef, 1);
    d++;
  }

  std::cout << tree.query(0, n-1) << std::endl;

  return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1870 ms 68076 KB Output is correct
3 Correct 1606 ms 67812 KB Output is correct
4 Correct 1264 ms 66336 KB Output is correct
5 Correct 1293 ms 64952 KB Output is correct
6 Correct 1841 ms 66900 KB Output is correct
7 Correct 1620 ms 66896 KB Output is correct
8 Correct 1904 ms 66860 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 324 KB Output is correct
23 Correct 8 ms 844 KB Output is correct
24 Correct 8 ms 900 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 8 ms 848 KB Output is correct
27 Correct 7 ms 848 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 8 ms 844 KB Output is correct
30 Correct 7 ms 844 KB Output is correct
31 Correct 7 ms 844 KB Output is correct
32 Correct 7 ms 844 KB Output is correct
33 Correct 7 ms 848 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 844 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 195 ms 10436 KB Output is correct
3 Correct 197 ms 10524 KB Output is correct
4 Correct 137 ms 10136 KB Output is correct
5 Correct 114 ms 10464 KB Output is correct
6 Correct 119 ms 10440 KB Output is correct
7 Correct 167 ms 10184 KB Output is correct
8 Correct 164 ms 10232 KB Output is correct
9 Correct 134 ms 10248 KB Output is correct
10 Correct 176 ms 10216 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 324 KB Output is correct
23 Correct 8 ms 844 KB Output is correct
24 Correct 8 ms 900 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 8 ms 848 KB Output is correct
27 Correct 7 ms 848 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 8 ms 844 KB Output is correct
30 Correct 7 ms 844 KB Output is correct
31 Correct 7 ms 844 KB Output is correct
32 Correct 7 ms 844 KB Output is correct
33 Correct 7 ms 848 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 844 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 195 ms 10436 KB Output is correct
38 Correct 197 ms 10524 KB Output is correct
39 Correct 137 ms 10136 KB Output is correct
40 Correct 114 ms 10464 KB Output is correct
41 Correct 119 ms 10440 KB Output is correct
42 Correct 167 ms 10184 KB Output is correct
43 Correct 164 ms 10232 KB Output is correct
44 Correct 134 ms 10248 KB Output is correct
45 Correct 176 ms 10216 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 1 ms 316 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 8 ms 888 KB Output is correct
58 Correct 8 ms 844 KB Output is correct
59 Correct 8 ms 896 KB Output is correct
60 Correct 8 ms 844 KB Output is correct
61 Correct 7 ms 844 KB Output is correct
62 Correct 8 ms 844 KB Output is correct
63 Correct 8 ms 844 KB Output is correct
64 Correct 7 ms 848 KB Output is correct
65 Correct 7 ms 844 KB Output is correct
66 Correct 8 ms 844 KB Output is correct
67 Correct 7 ms 816 KB Output is correct
68 Correct 8 ms 848 KB Output is correct
69 Correct 7 ms 844 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 200 ms 10436 KB Output is correct
72 Correct 199 ms 10436 KB Output is correct
73 Correct 143 ms 10244 KB Output is correct
74 Correct 115 ms 10436 KB Output is correct
75 Correct 120 ms 10436 KB Output is correct
76 Correct 164 ms 10212 KB Output is correct
77 Correct 161 ms 10180 KB Output is correct
78 Correct 133 ms 10176 KB Output is correct
79 Correct 179 ms 10188 KB Output is correct
80 Correct 190 ms 10436 KB Output is correct
81 Correct 179 ms 10416 KB Output is correct
82 Correct 174 ms 10436 KB Output is correct
83 Correct 142 ms 10172 KB Output is correct
84 Correct 161 ms 10052 KB Output is correct
85 Correct 128 ms 10424 KB Output is correct
86 Correct 149 ms 10256 KB Output is correct
87 Correct 148 ms 10252 KB Output is correct
88 Correct 144 ms 10180 KB Output is correct
89 Correct 139 ms 10248 KB Output is correct
90 Correct 135 ms 10196 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1870 ms 68076 KB Output is correct
14 Correct 1606 ms 67812 KB Output is correct
15 Correct 1264 ms 66336 KB Output is correct
16 Correct 1293 ms 64952 KB Output is correct
17 Correct 1841 ms 66900 KB Output is correct
18 Correct 1620 ms 66896 KB Output is correct
19 Correct 1904 ms 66860 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 324 KB Output is correct
31 Correct 8 ms 844 KB Output is correct
32 Correct 8 ms 900 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 8 ms 848 KB Output is correct
35 Correct 7 ms 848 KB Output is correct
36 Correct 8 ms 844 KB Output is correct
37 Correct 8 ms 844 KB Output is correct
38 Correct 7 ms 844 KB Output is correct
39 Correct 7 ms 844 KB Output is correct
40 Correct 7 ms 844 KB Output is correct
41 Correct 7 ms 848 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 7 ms 844 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 195 ms 10436 KB Output is correct
46 Correct 197 ms 10524 KB Output is correct
47 Correct 137 ms 10136 KB Output is correct
48 Correct 114 ms 10464 KB Output is correct
49 Correct 119 ms 10440 KB Output is correct
50 Correct 167 ms 10184 KB Output is correct
51 Correct 164 ms 10232 KB Output is correct
52 Correct 134 ms 10248 KB Output is correct
53 Correct 176 ms 10216 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 2 ms 332 KB Output is correct
59 Correct 2 ms 332 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 332 KB Output is correct
63 Correct 1 ms 316 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 8 ms 888 KB Output is correct
66 Correct 8 ms 844 KB Output is correct
67 Correct 8 ms 896 KB Output is correct
68 Correct 8 ms 844 KB Output is correct
69 Correct 7 ms 844 KB Output is correct
70 Correct 8 ms 844 KB Output is correct
71 Correct 8 ms 844 KB Output is correct
72 Correct 7 ms 848 KB Output is correct
73 Correct 7 ms 844 KB Output is correct
74 Correct 8 ms 844 KB Output is correct
75 Correct 7 ms 816 KB Output is correct
76 Correct 8 ms 848 KB Output is correct
77 Correct 7 ms 844 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 200 ms 10436 KB Output is correct
80 Correct 199 ms 10436 KB Output is correct
81 Correct 143 ms 10244 KB Output is correct
82 Correct 115 ms 10436 KB Output is correct
83 Correct 120 ms 10436 KB Output is correct
84 Correct 164 ms 10212 KB Output is correct
85 Correct 161 ms 10180 KB Output is correct
86 Correct 133 ms 10176 KB Output is correct
87 Correct 179 ms 10188 KB Output is correct
88 Correct 190 ms 10436 KB Output is correct
89 Correct 179 ms 10416 KB Output is correct
90 Correct 174 ms 10436 KB Output is correct
91 Correct 142 ms 10172 KB Output is correct
92 Correct 161 ms 10052 KB Output is correct
93 Correct 128 ms 10424 KB Output is correct
94 Correct 149 ms 10256 KB Output is correct
95 Correct 148 ms 10252 KB Output is correct
96 Correct 144 ms 10180 KB Output is correct
97 Correct 139 ms 10248 KB Output is correct
98 Correct 135 ms 10196 KB Output is correct
99 Correct 1 ms 332 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 2 ms 336 KB Output is correct
102 Correct 2 ms 324 KB Output is correct
103 Correct 2 ms 404 KB Output is correct
104 Correct 2 ms 324 KB Output is correct
105 Correct 2 ms 332 KB Output is correct
106 Correct 2 ms 332 KB Output is correct
107 Correct 2 ms 324 KB Output is correct
108 Correct 2 ms 332 KB Output is correct
109 Correct 2 ms 336 KB Output is correct
110 Correct 1 ms 332 KB Output is correct
111 Correct 1943 ms 67864 KB Output is correct
112 Correct 1707 ms 67840 KB Output is correct
113 Correct 1293 ms 66424 KB Output is correct
114 Correct 1328 ms 64888 KB Output is correct
115 Correct 1962 ms 66880 KB Output is correct
116 Correct 1852 ms 67008 KB Output is correct
117 Execution timed out 2045 ms 66884 KB Time limit exceeded
118 Halted 0 ms 0 KB -