oj.uz

Submission #972246

# Submission time Handle Problem Language Result Execution time Memory
972246 2024-04-30T09:53:35 Z sofija6 Global Warming (CEOI18_glo) C++14
100 / 100
 525 ms 39464 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
ll n,sz,t[MAXN],a[MAXN],l[MAXN],r[MAXN],lisl[MAXN],lisr[MAXN];
map<ll,ll> val;
set<ll> s;
vector<ll> v;
struct seg_tree
{
    vector<ll> st;
    void Init()
    {
        st.clear();
        sz=1;
        while (sz<n)
            sz <<= 1;
        st.resize(2*sz+2);
    }
    void Update(ll pos,ll val,ll x,ll lx,ll rx)
    {
        if (lx==rx)
        {
            st[x]=val;
            return;
        }
        ll mid=(lx+rx)/2;
        if (pos<=mid)
            Update(pos,val,2*x,lx,mid);
        else
            Update(pos,val,2*x+1,mid+1,rx);
        st[x]=max(st[2*x],st[2*x+1]);
    }
    ll Calc(ll l,ll r,ll x,ll lx,ll rx)
    {
        if (lx>r || rx<l)
            return 0;
        if (lx>=l && rx<=r)
            return st[x];
        ll mid=(lx+rx)/2;
        return max(Calc(l,r,2*x,lx,mid),Calc(l,r,2*x+1,mid+1,rx));
    }
};
seg_tree S;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll x,cur=1;
    cin >> n >> x;
    for (ll i=1;i<=n;i++)
    {
        cin >> t[i];
        s.insert(t[i]);
    }
    for (ll i : s)
    {
        val[i]=cur++;
        v.push_back(i);
    }
    for (ll i : v)
    {
        auto it=upper_bound(v.begin(),v.end(),i-1+x);
        if (it!=v.begin())
        {
            it--;
            l[val[i]]=val[*it];
        }
        it=lower_bound(v.begin(),v.end(),i+1-x);
        if (it!=v.end())
            r[val[i]]=val[*it];
    }
    S.Init();
    for (ll i=1;i<=n;i++)
    {
        a[i]=val[t[i]];
        ll maxx=0;
        if (a[i]!=1)
            maxx=S.Calc(1,a[i]-1,1,1,sz);
        lisl[i]=maxx+1;
        S.Update(a[i],maxx+1,1,1,sz);
    }
    S.Init();
    for (ll i=n;i>0;i--)
    {
        ll maxx=0;
        if (a[i]!=n)
            maxx=S.Calc(a[i]+1,n,1,1,sz);
        lisr[i]=maxx+1;
        S.Update(a[i],maxx+1,1,1,sz);
    }
    S.Init();
    ll ans=0;
    for (ll i=1;i<=n;i++)
    {
        if (l[a[i]])
            ans=max(ans,S.Calc(1,l[a[i]],1,1,sz)+lisr[i]);
        S.Update(a[i],lisl[i],1,1,sz);
    }
    S.Init();
    for (ll i=n;i>0;i--)
    {
        if (r[a[i]])
            ans=max(ans,lisl[i]+S.Calc(r[a[i]],n,1,1,sz));
        S.Update(a[i],lisr[i],1,1,sz);
    }
    cout << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8656 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 3 ms 8796 KB Output is correct
20 Correct 3 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 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8664 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 39360 KB Output is correct
2 Correct 522 ms 39356 KB Output is correct
3 Correct 520 ms 39256 KB Output is correct
4 Correct 519 ms 39356 KB Output is correct
5 Correct 221 ms 26820 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 16076 KB Output is correct
2 Correct 101 ms 16080 KB Output is correct
3 Correct 101 ms 16160 KB Output is correct
4 Correct 50 ms 13088 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 56 ms 13168 KB Output is correct
7 Correct 89 ms 16080 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 23824 KB Output is correct
2 Correct 195 ms 23752 KB Output is correct
3 Correct 462 ms 39252 KB Output is correct
4 Correct 199 ms 26668 KB Output is correct
5 Correct 143 ms 23328 KB Output is correct
6 Correct 267 ms 37200 KB Output is correct
7 Correct 271 ms 37824 KB Output is correct
8 Correct 165 ms 23748 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8656 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 3 ms 8796 KB Output is correct
20 Correct 3 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 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8664 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 525 ms 39360 KB Output is correct
28 Correct 522 ms 39356 KB Output is correct
29 Correct 520 ms 39256 KB Output is correct
30 Correct 519 ms 39356 KB Output is correct
31 Correct 221 ms 26820 KB Output is correct
32 Correct 101 ms 16076 KB Output is correct
33 Correct 101 ms 16080 KB Output is correct
34 Correct 101 ms 16160 KB Output is correct
35 Correct 50 ms 13088 KB Output is correct
36 Correct 1 ms 8540 KB Output is correct
37 Correct 56 ms 13168 KB Output is correct
38 Correct 89 ms 16080 KB Output is correct
39 Correct 195 ms 23824 KB Output is correct
40 Correct 195 ms 23752 KB Output is correct
41 Correct 462 ms 39252 KB Output is correct
42 Correct 199 ms 26668 KB Output is correct
43 Correct 143 ms 23328 KB Output is correct
44 Correct 267 ms 37200 KB Output is correct
45 Correct 271 ms 37824 KB Output is correct
46 Correct 165 ms 23748 KB Output is correct
47 Correct 218 ms 23816 KB Output is correct
48 Correct 213 ms 23656 KB Output is correct
49 Correct 503 ms 39208 KB Output is correct
50 Correct 228 ms 26984 KB Output is correct
51 Correct 192 ms 26124 KB Output is correct
52 Correct 338 ms 38592 KB Output is correct
53 Correct 286 ms 38592 KB Output is correct
54 Correct 289 ms 39244 KB Output is correct
55 Correct 416 ms 39464 KB Output is correct