oj.uz

Submission #936835

# Submission time Handle Problem Language Result Execution time Memory
936835 2024-03-02T19:34:17 Z ace5 Financial Report (JOI21_financial) C++17
100 / 100
 662 ms 40460 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+2);
}
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)
    {
        int lj = i;
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            lj = j;
            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);
        }
        i = lj;
    }
    segTree.clear();
    segTree.resize(4*n);
    sort(b.rbegin(),b.rend());
    int ans = 0;
    for(int i = 0;i < n;++i)
    {
        int lj = i;
        for(int j = i;j < n;++j)
        {
            if(b[j].first != b[i].first)
            {
                break;
            }
            lj = j;
            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);
        }
        i = lj;
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 440 KB Output is correct
8 Correct 0 ms 344 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 440 KB Output is correct
8 Correct 0 ms 344 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 496 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 440 KB Output is correct
8 Correct 0 ms 344 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 496 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 8 ms 1116 KB Output is correct
42 Correct 7 ms 1116 KB Output is correct
43 Correct 7 ms 1328 KB Output is correct
44 Correct 7 ms 1116 KB Output is correct
45 Correct 7 ms 1116 KB Output is correct
46 Correct 8 ms 1116 KB Output is correct
47 Correct 7 ms 1112 KB Output is correct
48 Correct 7 ms 1132 KB Output is correct
49 Correct 8 ms 1116 KB Output is correct
50 Correct 8 ms 1368 KB Output is correct
51 Correct 7 ms 1116 KB Output is correct
52 Correct 8 ms 1112 KB Output is correct
53 Correct 6 ms 1240 KB Output is correct
54 Correct 7 ms 1112 KB Output is correct
55 Correct 8 ms 1324 KB Output is correct
56 Correct 8 ms 1116 KB Output is correct
57 Correct 8 ms 1368 KB Output is correct
58 Correct 6 ms 1116 KB Output is correct
59 Correct 6 ms 1116 KB Output is correct
60 Correct 6 ms 1116 KB Output is correct
61 Correct 7 ms 1200 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 37652 KB Output is correct
2 Correct 353 ms 39500 KB Output is correct
3 Correct 472 ms 38932 KB Output is correct
4 Correct 537 ms 39100 KB Output is correct
5 Correct 417 ms 38716 KB Output is correct
6 Correct 543 ms 39628 KB Output is correct
7 Correct 309 ms 38844 KB Output is correct
8 Correct 309 ms 39352 KB Output is correct
9 Correct 291 ms 38492 KB Output is correct
10 Correct 282 ms 39032 KB Output is correct
11 Correct 403 ms 38584 KB Output is correct
12 Correct 478 ms 38840 KB Output is correct
13 Correct 433 ms 38872 KB Output is correct
14 Correct 568 ms 39936 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 36536 KB Output is correct
2 Correct 439 ms 39824 KB Output is correct
3 Correct 566 ms 39080 KB Output is correct
4 Correct 578 ms 39684 KB Output is correct
5 Correct 476 ms 39004 KB Output is correct
6 Correct 588 ms 38980 KB Output is correct
7 Correct 334 ms 39912 KB Output is correct
8 Correct 279 ms 40436 KB Output is correct
9 Correct 305 ms 38332 KB Output is correct
10 Correct 416 ms 38712 KB Output is correct
11 Correct 529 ms 40016 KB Output is correct
12 Correct 481 ms 39868 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 440 KB Output is correct
8 Correct 0 ms 344 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 496 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 8 ms 1116 KB Output is correct
42 Correct 7 ms 1116 KB Output is correct
43 Correct 7 ms 1328 KB Output is correct
44 Correct 7 ms 1116 KB Output is correct
45 Correct 7 ms 1116 KB Output is correct
46 Correct 8 ms 1116 KB Output is correct
47 Correct 7 ms 1112 KB Output is correct
48 Correct 7 ms 1132 KB Output is correct
49 Correct 8 ms 1116 KB Output is correct
50 Correct 8 ms 1368 KB Output is correct
51 Correct 7 ms 1116 KB Output is correct
52 Correct 8 ms 1112 KB Output is correct
53 Correct 6 ms 1240 KB Output is correct
54 Correct 7 ms 1112 KB Output is correct
55 Correct 8 ms 1324 KB Output is correct
56 Correct 8 ms 1116 KB Output is correct
57 Correct 8 ms 1368 KB Output is correct
58 Correct 6 ms 1116 KB Output is correct
59 Correct 6 ms 1116 KB Output is correct
60 Correct 6 ms 1116 KB Output is correct
61 Correct 7 ms 1200 KB Output is correct
62 Correct 385 ms 37652 KB Output is correct
63 Correct 353 ms 39500 KB Output is correct
64 Correct 472 ms 38932 KB Output is correct
65 Correct 537 ms 39100 KB Output is correct
66 Correct 417 ms 38716 KB Output is correct
67 Correct 543 ms 39628 KB Output is correct
68 Correct 309 ms 38844 KB Output is correct
69 Correct 309 ms 39352 KB Output is correct
70 Correct 291 ms 38492 KB Output is correct
71 Correct 282 ms 39032 KB Output is correct
72 Correct 403 ms 38584 KB Output is correct
73 Correct 478 ms 38840 KB Output is correct
74 Correct 433 ms 38872 KB Output is correct
75 Correct 568 ms 39936 KB Output is correct
76 Correct 346 ms 36536 KB Output is correct
77 Correct 439 ms 39824 KB Output is correct
78 Correct 566 ms 39080 KB Output is correct
79 Correct 578 ms 39684 KB Output is correct
80 Correct 476 ms 39004 KB Output is correct
81 Correct 588 ms 38980 KB Output is correct
82 Correct 334 ms 39912 KB Output is correct
83 Correct 279 ms 40436 KB Output is correct
84 Correct 305 ms 38332 KB Output is correct
85 Correct 416 ms 38712 KB Output is correct
86 Correct 529 ms 40016 KB Output is correct
87 Correct 481 ms 39868 KB Output is correct
88 Correct 515 ms 38716 KB Output is correct
89 Correct 550 ms 40372 KB Output is correct
90 Correct 662 ms 39384 KB Output is correct
91 Correct 597 ms 39612 KB Output is correct
92 Correct 432 ms 39288 KB Output is correct
93 Correct 543 ms 40220 KB Output is correct
94 Correct 543 ms 39100 KB Output is correct
95 Correct 507 ms 38932 KB Output is correct
96 Correct 587 ms 38840 KB Output is correct
97 Correct 548 ms 38608 KB Output is correct
98 Correct 532 ms 40460 KB Output is correct
99 Correct 551 ms 38944 KB Output is correct
100 Correct 525 ms 39112 KB Output is correct
101 Correct 302 ms 38876 KB Output is correct
102 Correct 362 ms 38732 KB Output is correct
103 Correct 374 ms 39480 KB Output is correct
104 Correct 443 ms 38616 KB Output is correct
105 Correct 458 ms 39772 KB Output is correct
106 Correct 386 ms 38844 KB Output is correct
107 Correct 422 ms 39440 KB Output is correct
108 Correct 510 ms 39772 KB Output is correct
109 Correct 380 ms 40248 KB Output is correct
110 Correct 530 ms 38544 KB Output is correct
111 Correct 552 ms 39760 KB Output is correct
112 Correct 401 ms 38840 KB Output is correct
113 Correct 522 ms 39744 KB Output is correct
114 Correct 547 ms 39100 KB Output is correct
115 Correct 316 ms 40356 KB Output is correct
116 Correct 327 ms 39028 KB Output is correct
117 Correct 381 ms 38760 KB Output is correct
118 Correct 389 ms 38708 KB Output is correct
119 Correct 440 ms 38480 KB Output is correct
120 Correct 415 ms 39676 KB Output is correct