oj.uz

Submission #864222

# Submission time Handle Problem Language Result Execution time Memory
864222 2023-10-22T09:09:30 Z vjudge1 Financial Report (JOI21_financial) C++17
100 / 100
 492 ms 16976 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=3e5, K=(1<<19);

int n, d;
int a[MAXN];
set<pair<int, int> > segments, bad;
int tree[2*K-1]={0};

bool compare(int x, int y)
{
    if (a[x]==a[y])
        return x<y;

    return a[x]>a[y];
}

void updatesegments(int x)
{
    auto itr=segments.lower_bound({x, 1e9});
    auto itl=itr;
    bool left=false;
    if (itr!=segments.begin())
    {
        itl--;
        left=true;
    }
    if (left && itr!=segments.end() && x==(*itl).second+1 && x==(*itr).first-1)
    {
        pair<int, int> newsegment={(*itl).first, (*itr).second};
        auto oldleft=*itl;
        auto oldright=*itr;
        segments.erase(oldleft);
        segments.erase(oldright);
        segments.insert(newsegment);
        bad.erase(oldleft);
        bad.erase(oldright);
        if (newsegment.second-newsegment.first+1>=d)
            bad.insert(newsegment);
    }
    else if (left && x==(*itl).second+1 && x==(*itl).second+1)
    {
        pair<int, int> newsegment={(*itl).first, (*itl).second+1};
        auto oldleft=*itl;
        segments.erase(oldleft);
        segments.insert(newsegment);
        bad.erase(oldleft);
        if (newsegment.second-newsegment.first+1>=d)
            bad.insert(newsegment);
    }
    else if (itr!=segments.end() && x==(*itr).first-1)
    {
        pair<int, int> newsegment={(*itr).first-1, (*itr).second};
        auto oldright=*itr;
        segments.erase(oldright);
        segments.insert(newsegment);
        bad.erase(oldright);
        if (newsegment.second-newsegment.first+1>=d)
            bad.insert(newsegment);
    }
    else
    {
        segments.insert({x, x});
        if (d==1)
            bad.insert({x, x});
    }

    return;
}

int find(int x, int l, int r, int lt, int rt)
{
    if (l>=rt || r<=lt)
        return 0;
    if (l>=lt && r<=rt)
        return tree[x];

    return max(find(2*x+1, l, (l+r)/2, lt, rt), find(2*x+2, (l+r)/2, r, lt, rt));
}

void update(int x, int l, int r, int index, int value)
{
    if (l>index || r<=index)
        return;
    tree[x]=max(tree[x], value);
    if (r-l==1)
        return;
    update(2*x+1, l, (l+r)/2, index, value);
    update(2*x+2, (l+r)/2, r, index, value);

    return;
}

int main()
{
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);

    cin >> n >> d;
    int processorder[n], farthest[n];
    int maxscore=0;
    for (int i=0; i<n; i++)
        cin >> a[i];
    for (int i=0; i<n; i++)
        processorder[i]=i;
    sort(processorder, processorder+n, compare);
    farthest[processorder[0]]=n-1;
    for (int i=1; i<n; i++)
    {
        updatesegments(processorder[i-1]);
        int x=processorder[i];
        auto it=bad.lower_bound({x, -1});
        if (it==bad.end())
        {
            farthest[x]=n-1;
            continue;
        }
        if ((*it).first<=x && (*it).second>=x && x+d<=(*it).second)
        {
            farthest[x]=x+d;
            continue;
        }
        if ((*it).first<=x && (*it).second>=x)
            it++;
        if (it==bad.end())
            farthest[x]=n-1;
        else
            farthest[x]=(*it).first-1+d;
    }
    for (int i=0; i<n; i++)
    {
        int x=processorder[i];
        int score=find(0, 0, K, x, farthest[x]+1)+1;
        update(0, 0, K, x, score);
        maxscore=max(maxscore, score);
    }
    cout << maxscore;

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2492 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2484 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2492 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2484 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 11 ms 2872 KB Output is correct
42 Correct 9 ms 2736 KB Output is correct
43 Correct 9 ms 2596 KB Output is correct
44 Correct 7 ms 2648 KB Output is correct
45 Correct 8 ms 2652 KB Output is correct
46 Correct 7 ms 2652 KB Output is correct
47 Correct 7 ms 2680 KB Output is correct
48 Correct 8 ms 2652 KB Output is correct
49 Correct 10 ms 2648 KB Output is correct
50 Correct 10 ms 2652 KB Output is correct
51 Correct 10 ms 2508 KB Output is correct
52 Correct 8 ms 2608 KB Output is correct
53 Correct 5 ms 2652 KB Output is correct
54 Correct 6 ms 2508 KB Output is correct
55 Correct 8 ms 2648 KB Output is correct
56 Correct 7 ms 2652 KB Output is correct
57 Correct 7 ms 2652 KB Output is correct
58 Correct 5 ms 2904 KB Output is correct
59 Correct 7 ms 2652 KB Output is correct
60 Correct 6 ms 2608 KB Output is correct
61 Correct 6 ms 2652 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 7048 KB Output is correct
2 Correct 354 ms 14084 KB Output is correct
3 Correct 388 ms 16904 KB Output is correct
4 Correct 485 ms 16888 KB Output is correct
5 Correct 390 ms 15196 KB Output is correct
6 Correct 471 ms 16976 KB Output is correct
7 Correct 197 ms 10020 KB Output is correct
8 Correct 219 ms 10000 KB Output is correct
9 Correct 203 ms 10004 KB Output is correct
10 Correct 221 ms 10012 KB Output is correct
11 Correct 385 ms 10324 KB Output is correct
12 Correct 432 ms 11052 KB Output is correct
13 Correct 323 ms 9892 KB Output is correct
14 Correct 428 ms 10456 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 6992 KB Output is correct
2 Correct 331 ms 10712 KB Output is correct
3 Correct 389 ms 10852 KB Output is correct
4 Correct 381 ms 10576 KB Output is correct
5 Correct 339 ms 10064 KB Output is correct
6 Correct 382 ms 10320 KB Output is correct
7 Correct 209 ms 6992 KB Output is correct
8 Correct 204 ms 6996 KB Output is correct
9 Correct 269 ms 6976 KB Output is correct
10 Correct 322 ms 7144 KB Output is correct
11 Correct 339 ms 7420 KB Output is correct
12 Correct 297 ms 6992 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2492 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2484 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 11 ms 2872 KB Output is correct
42 Correct 9 ms 2736 KB Output is correct
43 Correct 9 ms 2596 KB Output is correct
44 Correct 7 ms 2648 KB Output is correct
45 Correct 8 ms 2652 KB Output is correct
46 Correct 7 ms 2652 KB Output is correct
47 Correct 7 ms 2680 KB Output is correct
48 Correct 8 ms 2652 KB Output is correct
49 Correct 10 ms 2648 KB Output is correct
50 Correct 10 ms 2652 KB Output is correct
51 Correct 10 ms 2508 KB Output is correct
52 Correct 8 ms 2608 KB Output is correct
53 Correct 5 ms 2652 KB Output is correct
54 Correct 6 ms 2508 KB Output is correct
55 Correct 8 ms 2648 KB Output is correct
56 Correct 7 ms 2652 KB Output is correct
57 Correct 7 ms 2652 KB Output is correct
58 Correct 5 ms 2904 KB Output is correct
59 Correct 7 ms 2652 KB Output is correct
60 Correct 6 ms 2608 KB Output is correct
61 Correct 6 ms 2652 KB Output is correct
62 Correct 223 ms 7048 KB Output is correct
63 Correct 354 ms 14084 KB Output is correct
64 Correct 388 ms 16904 KB Output is correct
65 Correct 485 ms 16888 KB Output is correct
66 Correct 390 ms 15196 KB Output is correct
67 Correct 471 ms 16976 KB Output is correct
68 Correct 197 ms 10020 KB Output is correct
69 Correct 219 ms 10000 KB Output is correct
70 Correct 203 ms 10004 KB Output is correct
71 Correct 221 ms 10012 KB Output is correct
72 Correct 385 ms 10324 KB Output is correct
73 Correct 432 ms 11052 KB Output is correct
74 Correct 323 ms 9892 KB Output is correct
75 Correct 428 ms 10456 KB Output is correct
76 Correct 219 ms 6992 KB Output is correct
77 Correct 331 ms 10712 KB Output is correct
78 Correct 389 ms 10852 KB Output is correct
79 Correct 381 ms 10576 KB Output is correct
80 Correct 339 ms 10064 KB Output is correct
81 Correct 382 ms 10320 KB Output is correct
82 Correct 209 ms 6992 KB Output is correct
83 Correct 204 ms 6996 KB Output is correct
84 Correct 269 ms 6976 KB Output is correct
85 Correct 322 ms 7144 KB Output is correct
86 Correct 339 ms 7420 KB Output is correct
87 Correct 297 ms 6992 KB Output is correct
88 Correct 492 ms 15172 KB Output is correct
89 Correct 486 ms 14676 KB Output is correct
90 Correct 462 ms 13628 KB Output is correct
91 Correct 386 ms 13620 KB Output is correct
92 Correct 330 ms 13392 KB Output is correct
93 Correct 401 ms 13396 KB Output is correct
94 Correct 389 ms 13612 KB Output is correct
95 Correct 472 ms 14712 KB Output is correct
96 Correct 413 ms 13392 KB Output is correct
97 Correct 413 ms 13488 KB Output is correct
98 Correct 413 ms 13504 KB Output is correct
99 Correct 397 ms 13584 KB Output is correct
100 Correct 397 ms 13512 KB Output is correct
101 Correct 214 ms 9996 KB Output is correct
102 Correct 237 ms 10024 KB Output is correct
103 Correct 298 ms 9876 KB Output is correct
104 Correct 339 ms 9932 KB Output is correct
105 Correct 353 ms 10496 KB Output is correct
106 Correct 300 ms 10120 KB Output is correct
107 Correct 351 ms 10220 KB Output is correct
108 Correct 381 ms 11604 KB Output is correct
109 Correct 299 ms 10128 KB Output is correct
110 Correct 375 ms 10444 KB Output is correct
111 Correct 382 ms 10320 KB Output is correct
112 Correct 291 ms 10076 KB Output is correct
113 Correct 363 ms 10328 KB Output is correct
114 Correct 398 ms 10364 KB Output is correct
115 Correct 212 ms 9892 KB Output is correct
116 Correct 214 ms 9880 KB Output is correct
117 Correct 255 ms 10068 KB Output is correct
118 Correct 254 ms 9992 KB Output is correct
119 Correct 310 ms 10144 KB Output is correct
120 Correct 304 ms 10108 KB Output is correct