oj.uz

Submission #399823

# Submission time Handle Problem Language Result Execution time Memory
399823 2021-05-06T17:23:08 Z anayk The short shank; Redemption (BOI21_prison) C++14
70 / 100
 2000 ms 71480 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 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::set<int> arr;
  std::vector<int> bit;

  void bupd(int x, int v = 1) {
    x += 1;
    while(x < bit.size()) {
      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) {
      auto it = arr.lower_bound(x);
      if(it == arr.end() || (*it) > y)
        break;
      bupd(*it);
      arr.erase(it);
    }
  }

  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;

  tree.bit = std::vector<int>(n+1, 0);
  for(int i = 0; i < n; i++)
    tree.arr.insert(i);

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

Compilation message

prison.cpp: In member function 'void seg::bupd(long long int, long long int)':
prison.cpp:50:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     while(x < bit.size()) {
      |           ~~^~~~~~~~~~~~

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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 2032 ms 71480 KB Time limit exceeded
3 Halted 0 ms 0 KB -

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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 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 2 ms 332 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 7 ms 956 KB Output is correct
24 Correct 7 ms 924 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 8 ms 844 KB Output is correct
28 Correct 9 ms 844 KB Output is correct
29 Correct 9 ms 844 KB Output is correct
30 Correct 8 ms 972 KB Output is correct
31 Correct 7 ms 972 KB Output is correct
32 Correct 6 ms 988 KB Output is correct
33 Correct 6 ms 972 KB Output is correct
34 Correct 6 ms 844 KB Output is correct
35 Correct 5 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 265 ms 11556 KB Output is correct
3 Correct 193 ms 11148 KB Output is correct
4 Correct 109 ms 11488 KB Output is correct
5 Correct 121 ms 11072 KB Output is correct
6 Correct 134 ms 11272 KB Output is correct
7 Correct 217 ms 12128 KB Output is correct
8 Correct 204 ms 12100 KB Output is correct
9 Correct 218 ms 12100 KB Output is correct
10 Correct 168 ms 12128 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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 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 2 ms 332 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 7 ms 956 KB Output is correct
24 Correct 7 ms 924 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 8 ms 844 KB Output is correct
28 Correct 9 ms 844 KB Output is correct
29 Correct 9 ms 844 KB Output is correct
30 Correct 8 ms 972 KB Output is correct
31 Correct 7 ms 972 KB Output is correct
32 Correct 6 ms 988 KB Output is correct
33 Correct 6 ms 972 KB Output is correct
34 Correct 6 ms 844 KB Output is correct
35 Correct 5 ms 844 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 265 ms 11556 KB Output is correct
38 Correct 193 ms 11148 KB Output is correct
39 Correct 109 ms 11488 KB Output is correct
40 Correct 121 ms 11072 KB Output is correct
41 Correct 134 ms 11272 KB Output is correct
42 Correct 217 ms 12128 KB Output is correct
43 Correct 204 ms 12100 KB Output is correct
44 Correct 218 ms 12100 KB Output is correct
45 Correct 168 ms 12128 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 1 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 1 ms 332 KB Output is correct
53 Correct 1 ms 332 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 7 ms 844 KB Output is correct
58 Correct 7 ms 844 KB Output is correct
59 Correct 7 ms 844 KB Output is correct
60 Correct 7 ms 928 KB Output is correct
61 Correct 7 ms 960 KB Output is correct
62 Correct 7 ms 844 KB Output is correct
63 Correct 7 ms 844 KB Output is correct
64 Correct 7 ms 972 KB Output is correct
65 Correct 7 ms 972 KB Output is correct
66 Correct 6 ms 972 KB Output is correct
67 Correct 6 ms 972 KB Output is correct
68 Correct 6 ms 844 KB Output is correct
69 Correct 5 ms 940 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 199 ms 11460 KB Output is correct
72 Correct 190 ms 11076 KB Output is correct
73 Correct 109 ms 11564 KB Output is correct
74 Correct 121 ms 11080 KB Output is correct
75 Correct 140 ms 11316 KB Output is correct
76 Correct 216 ms 12096 KB Output is correct
77 Correct 205 ms 12092 KB Output is correct
78 Correct 209 ms 12096 KB Output is correct
79 Correct 174 ms 12148 KB Output is correct
80 Correct 181 ms 11124 KB Output is correct
81 Correct 210 ms 11568 KB Output is correct
82 Correct 172 ms 11204 KB Output is correct
83 Correct 114 ms 11420 KB Output is correct
84 Correct 123 ms 11460 KB Output is correct
85 Correct 177 ms 11736 KB Output is correct
86 Correct 198 ms 12100 KB Output is correct
87 Correct 191 ms 11988 KB Output is correct
88 Correct 240 ms 11972 KB Output is correct
89 Correct 218 ms 12208 KB Output is correct
90 Correct 188 ms 12004 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 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Execution timed out 2032 ms 71480 KB Time limit exceeded
14 Halted 0 ms 0 KB -