oj.uz

Submission #960418

# Submission time Handle Problem Language Result Execution time Memory
960418 2024-04-10T12:25:04 Z vjudge1 Global Warming (CEOI18_glo) C++14
100 / 100
 105 ms 8780 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

struct FenwickTree{
   int n;
   vector<int> t;
   void init(int _n){
      n=_n;
      t.assign(n+1, 0);
   }
   void update(int pos, int val){
      for (int i=pos; i<=n; i+=i&(-i)) t[i]=max(t[i], val);
   }
   int get(int pos){
      int ans=0;
      for (int i=pos; i; i-=i&(-i)) ans=max(ans, t[i]);
      return ans;
   }
} bit[2];

const int N=2e5+10;
int n, x, a[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> x;
   for (int i=1; i<=n; ++i) cin >> a[i];
   vector<int> vals{-1};
   for (int i=1; i<=n; ++i) vals.push_back(a[i]);
   sort(vals.begin(), vals.end());
   vals.resize(unique(vals.begin(), vals.end())-vals.begin());
   bit[0].init((int)vals.size()-1);
   bit[1].init((int)vals.size()-1);
   for (int i=1; i<=n; ++i){
      int pi=lower_bound(vals.begin(), vals.end(), a[i])-vals.begin();
      int pid=lower_bound(vals.begin(), vals.end(), a[i]+x)-vals.begin();
      int f0=bit[0].get(pi-1)+1;
      int f1=max(bit[1].get(pi-1)+1, bit[0].get(pid-1)+1);
      bit[0].update(pi, f0);
      bit[1].update(pi, f1);
   }
   cout << max(bit[0].get((int)vals.size()-1), bit[1].get((int)vals.size()-1)) << '\n';
   return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 8776 KB Output is correct
2 Correct 103 ms 8652 KB Output is correct
3 Correct 88 ms 8780 KB Output is correct
4 Correct 96 ms 8720 KB Output is correct
5 Correct 42 ms 6088 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2520 KB Output is correct
2 Correct 22 ms 2648 KB Output is correct
3 Correct 21 ms 2640 KB Output is correct
4 Correct 10 ms 1760 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 1844 KB Output is correct
7 Correct 18 ms 2648 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 4568 KB Output is correct
2 Correct 36 ms 4564 KB Output is correct
3 Correct 76 ms 8652 KB Output is correct
4 Correct 41 ms 6116 KB Output is correct
5 Correct 22 ms 4308 KB Output is correct
6 Correct 39 ms 7736 KB Output is correct
7 Correct 42 ms 8396 KB Output is correct
8 Correct 31 ms 4564 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 91 ms 8776 KB Output is correct
28 Correct 103 ms 8652 KB Output is correct
29 Correct 88 ms 8780 KB Output is correct
30 Correct 96 ms 8720 KB Output is correct
31 Correct 42 ms 6088 KB Output is correct
32 Correct 21 ms 2520 KB Output is correct
33 Correct 22 ms 2648 KB Output is correct
34 Correct 21 ms 2640 KB Output is correct
35 Correct 10 ms 1760 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 13 ms 1844 KB Output is correct
38 Correct 18 ms 2648 KB Output is correct
39 Correct 37 ms 4568 KB Output is correct
40 Correct 36 ms 4564 KB Output is correct
41 Correct 76 ms 8652 KB Output is correct
42 Correct 41 ms 6116 KB Output is correct
43 Correct 22 ms 4308 KB Output is correct
44 Correct 39 ms 7736 KB Output is correct
45 Correct 42 ms 8396 KB Output is correct
46 Correct 31 ms 4564 KB Output is correct
47 Correct 43 ms 4556 KB Output is correct
48 Correct 43 ms 4568 KB Output is correct
49 Correct 105 ms 8772 KB Output is correct
50 Correct 43 ms 6088 KB Output is correct
51 Correct 39 ms 5076 KB Output is correct
52 Correct 55 ms 8112 KB Output is correct
53 Correct 40 ms 7880 KB Output is correct
54 Correct 46 ms 8660 KB Output is correct
55 Correct 75 ms 8660 KB Output is correct