Submission #827735

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
827735	2023-08-16T17:07:09 Z	bachhoangxuan	Global Warming (CEOI18_glo)	C++17	100 / 100	139 ms	13388 KB

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,x,a[maxn];
struct BIT{
    int bit[2*maxn];
    BIT(){memset(bit,0,sizeof(bit));}
    void update(int x,int val){
        for(int i=x;i<=2*n;i+=(i&(-i))) bit[i]=max(bit[i],val);
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res=max(res,bit[i]);
        return res;
    }
}d0,d1;

void solve(){
    cin >> n >> x;
    vector<int> com;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        com.push_back(a[i]);
        com.push_back(a[i]+x);
    }
    sort(com.begin(),com.end());
    com.erase(unique(com.begin(),com.end()),com.end());
    auto get_pos = [&](int x){
        return lower_bound(com.begin(),com.end(),x)-com.begin()+1;
    };
    int ans=0;
    for(int i=1;i<=n;i++){
        int p0=get_pos(a[i]),p1=get_pos(a[i]+x);
        int dp0=d0.query(p0-1)+1;
        int dp1=max(d1.query(p0-1),d0.query(p1-1))+1;
        d0.update(p0,dp0);d1.update(p0,dp1);
        ans=max({ans,dp0,dp1});
    }
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	117 ms	13348 KB	Output is correct
2	Correct	109 ms	13388 KB	Output is correct
3	Correct	109 ms	13328 KB	Output is correct
4	Correct	111 ms	13352 KB	Output is correct
5	Correct	58 ms	12872 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	8532 KB	Output is correct
2	Correct	27 ms	8392 KB	Output is correct
3	Correct	27 ms	8396 KB	Output is correct
4	Correct	14 ms	8276 KB	Output is correct
5	Correct	3 ms	6484 KB	Output is correct
6	Correct	15 ms	8264 KB	Output is correct
7	Correct	24 ms	8500 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	10064 KB	Output is correct
2	Correct	64 ms	10084 KB	Output is correct
3	Correct	139 ms	13360 KB	Output is correct
4	Correct	64 ms	12844 KB	Output is correct
5	Correct	35 ms	9800 KB	Output is correct
6	Correct	58 ms	12840 KB	Output is correct
7	Correct	61 ms	13388 KB	Output is correct
8	Correct	47 ms	10116 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	6484 KB	Output is correct
2	Correct	2 ms	6484 KB	Output is correct
3	Correct	3 ms	6484 KB	Output is correct
4	Correct	2 ms	6484 KB	Output is correct
5	Correct	3 ms	6484 KB	Output is correct
6	Correct	3 ms	6484 KB	Output is correct
7	Correct	2 ms	6484 KB	Output is correct
8	Correct	4 ms	6592 KB	Output is correct
9	Correct	3 ms	6484 KB	Output is correct
10	Correct	3 ms	6484 KB	Output is correct
11	Correct	3 ms	6484 KB	Output is correct
12	Correct	3 ms	6484 KB	Output is correct
13	Correct	2 ms	6484 KB	Output is correct
14	Correct	3 ms	6592 KB	Output is correct
15	Correct	3 ms	6484 KB	Output is correct
16	Correct	2 ms	6592 KB	Output is correct
17	Correct	3 ms	6484 KB	Output is correct
18	Correct	3 ms	6588 KB	Output is correct
19	Correct	3 ms	6612 KB	Output is correct
20	Correct	3 ms	6612 KB	Output is correct
21	Correct	3 ms	6596 KB	Output is correct
22	Correct	3 ms	6612 KB	Output is correct
23	Correct	3 ms	6596 KB	Output is correct
24	Correct	3 ms	6596 KB	Output is correct
25	Correct	3 ms	6612 KB	Output is correct
26	Correct	3 ms	6532 KB	Output is correct
27	Correct	117 ms	13348 KB	Output is correct
28	Correct	109 ms	13388 KB	Output is correct
29	Correct	109 ms	13328 KB	Output is correct
30	Correct	111 ms	13352 KB	Output is correct
31	Correct	58 ms	12872 KB	Output is correct
32	Correct	31 ms	8532 KB	Output is correct
33	Correct	27 ms	8392 KB	Output is correct
34	Correct	27 ms	8396 KB	Output is correct
35	Correct	14 ms	8276 KB	Output is correct
36	Correct	3 ms	6484 KB	Output is correct
37	Correct	15 ms	8264 KB	Output is correct
38	Correct	24 ms	8500 KB	Output is correct
39	Correct	60 ms	10064 KB	Output is correct
40	Correct	64 ms	10084 KB	Output is correct
41	Correct	139 ms	13360 KB	Output is correct
42	Correct	64 ms	12844 KB	Output is correct
43	Correct	35 ms	9800 KB	Output is correct
44	Correct	58 ms	12840 KB	Output is correct
45	Correct	61 ms	13388 KB	Output is correct
46	Correct	47 ms	10116 KB	Output is correct
47	Correct	53 ms	10064 KB	Output is correct
48	Correct	54 ms	10172 KB	Output is correct
49	Correct	116 ms	13372 KB	Output is correct
50	Correct	53 ms	12804 KB	Output is correct
51	Correct	47 ms	12620 KB	Output is correct
52	Correct	63 ms	12876 KB	Output is correct
53	Correct	66 ms	12832 KB	Output is correct
54	Correct	69 ms	13324 KB	Output is correct
55	Correct	93 ms	13388 KB	Output is correct

Submission #827735

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0