oj.uz

Submission #726108

# Submission time Handle Problem Language Result Execution time Memory
726108 2023-04-18T13:25:59 Z Alex_tz307 Dancing Elephants (IOI11_elephants) C++17
97 / 100
 9000 ms 8748 KB 
#include <bits/stdc++.h>
#include "elephants.h"
 
using namespace std;
 
const int kN = 1e5 + 5e4;
const int bucketSize = 400;
int n, len, a[kN], bucket[kN], indexInBucket[kN];
int updates, auxSize, auxIndices[kN];
 
class bucket_t {
  private:
    int N = 0, indices[2 * bucketSize];
    int req[2 * bucketSize], maxReach[2 * bucketSize];
 
  public:
    bool isEmpty() {
      return N == 0;
    }
 
    int getSize() {
      return N;
    }
 
    int last() {
      return a[indices[N - 1]];
    }
 
    void add(int index) {
      indices[N++] = index;
    }
 
    void addAll() {
      for (int i = 0; i < N; ++i) {
        auxIndices[auxSize++] = indices[i];
      }
      N = 0;
    }
 
    int cameras(int index) {
      return req[index];
    }
 
    int furthest(int index) {
      return maxReach[index];
    }
 
    void build() {
      int r = N - 1;
 
      for (int l = N - 1; l >= 0; --l) {
        while (a[indices[r]] - a[indices[l]] > len) {
          r -= 1;
        }
 
        if (r == N - 1) {
          req[l] = 1;
          maxReach[l] = a[indices[l]] + len;
        } else {
          req[l] = req[r + 1] + 1;
          maxReach[l] = maxReach[r + 1];
        }
      }
    }
 
    void rem(int pos) {
      for (int i = pos; i < N - 1; ++i) {
        indices[i] = indices[i + 1];
        indexInBucket[indices[i]] = i;
      }
 
      N -= 1;
 
      build();
    }
 
    void ins(int index) {
      int ptr = N - 1;
 
      while (ptr >= 0 && a[index] < a[indices[ptr]]) {
        ptr -= 1;
      }
 
      for (int i = N; i > ptr + 1; --i) {
        indices[i] = indices[i - 1];
        indexInBucket[indices[i]] = i;
      }
 
      indices[ptr + 1] = index;
      indexInBucket[index] = ptr + 1;
 
      N += 1;
 
      build();
    }
 
    int upperBound(int x) {
      int l = -1, r = N;
 
      while (r - l > 1) {
        int mid = (l + r) / 2;
 
        if (mid != -1 && (mid == N || x < a[indices[mid]])) {
          r = mid;
        } else {
          l = mid;
        }
      }
 
      return r;
    }
} buckets[bucketSize];
 
void init(int N, int L, int X[]) {
  n = N;
  len = L;
 
  for (int i = 0; i < n; ++i) {
    a[i] = X[i];
    bucket[i] = i / bucketSize;
    indexInBucket[i] = i % bucketSize;
    buckets[i / bucketSize].add(i);
  }
 
  for (int i = 0; i <= (n - 1) / bucketSize; ++i) {
    buckets[i].build();
  }
}
 
void rebuild() {
  auxSize = 0;
 
  for (int i = 0; i <= (n - 1) / bucketSize; ++i) {
    buckets[i].addAll();
  }
 
  for (int i = 0; i < n; ++i) {
    bucket[auxIndices[i]] = i / bucketSize;
    indexInBucket[auxIndices[i]] = i % bucketSize;
    buckets[i / bucketSize].add(auxIndices[i]);
  }
 
  for (int i = 0; i <= (n - 1) / bucketSize; ++i) {
    buckets[i].build();
  }
}
 
int query() {
  int res = 0;
 
  int reach = -1;
 
  for (int i = 0; i <= (n - 1) / bucketSize; ++i) {
    if (!buckets[i].isEmpty() && reach < buckets[i].last()) {
      int index = buckets[i].upperBound(reach);
      res += buckets[i].cameras(index);
      reach = buckets[i].furthest(index);
    }
  }
 
  return res;
}
 
int update(int index, int x) {
  buckets[bucket[index]].rem(indexInBucket[index]);
 
  a[index] = x;
  bucket[index] = -1;
 
  for (int i = 0; i <= (n - 1) / bucketSize && bucket[index] == -1; ++i) {
    if (!buckets[i].isEmpty() && x <= buckets[i].last()) {
      bucket[index] = i;
    }
  }
 
  if (bucket[index] == -1) {
    bucket[index] = (n - 1) / bucketSize;
  }
 
  buckets[bucket[index]].ins(index);
 
  updates += 1;
 
  if (updates == bucketSize) {
    rebuild();
    updates = 0;
  }
 
  return query();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 360 ms 2936 KB Output is correct
8 Correct 412 ms 3028 KB Output is correct
9 Correct 692 ms 4176 KB Output is correct
10 Correct 686 ms 4152 KB Output is correct
11 Correct 554 ms 4180 KB Output is correct
12 Correct 982 ms 4180 KB Output is correct
13 Correct 709 ms 4172 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 360 ms 2936 KB Output is correct
8 Correct 412 ms 3028 KB Output is correct
9 Correct 692 ms 4176 KB Output is correct
10 Correct 686 ms 4152 KB Output is correct
11 Correct 554 ms 4180 KB Output is correct
12 Correct 982 ms 4180 KB Output is correct
13 Correct 709 ms 4172 KB Output is correct
14 Correct 403 ms 3232 KB Output is correct
15 Correct 662 ms 3660 KB Output is correct
16 Correct 1610 ms 4404 KB Output is correct
17 Correct 1903 ms 5196 KB Output is correct
18 Correct 1949 ms 5192 KB Output is correct
19 Correct 1323 ms 5172 KB Output is correct
20 Correct 1958 ms 5196 KB Output is correct
21 Correct 1882 ms 5076 KB Output is correct
22 Correct 1321 ms 5072 KB Output is correct

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 360 ms 2936 KB Output is correct
8 Correct 412 ms 3028 KB Output is correct
9 Correct 692 ms 4176 KB Output is correct
10 Correct 686 ms 4152 KB Output is correct
11 Correct 554 ms 4180 KB Output is correct
12 Correct 982 ms 4180 KB Output is correct
13 Correct 709 ms 4172 KB Output is correct
14 Correct 403 ms 3232 KB Output is correct
15 Correct 662 ms 3660 KB Output is correct
16 Correct 1610 ms 4404 KB Output is correct
17 Correct 1903 ms 5196 KB Output is correct
18 Correct 1949 ms 5192 KB Output is correct
19 Correct 1323 ms 5172 KB Output is correct
20 Correct 1958 ms 5196 KB Output is correct
21 Correct 1882 ms 5076 KB Output is correct
22 Correct 1321 ms 5072 KB Output is correct
23 Correct 6689 ms 8632 KB Output is correct
24 Correct 6648 ms 8632 KB Output is correct
25 Correct 5928 ms 8632 KB Output is correct
26 Correct 6031 ms 8748 KB Output is correct
27 Correct 5947 ms 8628 KB Output is correct
28 Correct 1329 ms 3960 KB Output is correct
29 Correct 1253 ms 3844 KB Output is correct
30 Correct 1296 ms 3836 KB Output is correct
31 Correct 1260 ms 3836 KB Output is correct
32 Correct 4435 ms 8628 KB Output is correct
33 Correct 3389 ms 8652 KB Output is correct
34 Correct 6296 ms 8632 KB Output is correct
35 Correct 3292 ms 8628 KB Output is correct
36 Correct 1178 ms 8628 KB Output is correct
37 Correct 8093 ms 8632 KB Output is correct
38 Correct 6983 ms 8628 KB Output is correct
39 Correct 6208 ms 8628 KB Output is correct
40 Correct 7766 ms 8632 KB Output is correct
41 Correct 8922 ms 8632 KB Output is correct
42 Execution timed out 9028 ms 8636 KB Time limit exceeded
43 Halted 0 ms 0 KB -