oj.uz

Submission #1096716

# Submission time Handle Problem Language Result Execution time Memory
1096716 2024-10-05T03:24:58 Z kingdragon Global Warming (CEOI18_glo) C++14
100 / 100
 210 ms 17868 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ll long long
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define iil pair<ll,ll>
#define iiil pair<ll,pair<ll,ll>>
#define oo 1e18
#define check(n) (prime[n>>6]&(1<<((n&63)>>1)))
#define set(n) prime[n>>6]|=(1<<((n&63)>>1))
using namespace std;
const int N=2e5+5;
const ll Mod=1e9+7;
const ll MOD=13141702292180207;
const int dx[]={-1,0,0,1};
const int dy[]={0,-1,1,0};
 
 
int n, a[N], st[4*N], d[N], cnt[N];
int t[N], s[N], x;
set<int> m;
vector<int> b;
void up(int id,int l,int r, int u,int val)
{
    if (u>r || l>u || l>r) return;
    if (l==r)
    {
        st[id]=val;
        return;
    }
    int mid=(l+r)/2;
    up(id*2,l,mid,u,val);
    up(id*2+1,mid+1,r,u,val);
    st[id]=max(st[id*2],st[id*2+1]);
}
 
int get(int id,int l,int r,int u,int v)
{
    if (l>r || u>v || l>v || u>r) return 0;
    if (u<=l && r<=v) return st[id];
    int mid=(l+r)/2;
    return max(get(id*2,l,mid,u,v), get(id*2+1,mid+1,r,u,v));
}
void slove()
{
    cin >> n >> x; 
    m.insert(-500);
    for (int i=1;i<=n;i++)
    {
        cin >> a[i];
        d[i]=2e9+5;
        m.insert(a[i]);
    }
    for (int i: m) b.pb(i); 
    m.clear();
    for (int i=1;i<=n;i++)
    {
        int vt=lower_bound(d+1,d+1+n,a[i])-d;
        d[vt]=a[i];
        t[i]=vt;
    }
    for (int i=1;i<=n;i++) d[i]=2e9+5;
    for (int i=n;i>=1;i--)
    {
        int vt=lower_bound(d+1,d+1+n,-a[i])-d;
        d[vt]=-a[i];
        s[i]=vt;
    }
    b.pb(2e9+5);
    int ans=0;
    for (int i=1;i<n;i++)
    {
        int vt=lower_bound(b.begin(),b.end(),a[i])-b.begin();
        up(1,1,n,vt,t[i]);
        vt=lower_bound(b.begin(),b.end(),a[i+1]+x)-b.begin();
        vt--;
        ans=max(ans,s[i+1]+get(1,1,n,1,vt));
    }
    cout << ans;
 
}
int main()
{
    //freopen("test.inp","r",stdin);
    //freopen("test.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cout.tie(0); cin.tie(0);
    int T=1;
    //cin >> T;
    while(T--) slove();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 472 KB Output is correct
25 Correct 1 ms 348 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 210 ms 17676 KB Output is correct
2 Correct 209 ms 17756 KB Output is correct
3 Correct 199 ms 17868 KB Output is correct
4 Correct 197 ms 17864 KB Output is correct
5 Correct 92 ms 10912 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4812 KB Output is correct
2 Correct 42 ms 4724 KB Output is correct
3 Correct 41 ms 4768 KB Output is correct
4 Correct 23 ms 3164 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 23 ms 3108 KB Output is correct
7 Correct 33 ms 4824 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 9160 KB Output is correct
2 Correct 84 ms 9416 KB Output is correct
3 Correct 179 ms 17704 KB Output is correct
4 Correct 99 ms 10956 KB Output is correct
5 Correct 46 ms 8648 KB Output is correct
6 Correct 98 ms 16268 KB Output is correct
7 Correct 92 ms 17012 KB Output is correct
8 Correct 65 ms 9220 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 472 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 210 ms 17676 KB Output is correct
28 Correct 209 ms 17756 KB Output is correct
29 Correct 199 ms 17868 KB Output is correct
30 Correct 197 ms 17864 KB Output is correct
31 Correct 92 ms 10912 KB Output is correct
32 Correct 42 ms 4812 KB Output is correct
33 Correct 42 ms 4724 KB Output is correct
34 Correct 41 ms 4768 KB Output is correct
35 Correct 23 ms 3164 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 23 ms 3108 KB Output is correct
38 Correct 33 ms 4824 KB Output is correct
39 Correct 82 ms 9160 KB Output is correct
40 Correct 84 ms 9416 KB Output is correct
41 Correct 179 ms 17704 KB Output is correct
42 Correct 99 ms 10956 KB Output is correct
43 Correct 46 ms 8648 KB Output is correct
44 Correct 98 ms 16268 KB Output is correct
45 Correct 92 ms 17012 KB Output is correct
46 Correct 65 ms 9220 KB Output is correct
47 Correct 89 ms 9160 KB Output is correct
48 Correct 101 ms 9340 KB Output is correct
49 Correct 201 ms 17864 KB Output is correct
50 Correct 99 ms 10952 KB Output is correct
51 Correct 78 ms 10044 KB Output is correct
52 Correct 123 ms 17208 KB Output is correct
53 Correct 94 ms 17096 KB Output is correct
54 Correct 100 ms 17672 KB Output is correct
55 Correct 161 ms 17648 KB Output is correct