oj.uz

Submission #1096329

# Submission time Handle Problem Language Result Execution time Memory
1096329 2024-10-04T09:41:32 Z kingdragon Global Warming (CEOI18_glo) C++14
100 / 100
 394 ms 28232 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, c[N];
void build(int id,int l, int r)
{
    if (l>r) return;
    if (l==r)
    {
        st[id]=c[l][c[l].size()-1];
        return;
    }
    int mid=(l+r)/2;
    build(id*2,l,mid);
    build(id*2+1,mid+1,r);
    st[id]=max(st[id*2],st[id*2+1]);
}
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]);
        c[i].pb(0);
    }
    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;
        int tv=lower_bound(b.begin(),b.end(),a[i])-b.begin();
        c[tv].pb(vt); 
        m.insert(tv);
    }
    b.pb(2e9+5);
    for (int i=1;i<=n;i++) cnt[i]=c[i].size()-1;
    for (int i: m)
    {
        for (int j=0;j<c[i].size();j++)
        {
            if (j==0) continue;
            c[i][j]=max(c[i][j],c[i][j-1]);
        }
    }
    build(1,1,n);
    int ans=0;
    for (int i=1;i<=n;i++)
    {
        int vt=lower_bound(b.begin(),b.end(),a[i])-b.begin();
        cnt[vt]--;
        up(1,1,n,vt,c[vt][cnt[vt]]);
        vt=upper_bound(b.begin(),b.end(),a[i]-x)-b.begin();
        ans=max(ans,get(1,1,n,vt,n) + t[i]);
    }
    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();
}

Compilation message

glo.cpp: In function 'void slove()':
glo.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         for (int j=0;j<c[i].size();j++)
      |                      ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 27988 KB Output is correct
2 Correct 394 ms 28104 KB Output is correct
3 Correct 378 ms 28232 KB Output is correct
4 Correct 381 ms 28104 KB Output is correct
5 Correct 157 ms 23732 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 13236 KB Output is correct
2 Correct 66 ms 13320 KB Output is correct
3 Correct 64 ms 13268 KB Output is correct
4 Correct 32 ms 12024 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 35 ms 11924 KB Output is correct
7 Correct 51 ms 13272 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 19636 KB Output is correct
2 Correct 136 ms 19444 KB Output is correct
3 Correct 360 ms 28104 KB Output is correct
4 Correct 131 ms 23660 KB Output is correct
5 Correct 69 ms 19408 KB Output is correct
6 Correct 134 ms 27336 KB Output is correct
7 Correct 143 ms 27332 KB Output is correct
8 Correct 129 ms 19408 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8796 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 1 ms 8800 KB Output is correct
16 Correct 1 ms 8796 KB Output is correct
17 Correct 1 ms 8796 KB Output is correct
18 Correct 1 ms 8796 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 3 ms 8796 KB Output is correct
22 Correct 3 ms 8796 KB Output is correct
23 Correct 2 ms 8796 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 371 ms 27988 KB Output is correct
28 Correct 394 ms 28104 KB Output is correct
29 Correct 378 ms 28232 KB Output is correct
30 Correct 381 ms 28104 KB Output is correct
31 Correct 157 ms 23732 KB Output is correct
32 Correct 63 ms 13236 KB Output is correct
33 Correct 66 ms 13320 KB Output is correct
34 Correct 64 ms 13268 KB Output is correct
35 Correct 32 ms 12024 KB Output is correct
36 Correct 1 ms 8796 KB Output is correct
37 Correct 35 ms 11924 KB Output is correct
38 Correct 51 ms 13272 KB Output is correct
39 Correct 145 ms 19636 KB Output is correct
40 Correct 136 ms 19444 KB Output is correct
41 Correct 360 ms 28104 KB Output is correct
42 Correct 131 ms 23660 KB Output is correct
43 Correct 69 ms 19408 KB Output is correct
44 Correct 134 ms 27336 KB Output is correct
45 Correct 143 ms 27332 KB Output is correct
46 Correct 129 ms 19408 KB Output is correct
47 Correct 152 ms 19412 KB Output is correct
48 Correct 149 ms 19416 KB Output is correct
49 Correct 392 ms 28096 KB Output is correct
50 Correct 130 ms 23772 KB Output is correct
51 Correct 106 ms 21196 KB Output is correct
52 Correct 190 ms 28148 KB Output is correct
53 Correct 146 ms 28104 KB Output is correct
54 Correct 143 ms 28220 KB Output is correct
55 Correct 320 ms 28108 KB Output is correct