oj.uz

Submission #936833

# Submission time Handle Problem Language Result Execution time Memory
936833 2024-03-02T19:18:28 Z ace5 Financial Report (JOI21_financial) C++17
0 / 100
 4000 ms 40516 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t

vector<int> segTree;
vector<int> dp;
vector<int> otr;
vector<int> a;
set<int> pos;
int n,d;

void modify(int i,int x,int l,int r,int indV)
{
    if(l > i || r < i)
        return ;
    else if(l == r)
    {
        segTree[indV] = x;
        return ;
    }
    int m = (l+r)/2;
    modify(i,x,l,m,indV*2+1);
    modify(i,x,m+1,r,indV*2+2);
    segTree[indV] = max(segTree[indV*2+1],segTree[indV*2+2]);
    return ;
}
int get1(int lx,int rx,int l,int r,int indV)
{
    if(l > rx || r < lx)
        return -1;
    else if(l >= lx && r <= rx)
    {
        if(l == r)
        {
            return (segTree[indV] == 1 ? l : -1);
        }
        else
        {
            if(segTree[indV] == 0)
            {
                return -1;
            }
            int m = (l+r)/2;
            int t = get1(lx,rx,l,m,indV*2+1);
            if(t != -1)
            {
                return t;
            }
            else
            {
                return get1(lx,rx,m+1,r,indV*2+2);
            }
        }
    }
    int m = (l+r)/2;
    int t = get1(lx,rx,l,m,indV*2+1);
    if(t != -1)
        return t;
    else
        return get1(lx,rx,m+1,r,indV*2+1);
}
int get2(int lx,int rx,int l,int r,int indV)
{
    if(l > rx || r < lx)
        return 0;
    else if(l >= lx && r <= rx)
        return segTree[indV];
    int m = (l+r)/2;
    int sl = get2(lx,rx,l,m,indV*2+1);
    int sr = get2(lx,rx,m+1,r,indV*2+2);
    return max(sl,sr);
}
void ins(int x)
{
    pos.insert(x);
    auto it = pos.find(x);
    if(it != pos.begin())
    {
        it--;
        if(x-(*it) <= d)
        {
            modify(*it,0,0,n-1,0);
        }
        else
        {
            modify(*it,1,0,n-1,0);
        }
        it++;
    }
    it++;
    if(it == pos.end())
    {
        modify(x,1,0,n-1,0);
    }
    else
    {
        if((*it)-x <= d)
        {
            modify(x,0,0,n-1,0);
        }
        else
            modify(x,1,0,n-1,0);
    }
    return ;
}


signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> d;
    a.resize(n);
    segTree.resize(4*n);
    dp.resize(n);
    otr.resize(n);
    vector<pair<int,int>> b;
    for(int i = 0;i < n;++i)
    {
        cin >> a[i];
        b.push_back({a[i],i});
    }
    sort(b.begin(),b.end());
    for(int i = 0;i < n;++i)
    {
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            ins(b[j].second);
        }
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            otr[b[j].second] = min(n-1,get1(b[j].second,n-1,0,n-1,0)+d);
        }
    }
    for(int i = 0;i < n;++i)
    {
        b[i].second = -b[i].second;
    }
    segTree.clear();
    segTree.resize(4*n);
    sort(b.rbegin(),b.rend());
    int ans = 0;
    for(int i = 0;i < n;++i)
    {
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            dp[-b[j].second] = get2(-b[j].second+1,otr[-b[j].second],0,n-1,0)+1;
            ans = max(ans,dp[-b[j].second]);
        }
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            modify(-b[j].second,dp[-b[j].second],0,n-1,0);
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4011 ms 40516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4086 ms 40376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -