oj.uz

Submission #972250

# Submission time Handle Problem Language Result Execution time Memory
972250 2024-04-30T10:00:55 Z sofija6 Global Warming (CEOI18_glo) C++14
100 / 100
 448 ms 37956 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
ll n,sz,t[MAXN],a[MAXN],l[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];
        }
    }
    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);
    }
    cout << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 37748 KB Output is correct
2 Correct 409 ms 37568 KB Output is correct
3 Correct 397 ms 37788 KB Output is correct
4 Correct 415 ms 37956 KB Output is correct
5 Correct 200 ms 25284 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 14280 KB Output is correct
2 Correct 84 ms 14540 KB Output is correct
3 Correct 78 ms 14280 KB Output is correct
4 Correct 37 ms 11216 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 42 ms 11248 KB Output is correct
7 Correct 68 ms 14284 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 22212 KB Output is correct
2 Correct 168 ms 22212 KB Output is correct
3 Correct 410 ms 37624 KB Output is correct
4 Correct 177 ms 25116 KB Output is correct
5 Correct 114 ms 21700 KB Output is correct
6 Correct 220 ms 35776 KB Output is correct
7 Correct 226 ms 36284 KB Output is correct
8 Correct 146 ms 22112 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6744 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 1 ms 6608 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6780 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6608 KB Output is correct
27 Correct 448 ms 37748 KB Output is correct
28 Correct 409 ms 37568 KB Output is correct
29 Correct 397 ms 37788 KB Output is correct
30 Correct 415 ms 37956 KB Output is correct
31 Correct 200 ms 25284 KB Output is correct
32 Correct 79 ms 14280 KB Output is correct
33 Correct 84 ms 14540 KB Output is correct
34 Correct 78 ms 14280 KB Output is correct
35 Correct 37 ms 11216 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 42 ms 11248 KB Output is correct
38 Correct 68 ms 14284 KB Output is correct
39 Correct 186 ms 22212 KB Output is correct
40 Correct 168 ms 22212 KB Output is correct
41 Correct 410 ms 37624 KB Output is correct
42 Correct 177 ms 25116 KB Output is correct
43 Correct 114 ms 21700 KB Output is correct
44 Correct 220 ms 35776 KB Output is correct
45 Correct 226 ms 36284 KB Output is correct
46 Correct 146 ms 22112 KB Output is correct
47 Correct 175 ms 22260 KB Output is correct
48 Correct 177 ms 22468 KB Output is correct
49 Correct 448 ms 37536 KB Output is correct
50 Correct 180 ms 25360 KB Output is correct
51 Correct 156 ms 24516 KB Output is correct
52 Correct 251 ms 37056 KB Output is correct
53 Correct 254 ms 36948 KB Output is correct
54 Correct 233 ms 37768 KB Output is correct
55 Correct 314 ms 37824 KB Output is correct