oj.uz

Submission #793353

# Submission time Handle Problem Language Result Execution time Memory
793353 2023-07-25T18:15:38 Z arashMLG Global Warming (CEOI18_glo) C++17
100 / 100
 51 ms 8524 KB 
#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

//https://quera.org/profile/4dykhk

typedef long long     ll;
typedef long double   ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N = 2e5 + 23;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define F           first
#define S           second
#define pb          push_back
#define ms(x,y)     memset((x) , (y) , sizeof (x))
#define done        return cout<<endl , 0;
#define kill(x)     cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define pc(x)       __builtin_popcount(x)
#define ctz(x)      __builtin_ctz(x)
#define MinHeap(x)  priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x)  priority_queue<x, vector<x>>
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define int      ll

ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n,x;
int a[N];
vector<int> dp(N,inf);
int l[N];

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>x;
	for(int i=  0; i < n ; i++) cin>>a[i];
	
	for(int i = 0 ; i< n ; i ++) {
		int pos = lower_bound(all(dp),a[i]) - dp.begin();
		dp[pos] = a[i];
		l[i] = pos + 1;
	}
	int ans = *max_element(l,l+n);
	dp = vector<int>(N,inf);
	for(int i = n-1; i >= 0 ; i--) {
		int pos  = lower_bound(all(dp),-a[i] + x) - dp.begin();
		ans = max(ans,pos + l[i]);
		pos= lower_bound(all(dp),-a[i]) - dp.begin();
		dp[pos] = -a[i];
	}
	cout<<ans;
    done;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8408 KB Output is correct
2 Correct 49 ms 8468 KB Output is correct
3 Correct 51 ms 8496 KB Output is correct
4 Correct 50 ms 8480 KB Output is correct
5 Correct 36 ms 7756 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4680 KB Output is correct
2 Correct 13 ms 4624 KB Output is correct
3 Correct 13 ms 4692 KB Output is correct
4 Correct 10 ms 4536 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 10 ms 4436 KB Output is correct
7 Correct 11 ms 4692 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 6000 KB Output is correct
2 Correct 22 ms 5924 KB Output is correct
3 Correct 45 ms 8432 KB Output is correct
4 Correct 35 ms 7740 KB Output is correct
5 Correct 19 ms 5588 KB Output is correct
6 Correct 30 ms 7528 KB Output is correct
7 Correct 33 ms 8276 KB Output is correct
8 Correct 19 ms 5948 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3460 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3452 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3460 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 2 ms 3460 KB Output is correct
26 Correct 2 ms 3460 KB Output is correct
27 Correct 50 ms 8408 KB Output is correct
28 Correct 49 ms 8468 KB Output is correct
29 Correct 51 ms 8496 KB Output is correct
30 Correct 50 ms 8480 KB Output is correct
31 Correct 36 ms 7756 KB Output is correct
32 Correct 15 ms 4680 KB Output is correct
33 Correct 13 ms 4624 KB Output is correct
34 Correct 13 ms 4692 KB Output is correct
35 Correct 10 ms 4536 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct
37 Correct 10 ms 4436 KB Output is correct
38 Correct 11 ms 4692 KB Output is correct
39 Correct 22 ms 6000 KB Output is correct
40 Correct 22 ms 5924 KB Output is correct
41 Correct 45 ms 8432 KB Output is correct
42 Correct 35 ms 7740 KB Output is correct
43 Correct 19 ms 5588 KB Output is correct
44 Correct 30 ms 7528 KB Output is correct
45 Correct 33 ms 8276 KB Output is correct
46 Correct 19 ms 5948 KB Output is correct
47 Correct 25 ms 5912 KB Output is correct
48 Correct 25 ms 5972 KB Output is correct
49 Correct 50 ms 8400 KB Output is correct
50 Correct 36 ms 7656 KB Output is correct
51 Correct 31 ms 6664 KB Output is correct
52 Correct 37 ms 7760 KB Output is correct
53 Correct 32 ms 7768 KB Output is correct
54 Correct 34 ms 8524 KB Output is correct
55 Correct 40 ms 8468 KB Output is correct