oj.uz

Submission #1096332

# Submission time Handle Problem Language Result Execution time Memory
1096332 2024-10-04T09:45:21 Z MinhTri2k8 Global Warming (CEOI18_glo) C++14
100 / 100
 417 ms 27748 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 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 27612 KB Output is correct
2 Correct 388 ms 27592 KB Output is correct
3 Correct 403 ms 27436 KB Output is correct
4 Correct 381 ms 27588 KB Output is correct
5 Correct 150 ms 23252 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 10808 KB Output is correct
2 Correct 68 ms 10712 KB Output is correct
3 Correct 67 ms 10700 KB Output is correct
4 Correct 36 ms 9564 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 35 ms 9512 KB Output is correct
7 Correct 53 ms 10816 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 16340 KB Output is correct
2 Correct 137 ms 16336 KB Output is correct
3 Correct 349 ms 27592 KB Output is correct
4 Correct 130 ms 23248 KB Output is correct
5 Correct 74 ms 16324 KB Output is correct
6 Correct 145 ms 26568 KB Output is correct
7 Correct 137 ms 26568 KB Output is correct
8 Correct 96 ms 16280 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5300 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5212 KB Output is correct
24 Correct 3 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 3 ms 5212 KB Output is correct
27 Correct 417 ms 27612 KB Output is correct
28 Correct 388 ms 27592 KB Output is correct
29 Correct 403 ms 27436 KB Output is correct
30 Correct 381 ms 27588 KB Output is correct
31 Correct 150 ms 23252 KB Output is correct
32 Correct 68 ms 10808 KB Output is correct
33 Correct 68 ms 10712 KB Output is correct
34 Correct 67 ms 10700 KB Output is correct
35 Correct 36 ms 9564 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 35 ms 9512 KB Output is correct
38 Correct 53 ms 10816 KB Output is correct
39 Correct 154 ms 16340 KB Output is correct
40 Correct 137 ms 16336 KB Output is correct
41 Correct 349 ms 27592 KB Output is correct
42 Correct 130 ms 23248 KB Output is correct
43 Correct 74 ms 16324 KB Output is correct
44 Correct 145 ms 26568 KB Output is correct
45 Correct 137 ms 26568 KB Output is correct
46 Correct 96 ms 16280 KB Output is correct
47 Correct 152 ms 16340 KB Output is correct
48 Correct 150 ms 16304 KB Output is correct
49 Correct 393 ms 27748 KB Output is correct
50 Correct 139 ms 23060 KB Output is correct
51 Correct 107 ms 19816 KB Output is correct
52 Correct 191 ms 27588 KB Output is correct
53 Correct 149 ms 27584 KB Output is correct
54 Correct 148 ms 27588 KB Output is correct
55 Correct 275 ms 27608 KB Output is correct