oj.uz

Submission #515736

# Submission time Handle Problem Language Result Execution time Memory
515736 2022-01-19T14:51:19 Z MilosMilutinovic Global Warming (CEOI18_glo) C++14
100 / 100
 149 ms 9436 KB 
#include <bits/stdc++.h>

using namespace std;

template <typename T>
class fenwick {
  public:
  vector<T> fenw;
  int n;
  fenwick(int _n) : n(_n) {
    fenw.resize(n);
  }
  void modify(int x, T v) {
    while (x < n) {
      fenw[x] += v;
      x |= (x + 1);
    }
  }
  T get(int x) {
    T v{};
    while (x >= 0) {
      v += fenw[x];
      x = (x & (x + 1)) - 1;
    }
    return v;
  }
};
struct node {
  int a = 0; // don't forget to set default value
  inline void operator += (node &other) {
    a = max(a, other.a);
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, x;
  cin >> n >> x;
  vector<int> a(n);
  vector<int> cs;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    cs.push_back(a[i]);
    cs.push_back(a[i] + x);
  }
  sort(cs.begin(), cs.end());
  cs.erase(unique(cs.begin(), cs.end()), cs.end());
  int ans = 0;
  vector<fenwick<node>> fenw(2, fenwick<node>(n * 2));
  for (int i = 0; i < n; i++) {
    int vx = lower_bound(cs.begin(), cs.end(), a[i]) - cs.begin();
    int dp1 = fenw[0].get(vx - 1).a + 1;
    ans = max(ans, dp1);
    fenw[0].modify(vx, {dp1});
    int vy = lower_bound(cs.begin(), cs.end(), a[i] + x) - cs.begin();
    int dp2 = max(dp1, fenw[1].get(vy - 1).a + 1);
    ans = max(ans, dp2);
    fenw[1].modify(vy, {dp2});
    fenw[1].modify(vx, {dp1});
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 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 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 7404 KB Output is correct
2 Correct 131 ms 7408 KB Output is correct
3 Correct 128 ms 7484 KB Output is correct
4 Correct 121 ms 7400 KB Output is correct
5 Correct 82 ms 7452 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2172 KB Output is correct
2 Correct 34 ms 2236 KB Output is correct
3 Correct 39 ms 2224 KB Output is correct
4 Correct 15 ms 2300 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 21 ms 2580 KB Output is correct
7 Correct 26 ms 2628 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3944 KB Output is correct
2 Correct 74 ms 4920 KB Output is correct
3 Correct 143 ms 9332 KB Output is correct
4 Correct 78 ms 8616 KB Output is correct
5 Correct 36 ms 4548 KB Output is correct
6 Correct 71 ms 8240 KB Output is correct
7 Correct 72 ms 8988 KB Output is correct
8 Correct 53 ms 4976 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 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 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 132 ms 7404 KB Output is correct
28 Correct 131 ms 7408 KB Output is correct
29 Correct 128 ms 7484 KB Output is correct
30 Correct 121 ms 7400 KB Output is correct
31 Correct 82 ms 7452 KB Output is correct
32 Correct 29 ms 2172 KB Output is correct
33 Correct 34 ms 2236 KB Output is correct
34 Correct 39 ms 2224 KB Output is correct
35 Correct 15 ms 2300 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 21 ms 2580 KB Output is correct
38 Correct 26 ms 2628 KB Output is correct
39 Correct 64 ms 3944 KB Output is correct
40 Correct 74 ms 4920 KB Output is correct
41 Correct 143 ms 9332 KB Output is correct
42 Correct 78 ms 8616 KB Output is correct
43 Correct 36 ms 4548 KB Output is correct
44 Correct 71 ms 8240 KB Output is correct
45 Correct 72 ms 8988 KB Output is correct
46 Correct 53 ms 4976 KB Output is correct
47 Correct 65 ms 4924 KB Output is correct
48 Correct 62 ms 4884 KB Output is correct
49 Correct 149 ms 9364 KB Output is correct
50 Correct 68 ms 8652 KB Output is correct
51 Correct 56 ms 6524 KB Output is correct
52 Correct 73 ms 8628 KB Output is correct
53 Correct 79 ms 8668 KB Output is correct
54 Correct 74 ms 9436 KB Output is correct
55 Correct 119 ms 9360 KB Output is correct