oj.uz

Submission #399811

# Submission time Handle Problem Language Result Execution time Memory
399811 2021-05-06T16:50:50 Z anayk The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 278752 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::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});
    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.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)
      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 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 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 1718 ms 67344 KB Output is correct
3 Correct 1488 ms 67624 KB Output is correct
4 Correct 1107 ms 67524 KB Output is correct
5 Correct 1140 ms 67652 KB Output is correct
6 Correct 1831 ms 67652 KB Output is correct
7 Correct 1760 ms 67652 KB Output is correct
8 Correct 1829 ms 67552 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 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 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 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 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 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 7 ms 936 KB Output is correct
25 Correct 8 ms 944 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 7 ms 936 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 7 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 6 ms 900 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 6 ms 844 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 184 ms 10864 KB Output is correct
3 Correct 176 ms 10820 KB Output is correct
4 Correct 118 ms 10688 KB Output is correct
5 Correct 109 ms 10820 KB Output is correct
6 Correct 117 ms 10792 KB Output is correct
7 Correct 162 ms 10820 KB Output is correct
8 Correct 169 ms 10820 KB Output is correct
9 Correct 137 ms 10848 KB Output is correct
10 Correct 160 ms 10944 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 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 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 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 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 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 7 ms 936 KB Output is correct
25 Correct 8 ms 944 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 7 ms 936 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 7 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 6 ms 900 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 6 ms 844 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 184 ms 10864 KB Output is correct
38 Correct 176 ms 10820 KB Output is correct
39 Correct 118 ms 10688 KB Output is correct
40 Correct 109 ms 10820 KB Output is correct
41 Correct 117 ms 10792 KB Output is correct
42 Correct 162 ms 10820 KB Output is correct
43 Correct 169 ms 10820 KB Output is correct
44 Correct 137 ms 10848 KB Output is correct
45 Correct 160 ms 10944 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 328 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 1 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 324 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 7 ms 852 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 848 KB Output is correct
61 Correct 7 ms 932 KB Output is correct
62 Correct 7 ms 844 KB Output is correct
63 Correct 7 ms 936 KB Output is correct
64 Correct 6 ms 848 KB Output is correct
65 Correct 6 ms 844 KB Output is correct
66 Correct 6 ms 844 KB Output is correct
67 Correct 6 ms 920 KB Output is correct
68 Correct 7 ms 844 KB Output is correct
69 Correct 6 ms 844 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 176 ms 10860 KB Output is correct
72 Correct 183 ms 10820 KB Output is correct
73 Correct 116 ms 10784 KB Output is correct
74 Correct 107 ms 10840 KB Output is correct
75 Correct 121 ms 10864 KB Output is correct
76 Correct 165 ms 10868 KB Output is correct
77 Correct 157 ms 10848 KB Output is correct
78 Correct 133 ms 10820 KB Output is correct
79 Correct 150 ms 10740 KB Output is correct
80 Correct 177 ms 10948 KB Output is correct
81 Correct 167 ms 10800 KB Output is correct
82 Correct 161 ms 10744 KB Output is correct
83 Correct 122 ms 10516 KB Output is correct
84 Correct 138 ms 10440 KB Output is correct
85 Correct 123 ms 10736 KB Output is correct
86 Correct 146 ms 10692 KB Output is correct
87 Correct 143 ms 10656 KB Output is correct
88 Correct 157 ms 10720 KB Output is correct
89 Correct 139 ms 10532 KB Output is correct
90 Correct 136 ms 10396 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 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1718 ms 67344 KB Output is correct
14 Correct 1488 ms 67624 KB Output is correct
15 Correct 1107 ms 67524 KB Output is correct
16 Correct 1140 ms 67652 KB Output is correct
17 Correct 1831 ms 67652 KB Output is correct
18 Correct 1760 ms 67652 KB Output is correct
19 Correct 1829 ms 67552 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 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 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 2 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 7 ms 844 KB Output is correct
32 Correct 7 ms 936 KB Output is correct
33 Correct 8 ms 944 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 936 KB Output is correct
36 Correct 8 ms 844 KB Output is correct
37 Correct 7 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 6 ms 900 KB Output is correct
41 Correct 7 ms 844 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 6 ms 844 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 184 ms 10864 KB Output is correct
46 Correct 176 ms 10820 KB Output is correct
47 Correct 118 ms 10688 KB Output is correct
48 Correct 109 ms 10820 KB Output is correct
49 Correct 117 ms 10792 KB Output is correct
50 Correct 162 ms 10820 KB Output is correct
51 Correct 169 ms 10820 KB Output is correct
52 Correct 137 ms 10848 KB Output is correct
53 Correct 160 ms 10944 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 328 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 1 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 324 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 2 ms 332 KB Output is correct
65 Correct 7 ms 852 KB Output is correct
66 Correct 7 ms 844 KB Output is correct
67 Correct 7 ms 844 KB Output is correct
68 Correct 7 ms 848 KB Output is correct
69 Correct 7 ms 932 KB Output is correct
70 Correct 7 ms 844 KB Output is correct
71 Correct 7 ms 936 KB Output is correct
72 Correct 6 ms 848 KB Output is correct
73 Correct 6 ms 844 KB Output is correct
74 Correct 6 ms 844 KB Output is correct
75 Correct 6 ms 920 KB Output is correct
76 Correct 7 ms 844 KB Output is correct
77 Correct 6 ms 844 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 176 ms 10860 KB Output is correct
80 Correct 183 ms 10820 KB Output is correct
81 Correct 116 ms 10784 KB Output is correct
82 Correct 107 ms 10840 KB Output is correct
83 Correct 121 ms 10864 KB Output is correct
84 Correct 165 ms 10868 KB Output is correct
85 Correct 157 ms 10848 KB Output is correct
86 Correct 133 ms 10820 KB Output is correct
87 Correct 150 ms 10740 KB Output is correct
88 Correct 177 ms 10948 KB Output is correct
89 Correct 167 ms 10800 KB Output is correct
90 Correct 161 ms 10744 KB Output is correct
91 Correct 122 ms 10516 KB Output is correct
92 Correct 138 ms 10440 KB Output is correct
93 Correct 123 ms 10736 KB Output is correct
94 Correct 146 ms 10692 KB Output is correct
95 Correct 143 ms 10656 KB Output is correct
96 Correct 157 ms 10720 KB Output is correct
97 Correct 139 ms 10532 KB Output is correct
98 Correct 136 ms 10396 KB Output is correct
99 Correct 1 ms 332 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 1 ms 336 KB Output is correct
102 Correct 2 ms 332 KB Output is correct
103 Correct 2 ms 332 KB Output is correct
104 Correct 2 ms 332 KB Output is correct
105 Correct 1 ms 332 KB Output is correct
106 Correct 2 ms 332 KB Output is correct
107 Correct 1 ms 332 KB Output is correct
108 Correct 2 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 1724 ms 67628 KB Output is correct
112 Correct 1486 ms 67608 KB Output is correct
113 Correct 1109 ms 67660 KB Output is correct
114 Correct 1168 ms 67552 KB Output is correct
115 Correct 1914 ms 67644 KB Output is correct
116 Correct 1821 ms 67580 KB Output is correct
117 Correct 1872 ms 67656 KB Output is correct
118 Correct 7 ms 940 KB Output is correct
119 Correct 7 ms 852 KB Output is correct
120 Correct 7 ms 876 KB Output is correct
121 Correct 7 ms 844 KB Output is correct
122 Correct 7 ms 844 KB Output is correct
123 Correct 7 ms 844 KB Output is correct
124 Correct 7 ms 844 KB Output is correct
125 Correct 6 ms 840 KB Output is correct
126 Correct 6 ms 844 KB Output is correct
127 Correct 6 ms 852 KB Output is correct
128 Correct 9 ms 916 KB Output is correct
129 Correct 7 ms 848 KB Output is correct
130 Correct 6 ms 912 KB Output is correct
131 Correct 1 ms 336 KB Output is correct
132 Correct 224 ms 11056 KB Output is correct
133 Correct 193 ms 10948 KB Output is correct
134 Correct 115 ms 10784 KB Output is correct
135 Correct 114 ms 11068 KB Output is correct
136 Correct 120 ms 11060 KB Output is correct
137 Correct 173 ms 10836 KB Output is correct
138 Correct 164 ms 10820 KB Output is correct
139 Correct 137 ms 10828 KB Output is correct
140 Correct 184 ms 10856 KB Output is correct
141 Correct 172 ms 11000 KB Output is correct
142 Correct 168 ms 10948 KB Output is correct
143 Correct 163 ms 10948 KB Output is correct
144 Correct 127 ms 10692 KB Output is correct
145 Correct 135 ms 10544 KB Output is correct
146 Correct 123 ms 11004 KB Output is correct
147 Correct 148 ms 10820 KB Output is correct
148 Correct 154 ms 10844 KB Output is correct
149 Correct 138 ms 10844 KB Output is correct
150 Correct 138 ms 10820 KB Output is correct
151 Correct 143 ms 10804 KB Output is correct
152 Execution timed out 2099 ms 278752 KB Time limit exceeded
153 Halted 0 ms 0 KB -