oj.uz

Submission #316763

# Submission time Handle Problem Language Result Execution time Memory
316763 2020-10-27T23:48:57 Z LifeHappen__ Global Warming (CEOI18_glo) C++14
100 / 100
 63 ms 4216 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define forinc(a,b,c) for(int a=b, _c=c; a<=_c; ++a)
#define fordec(a,b,c) for(int a=b, _c=c; a>=_c; --a)
#define forv(a,b) for(auto &a:b)
#define fasty ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ar array
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(a) begin(a),end(a)
#define reset(f,x) memset(f,x,sizeof(f))
#define bit(x,i) (x>>(i-1)&1ll)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1ll<<(i-1)))

const int N=2e5+5;
int n,x,a[N],b[N],pf[N],m;

int32_t main(){
   fasty;

   cin>>n>>x;
   forinc(i,1,n) cin>>a[i];
   forinc(i,1,n){
      int k=lower_bound(b+1, b+m+1, a[i])-b;
      b[k]=a[i];
      m=max(m,k);
      pf[i]=k;
   }
   int ans=0; m=0;
   fordec(i,n,1){
      ans=max(ans, (int)(lower_bound(b+1, b+m+1, a[i], greater<int>())-b-1)+pf[i]);
      int k=lower_bound(b+1, b+m+1, a[i]+x, greater<int>())-b;
      b[k]=a[i]+x;
      m=max(m,k);
   }
   cout<<ans<<'\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3832 KB Output is correct
2 Correct 59 ms 3888 KB Output is correct
3 Correct 58 ms 3832 KB Output is correct
4 Correct 58 ms 3832 KB Output is correct
5 Correct 31 ms 3456 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1280 KB Output is correct
2 Correct 14 ms 1280 KB Output is correct
3 Correct 15 ms 1280 KB Output is correct
4 Correct 8 ms 1152 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 11 ms 1280 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2048 KB Output is correct
2 Correct 24 ms 2048 KB Output is correct
3 Correct 50 ms 3892 KB Output is correct
4 Correct 31 ms 3448 KB Output is correct
5 Correct 15 ms 1920 KB Output is correct
6 Correct 27 ms 3456 KB Output is correct
7 Correct 34 ms 4096 KB Output is correct
8 Correct 20 ms 2176 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 59 ms 3832 KB Output is correct
28 Correct 59 ms 3888 KB Output is correct
29 Correct 58 ms 3832 KB Output is correct
30 Correct 58 ms 3832 KB Output is correct
31 Correct 31 ms 3456 KB Output is correct
32 Correct 14 ms 1280 KB Output is correct
33 Correct 14 ms 1280 KB Output is correct
34 Correct 15 ms 1280 KB Output is correct
35 Correct 8 ms 1152 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 8 ms 1152 KB Output is correct
38 Correct 11 ms 1280 KB Output is correct
39 Correct 24 ms 2048 KB Output is correct
40 Correct 24 ms 2048 KB Output is correct
41 Correct 50 ms 3892 KB Output is correct
42 Correct 31 ms 3448 KB Output is correct
43 Correct 15 ms 1920 KB Output is correct
44 Correct 27 ms 3456 KB Output is correct
45 Correct 34 ms 4096 KB Output is correct
46 Correct 20 ms 2176 KB Output is correct
47 Correct 29 ms 2048 KB Output is correct
48 Correct 29 ms 2048 KB Output is correct
49 Correct 63 ms 3832 KB Output is correct
50 Correct 31 ms 3456 KB Output is correct
51 Correct 27 ms 2816 KB Output is correct
52 Correct 31 ms 3584 KB Output is correct
53 Correct 30 ms 3584 KB Output is correct
54 Correct 35 ms 4216 KB Output is correct
55 Correct 46 ms 3960 KB Output is correct