oj.uz

Submission #399835

# Submission time Handle Problem Language Result Execution time Memory
399835 2021-05-06T17:45:05 Z anayk The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 250712 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 bval[MAXN];
int par2[MAXN];
int nzero[MAXN];
int bit[MAXN];
int par[MAXN];
int min[MAXN], max[MAXN], tar[MAXN];
std::set<std::pair<int, int> > best;

int root2(int x) {
  if(par2[x] < 0)
    return x;
  return par2[x] = root2(par2[x]);
}

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]);
}

int merge2(int u, int v) {
  u = root2(u);
  v = root2(v);

  if(u == v)
    return u;

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

  par2[u] += par2[v];
  nzero[u] = std::max(nzero[u], nzero[v]);
  par2[v] = u;
  return u;
}

struct seg
{
  void bupd(int x, int v = 1) {
    x += 1;
    while(x < n+1) {
      bit[x] += v;
      x += x&(-x);
    }
  }

  int sum(int x) {
    x += 1;
    int ret = 0;
    while(x > 0) {
      ret += bit[x];
      x -= x&(-x);
    }
    return ret;
  }

  void update(int x, int y) {
    while(true) {
      int it = nzero[root2(x)];
      if(it > y)
        break;
      bupd(it);
      merge2(x, it+1);
    }
  }

  int query(int x, int y) {
    int ret = sum(y)-sum(x-1);
    return ret;
  }
};

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});
    bval[x] = ch;
  }
  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;

  for(int i = 0; i <= n; i++) {
    nzero[i] = i;
    par2[i] = -1;
  }

  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)
      best.erase({bval[bef], bef});
    best.erase({bval[af], af});
    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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1462 ms 62968 KB Output is correct
3 Correct 1157 ms 63492 KB Output is correct
4 Correct 684 ms 63280 KB Output is correct
5 Correct 743 ms 63660 KB Output is correct
6 Correct 1736 ms 62564 KB Output is correct
7 Correct 1937 ms 60320 KB Output is correct
8 Correct 1678 ms 63400 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 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 332 KB Output is correct
23 Correct 6 ms 844 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 6 ms 844 KB Output is correct
26 Correct 6 ms 844 KB Output is correct
27 Correct 5 ms 844 KB Output is correct
28 Correct 6 ms 848 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 6 ms 844 KB Output is correct
31 Correct 6 ms 844 KB Output is correct
32 Correct 5 ms 848 KB Output is correct
33 Correct 5 ms 844 KB Output is correct
34 Correct 5 ms 844 KB Output is correct
35 Correct 4 ms 844 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 154 ms 10076 KB Output is correct
3 Correct 143 ms 10036 KB Output is correct
4 Correct 78 ms 9560 KB Output is correct
5 Correct 90 ms 9612 KB Output is correct
6 Correct 110 ms 9668 KB Output is correct
7 Correct 152 ms 9608 KB Output is correct
8 Correct 155 ms 9548 KB Output is correct
9 Correct 161 ms 9404 KB Output is correct
10 Correct 120 ms 9940 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 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 332 KB Output is correct
23 Correct 6 ms 844 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 6 ms 844 KB Output is correct
26 Correct 6 ms 844 KB Output is correct
27 Correct 5 ms 844 KB Output is correct
28 Correct 6 ms 848 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 6 ms 844 KB Output is correct
31 Correct 6 ms 844 KB Output is correct
32 Correct 5 ms 848 KB Output is correct
33 Correct 5 ms 844 KB Output is correct
34 Correct 5 ms 844 KB Output is correct
35 Correct 4 ms 844 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 154 ms 10076 KB Output is correct
38 Correct 143 ms 10036 KB Output is correct
39 Correct 78 ms 9560 KB Output is correct
40 Correct 90 ms 9612 KB Output is correct
41 Correct 110 ms 9668 KB Output is correct
42 Correct 152 ms 9608 KB Output is correct
43 Correct 155 ms 9548 KB Output is correct
44 Correct 161 ms 9404 KB Output is correct
45 Correct 120 ms 9940 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 6 ms 844 KB Output is correct
58 Correct 6 ms 844 KB Output is correct
59 Correct 5 ms 848 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 844 KB Output is correct
62 Correct 7 ms 972 KB Output is correct
63 Correct 6 ms 848 KB Output is correct
64 Correct 5 ms 844 KB Output is correct
65 Correct 6 ms 852 KB Output is correct
66 Correct 7 ms 844 KB Output is correct
67 Correct 5 ms 904 KB Output is correct
68 Correct 5 ms 844 KB Output is correct
69 Correct 5 ms 844 KB Output is correct
70 Correct 1 ms 320 KB Output is correct
71 Correct 148 ms 10056 KB Output is correct
72 Correct 135 ms 10020 KB Output is correct
73 Correct 79 ms 9664 KB Output is correct
74 Correct 91 ms 9656 KB Output is correct
75 Correct 113 ms 9680 KB Output is correct
76 Correct 152 ms 9584 KB Output is correct
77 Correct 152 ms 9612 KB Output is correct
78 Correct 161 ms 9400 KB Output is correct
79 Correct 124 ms 9876 KB Output is correct
80 Correct 173 ms 10084 KB Output is correct
81 Correct 140 ms 10080 KB Output is correct
82 Correct 131 ms 10128 KB Output is correct
83 Correct 82 ms 9728 KB Output is correct
84 Correct 87 ms 9796 KB Output is correct
85 Correct 119 ms 9776 KB Output is correct
86 Correct 152 ms 9940 KB Output is correct
87 Correct 142 ms 9796 KB Output is correct
88 Correct 157 ms 9472 KB Output is correct
89 Correct 153 ms 9552 KB Output is correct
90 Correct 147 ms 9616 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1462 ms 62968 KB Output is correct
14 Correct 1157 ms 63492 KB Output is correct
15 Correct 684 ms 63280 KB Output is correct
16 Correct 743 ms 63660 KB Output is correct
17 Correct 1736 ms 62564 KB Output is correct
18 Correct 1937 ms 60320 KB Output is correct
19 Correct 1678 ms 63400 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 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 332 KB Output is correct
31 Correct 6 ms 844 KB Output is correct
32 Correct 6 ms 844 KB Output is correct
33 Correct 6 ms 844 KB Output is correct
34 Correct 6 ms 844 KB Output is correct
35 Correct 5 ms 844 KB Output is correct
36 Correct 6 ms 848 KB Output is correct
37 Correct 6 ms 844 KB Output is correct
38 Correct 6 ms 844 KB Output is correct
39 Correct 6 ms 844 KB Output is correct
40 Correct 5 ms 848 KB Output is correct
41 Correct 5 ms 844 KB Output is correct
42 Correct 5 ms 844 KB Output is correct
43 Correct 4 ms 844 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 154 ms 10076 KB Output is correct
46 Correct 143 ms 10036 KB Output is correct
47 Correct 78 ms 9560 KB Output is correct
48 Correct 90 ms 9612 KB Output is correct
49 Correct 110 ms 9668 KB Output is correct
50 Correct 152 ms 9608 KB Output is correct
51 Correct 155 ms 9548 KB Output is correct
52 Correct 161 ms 9404 KB Output is correct
53 Correct 120 ms 9940 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 2 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 6 ms 844 KB Output is correct
66 Correct 6 ms 844 KB Output is correct
67 Correct 5 ms 848 KB Output is correct
68 Correct 5 ms 844 KB Output is correct
69 Correct 5 ms 844 KB Output is correct
70 Correct 7 ms 972 KB Output is correct
71 Correct 6 ms 848 KB Output is correct
72 Correct 5 ms 844 KB Output is correct
73 Correct 6 ms 852 KB Output is correct
74 Correct 7 ms 844 KB Output is correct
75 Correct 5 ms 904 KB Output is correct
76 Correct 5 ms 844 KB Output is correct
77 Correct 5 ms 844 KB Output is correct
78 Correct 1 ms 320 KB Output is correct
79 Correct 148 ms 10056 KB Output is correct
80 Correct 135 ms 10020 KB Output is correct
81 Correct 79 ms 9664 KB Output is correct
82 Correct 91 ms 9656 KB Output is correct
83 Correct 113 ms 9680 KB Output is correct
84 Correct 152 ms 9584 KB Output is correct
85 Correct 152 ms 9612 KB Output is correct
86 Correct 161 ms 9400 KB Output is correct
87 Correct 124 ms 9876 KB Output is correct
88 Correct 173 ms 10084 KB Output is correct
89 Correct 140 ms 10080 KB Output is correct
90 Correct 131 ms 10128 KB Output is correct
91 Correct 82 ms 9728 KB Output is correct
92 Correct 87 ms 9796 KB Output is correct
93 Correct 119 ms 9776 KB Output is correct
94 Correct 152 ms 9940 KB Output is correct
95 Correct 142 ms 9796 KB Output is correct
96 Correct 157 ms 9472 KB Output is correct
97 Correct 153 ms 9552 KB Output is correct
98 Correct 147 ms 9616 KB Output is correct
99 Correct 1 ms 332 KB Output is correct
100 Correct 1 ms 320 KB Output is correct
101 Correct 1 ms 332 KB Output is correct
102 Correct 1 ms 332 KB Output is correct
103 Correct 1 ms 452 KB Output is correct
104 Correct 1 ms 328 KB Output is correct
105 Correct 1 ms 332 KB Output is correct
106 Correct 1 ms 332 KB Output is correct
107 Correct 1 ms 332 KB Output is correct
108 Correct 1 ms 332 KB Output is correct
109 Correct 1 ms 332 KB Output is correct
110 Correct 1 ms 332 KB Output is correct
111 Correct 1415 ms 63528 KB Output is correct
112 Correct 1081 ms 63492 KB Output is correct
113 Correct 677 ms 63368 KB Output is correct
114 Correct 739 ms 63544 KB Output is correct
115 Correct 1710 ms 62624 KB Output is correct
116 Correct 1922 ms 60232 KB Output is correct
117 Correct 1835 ms 63344 KB Output is correct
118 Correct 6 ms 844 KB Output is correct
119 Correct 6 ms 852 KB Output is correct
120 Correct 7 ms 844 KB Output is correct
121 Correct 6 ms 924 KB Output is correct
122 Correct 6 ms 848 KB Output is correct
123 Correct 6 ms 844 KB Output is correct
124 Correct 6 ms 844 KB Output is correct
125 Correct 6 ms 844 KB Output is correct
126 Correct 5 ms 844 KB Output is correct
127 Correct 6 ms 844 KB Output is correct
128 Correct 6 ms 860 KB Output is correct
129 Correct 6 ms 900 KB Output is correct
130 Correct 5 ms 848 KB Output is correct
131 Correct 1 ms 332 KB Output is correct
132 Correct 177 ms 10204 KB Output is correct
133 Correct 145 ms 10132 KB Output is correct
134 Correct 77 ms 9880 KB Output is correct
135 Correct 95 ms 9836 KB Output is correct
136 Correct 108 ms 9796 KB Output is correct
137 Correct 154 ms 9976 KB Output is correct
138 Correct 153 ms 9992 KB Output is correct
139 Correct 175 ms 9696 KB Output is correct
140 Correct 126 ms 10208 KB Output is correct
141 Correct 145 ms 10208 KB Output is correct
142 Correct 139 ms 10128 KB Output is correct
143 Correct 126 ms 10204 KB Output is correct
144 Correct 101 ms 9944 KB Output is correct
145 Correct 89 ms 9968 KB Output is correct
146 Correct 122 ms 9836 KB Output is correct
147 Correct 140 ms 10024 KB Output is correct
148 Correct 143 ms 10024 KB Output is correct
149 Correct 164 ms 9780 KB Output is correct
150 Correct 151 ms 9672 KB Output is correct
151 Correct 138 ms 9868 KB Output is correct
152 Execution timed out 2092 ms 250712 KB Time limit exceeded
153 Halted 0 ms 0 KB -