oj.uz

Submission #928881

# Submission time Handle Problem Language Result Execution time Memory
928881 2024-02-17T07:29:56 Z yellowtoad Financial Report (JOI21_financial) C++17
100 / 100
 489 ms 31940 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define f first
#define s second
using namespace std;

int n, m, dp[300010];
pair<int,int> node[1200010];
vector<pair<int,int>> v;
set<int> bst;
set<int>::iterator iter;
bool done;

void update(int id, int x, int y, int pos, pair<int,int> val) {
    if (x == y) {
        node[id] = val;
        return;
    }
    int mid = (x+y)/2;
    if (pos <= mid) update(id*2,x,mid,pos,val);
    else update(id*2+1,mid+1,y,pos,val);
    node[id] = {max(node[id*2].f,node[id*2+1].f),max(node[id*2].s,node[id*2+1].s)};
}

int findll(int id, int x, int y, int r) {
    if (r < x) return r+1;
    if (node[id].s <= m) return x-1;
    if (x == y) {
        done = 1;
        return x;
    }
    int mid = (x+y)/2, tmp = findll(id*2+1,mid+1,y,r);
    if (!done) return min(tmp,findll(id*2,x,mid,r));
    else return tmp;
}

int findl(int r) {
    done = 0;
    return findll(1,1,n+1,r);
}

int find(int id, int x, int y, int l, int r) {
    if ((l <= x) && (y <= r)) return node[id].f;
    if ((y < l) || (r < x)) return 0;
    int mid = (x+y)/2;
    return max(find(id*2,x,mid,l,r),find(id*2+1,mid+1,y,l,r));
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        v.push_back({x,-i});
    }
    sort(v.begin(),v.end());
    for (int i = 0; i < n; i++) v[i].s = -v[i].s;
    update(1,1,n+1,n+1,{0,n+1});
    bst.insert(n+1);
    bst.insert(0);
    for (int i = 0; i < n; i++) {
        iter = bst.upper_bound(v[i].s);
        if (v[i].s-(*prev(iter)) <= m) dp[v[i].s] = find(1,1,n+1,max(1,findl(v[i].s)-m),v[i].s)+1;
        else dp[v[i].s] = find(1,1,n+1,max(1,v[i].s-m),v[i].s)+1;
        update(1,1,n+1,*iter,{dp[*iter],(*iter)-v[i].s});
        update(1,1,n+1,v[i].s,{dp[v[i].s],v[i].s-(*prev(iter))});
        //cout << *iter << " " << *prev(iter) << endl;
        bst.insert(v[i].s);
    }
    cout << node[1].f << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2492 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 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 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 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 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 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 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2492 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 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 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 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 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 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 2396 KB Output is correct
28 Correct 1 ms 2396 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 2392 KB Output is correct
33 Correct 1 ms 2648 KB Output is correct
34 Correct 1 ms 2396 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 2392 KB Output is correct
38 Correct 2 ms 2396 KB Output is correct
39 Correct 1 ms 2400 KB Output is correct
40 Correct 2 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2492 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 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 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 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 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 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 2396 KB Output is correct
28 Correct 1 ms 2396 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 2392 KB Output is correct
33 Correct 1 ms 2648 KB Output is correct
34 Correct 1 ms 2396 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 2392 KB Output is correct
38 Correct 2 ms 2396 KB Output is correct
39 Correct 1 ms 2400 KB Output is correct
40 Correct 2 ms 2396 KB Output is correct
41 Correct 9 ms 2904 KB Output is correct
42 Correct 8 ms 3036 KB Output is correct
43 Correct 8 ms 2908 KB Output is correct
44 Correct 7 ms 2908 KB Output is correct
45 Correct 7 ms 2908 KB Output is correct
46 Correct 7 ms 2916 KB Output is correct
47 Correct 7 ms 2904 KB Output is correct
48 Correct 8 ms 2908 KB Output is correct
49 Correct 7 ms 2908 KB Output is correct
50 Correct 7 ms 2908 KB Output is correct
51 Correct 7 ms 2904 KB Output is correct
52 Correct 8 ms 2908 KB Output is correct
53 Correct 6 ms 2908 KB Output is correct
54 Correct 7 ms 2908 KB Output is correct
55 Correct 7 ms 2912 KB Output is correct
56 Correct 7 ms 2908 KB Output is correct
57 Correct 8 ms 2908 KB Output is correct
58 Correct 9 ms 2908 KB Output is correct
59 Correct 6 ms 2980 KB Output is correct
60 Correct 6 ms 2908 KB Output is correct
61 Correct 6 ms 2908 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 27832 KB Output is correct
2 Correct 333 ms 30708 KB Output is correct
3 Correct 398 ms 31184 KB Output is correct
4 Correct 469 ms 30180 KB Output is correct
5 Correct 382 ms 31672 KB Output is correct
6 Correct 465 ms 30716 KB Output is correct
7 Correct 276 ms 31356 KB Output is correct
8 Correct 285 ms 30256 KB Output is correct
9 Correct 279 ms 31752 KB Output is correct
10 Correct 290 ms 30648 KB Output is correct
11 Correct 375 ms 30128 KB Output is correct
12 Correct 407 ms 30148 KB Output is correct
13 Correct 466 ms 30276 KB Output is correct
14 Correct 420 ms 31256 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 28356 KB Output is correct
2 Correct 346 ms 31864 KB Output is correct
3 Correct 470 ms 31476 KB Output is correct
4 Correct 446 ms 29944 KB Output is correct
5 Correct 391 ms 31668 KB Output is correct
6 Correct 406 ms 30952 KB Output is correct
7 Correct 314 ms 30620 KB Output is correct
8 Correct 276 ms 31680 KB Output is correct
9 Correct 275 ms 31668 KB Output is correct
10 Correct 339 ms 31332 KB Output is correct
11 Correct 404 ms 30136 KB Output is correct
12 Correct 377 ms 30412 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2492 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 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 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 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 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 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 2396 KB Output is correct
28 Correct 1 ms 2396 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 2392 KB Output is correct
33 Correct 1 ms 2648 KB Output is correct
34 Correct 1 ms 2396 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 2392 KB Output is correct
38 Correct 2 ms 2396 KB Output is correct
39 Correct 1 ms 2400 KB Output is correct
40 Correct 2 ms 2396 KB Output is correct
41 Correct 9 ms 2904 KB Output is correct
42 Correct 8 ms 3036 KB Output is correct
43 Correct 8 ms 2908 KB Output is correct
44 Correct 7 ms 2908 KB Output is correct
45 Correct 7 ms 2908 KB Output is correct
46 Correct 7 ms 2916 KB Output is correct
47 Correct 7 ms 2904 KB Output is correct
48 Correct 8 ms 2908 KB Output is correct
49 Correct 7 ms 2908 KB Output is correct
50 Correct 7 ms 2908 KB Output is correct
51 Correct 7 ms 2904 KB Output is correct
52 Correct 8 ms 2908 KB Output is correct
53 Correct 6 ms 2908 KB Output is correct
54 Correct 7 ms 2908 KB Output is correct
55 Correct 7 ms 2912 KB Output is correct
56 Correct 7 ms 2908 KB Output is correct
57 Correct 8 ms 2908 KB Output is correct
58 Correct 9 ms 2908 KB Output is correct
59 Correct 6 ms 2980 KB Output is correct
60 Correct 6 ms 2908 KB Output is correct
61 Correct 6 ms 2908 KB Output is correct
62 Correct 287 ms 27832 KB Output is correct
63 Correct 333 ms 30708 KB Output is correct
64 Correct 398 ms 31184 KB Output is correct
65 Correct 469 ms 30180 KB Output is correct
66 Correct 382 ms 31672 KB Output is correct
67 Correct 465 ms 30716 KB Output is correct
68 Correct 276 ms 31356 KB Output is correct
69 Correct 285 ms 30256 KB Output is correct
70 Correct 279 ms 31752 KB Output is correct
71 Correct 290 ms 30648 KB Output is correct
72 Correct 375 ms 30128 KB Output is correct
73 Correct 407 ms 30148 KB Output is correct
74 Correct 466 ms 30276 KB Output is correct
75 Correct 420 ms 31256 KB Output is correct
76 Correct 292 ms 28356 KB Output is correct
77 Correct 346 ms 31864 KB Output is correct
78 Correct 470 ms 31476 KB Output is correct
79 Correct 446 ms 29944 KB Output is correct
80 Correct 391 ms 31668 KB Output is correct
81 Correct 406 ms 30952 KB Output is correct
82 Correct 314 ms 30620 KB Output is correct
83 Correct 276 ms 31680 KB Output is correct
84 Correct 275 ms 31668 KB Output is correct
85 Correct 339 ms 31332 KB Output is correct
86 Correct 404 ms 30136 KB Output is correct
87 Correct 377 ms 30412 KB Output is correct
88 Correct 451 ms 31744 KB Output is correct
89 Correct 488 ms 31940 KB Output is correct
90 Correct 489 ms 30136 KB Output is correct
91 Correct 426 ms 30900 KB Output is correct
92 Correct 349 ms 30324 KB Output is correct
93 Correct 417 ms 30164 KB Output is correct
94 Correct 421 ms 30244 KB Output is correct
95 Correct 426 ms 31136 KB Output is correct
96 Correct 461 ms 30452 KB Output is correct
97 Correct 460 ms 31340 KB Output is correct
98 Correct 424 ms 30392 KB Output is correct
99 Correct 441 ms 30552 KB Output is correct
100 Correct 411 ms 30336 KB Output is correct
101 Correct 287 ms 31472 KB Output is correct
102 Correct 288 ms 31416 KB Output is correct
103 Correct 309 ms 31420 KB Output is correct
104 Correct 323 ms 30088 KB Output is correct
105 Correct 381 ms 31916 KB Output is correct
106 Correct 369 ms 31416 KB Output is correct
107 Correct 409 ms 31744 KB Output is correct
108 Correct 418 ms 30648 KB Output is correct
109 Correct 377 ms 30824 KB Output is correct
110 Correct 435 ms 30388 KB Output is correct
111 Correct 420 ms 31008 KB Output is correct
112 Correct 326 ms 30388 KB Output is correct
113 Correct 396 ms 30924 KB Output is correct
114 Correct 409 ms 31708 KB Output is correct
115 Correct 279 ms 31556 KB Output is correct
116 Correct 278 ms 30176 KB Output is correct
117 Correct 338 ms 30812 KB Output is correct
118 Correct 325 ms 31444 KB Output is correct
119 Correct 333 ms 31468 KB Output is correct
120 Correct 328 ms 31412 KB Output is correct