oj.uz

Submission #570944

# Submission time Handle Problem Language Result Execution time Memory
570944 2022-05-31T16:02:35 Z dantoh000 Financial Report (JOI21_financial) C++14
100 / 100
 779 ms 52612 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
int n,d;
int a[300005];
int p[300005];
int l[300005];
int r[300005];
int ans[300005];
int ANS;
void init(int n){
    for (int i = 0; i < n; i++){
        p[i] = l[i] = r[i] = i;
    }
}
int find(int x){
    return p[x] == x ? x : p[x] = find(p[x]);
}
void un(int x, int y){
    x = find(x), y = find(y);
    if (x == y) return;
    p[y] = x;
    l[x] = min(l[x], l[y]);
    r[x] = max(r[x], r[y]);
}
struct node{
    int s,e,m,v;
    node *l, *r;
    node (int _s, int _e){
        s = _s, e = _e;
        m = (s+e)/2;
        if (s != e){
            l = new node(s,m);
            r = new node(m+1,e);
        }
    }
    void up(int x, int nv){
        if (s == e){ v = nv; return;}
        if (x > m) r->up(x,nv);
        else l->up(x,nv);
        v = max(l->v,r->v);
    }
    int qu(int qs, int qe){
        ///printf("%d %d %d %d\n",s,e,qs,qe);
        if (qs ==s && qe ==e ) return v;
        if (qs > m) return r->qu(qs,qe);
        else if (qe <= m) return l->qu(qs,qe);
        else return max(l->qu(qs,m), r->qu(m+1,qe));
    }
} *root;
vector<ii> v;

bool cmp(ii a, ii b){
    if (a.fi != b.fi) return a.fi < b.fi;
    else return a.se > b.se;
}
int main(){
    scanf("%d%d",&n,&d);
    v.resize(n);
    for (int i = 0; i < n; i++) {
        scanf("%d",&v[i].fi);
        v[i].se = i;
    }
    sort(v.begin(),v.end(),cmp);
    set<int> s;
    init(n);
    root = new node(0,n-1);
    for (int i = 0; i < n; i++){
        int ID = v[i].se;
        auto it = s.lower_bound(ID);
        if (it != s.end() && *it-ID <= d){
            un(*it, ID);
        }
        if (it != s.begin() && ID-*prev(it) <= d){
            un(*prev(it), ID);
        }
        s.insert(ID);
        int L = l[find(ID)];
        //printf("%d %d\n",ID,L);
        ans[ID] = root->qu(max(0,L-d), ID) + 1;
        //printf("ans %d\n",ans[ID]);
        root->up(ID, ans[ID]);
        ANS = max(ANS,ans[ID]);
    }
    printf("%d\n",ANS);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     scanf("%d%d",&n,&d);
      |     ~~~~~^~~~~~~~~~~~~~
Main.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         scanf("%d",&v[i].fi);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 9 ms 1492 KB Output is correct
42 Correct 7 ms 1492 KB Output is correct
43 Correct 6 ms 1436 KB Output is correct
44 Correct 6 ms 1364 KB Output is correct
45 Correct 6 ms 1364 KB Output is correct
46 Correct 9 ms 1432 KB Output is correct
47 Correct 6 ms 1452 KB Output is correct
48 Correct 7 ms 1492 KB Output is correct
49 Correct 7 ms 1452 KB Output is correct
50 Correct 6 ms 1512 KB Output is correct
51 Correct 6 ms 1492 KB Output is correct
52 Correct 6 ms 1468 KB Output is correct
53 Correct 5 ms 1492 KB Output is correct
54 Correct 6 ms 1492 KB Output is correct
55 Correct 7 ms 1492 KB Output is correct
56 Correct 7 ms 1504 KB Output is correct
57 Correct 7 ms 1492 KB Output is correct
58 Correct 5 ms 1452 KB Output is correct
59 Correct 5 ms 1468 KB Output is correct
60 Correct 6 ms 1492 KB Output is correct
61 Correct 6 ms 1492 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 49504 KB Output is correct
2 Correct 353 ms 52040 KB Output is correct
3 Correct 538 ms 52476 KB Output is correct
4 Correct 724 ms 52416 KB Output is correct
5 Correct 487 ms 52484 KB Output is correct
6 Correct 740 ms 52544 KB Output is correct
7 Correct 257 ms 52108 KB Output is correct
8 Correct 253 ms 52296 KB Output is correct
9 Correct 212 ms 52424 KB Output is correct
10 Correct 241 ms 52580 KB Output is correct
11 Correct 353 ms 52412 KB Output is correct
12 Correct 418 ms 52388 KB Output is correct
13 Correct 490 ms 52452 KB Output is correct
14 Correct 717 ms 52520 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 49592 KB Output is correct
2 Correct 507 ms 49572 KB Output is correct
3 Correct 645 ms 49508 KB Output is correct
4 Correct 629 ms 49600 KB Output is correct
5 Correct 536 ms 49552 KB Output is correct
6 Correct 736 ms 49596 KB Output is correct
7 Correct 294 ms 49532 KB Output is correct
8 Correct 239 ms 49496 KB Output is correct
9 Correct 230 ms 49196 KB Output is correct
10 Correct 363 ms 49364 KB Output is correct
11 Correct 749 ms 49524 KB Output is correct
12 Correct 475 ms 49516 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 9 ms 1492 KB Output is correct
42 Correct 7 ms 1492 KB Output is correct
43 Correct 6 ms 1436 KB Output is correct
44 Correct 6 ms 1364 KB Output is correct
45 Correct 6 ms 1364 KB Output is correct
46 Correct 9 ms 1432 KB Output is correct
47 Correct 6 ms 1452 KB Output is correct
48 Correct 7 ms 1492 KB Output is correct
49 Correct 7 ms 1452 KB Output is correct
50 Correct 6 ms 1512 KB Output is correct
51 Correct 6 ms 1492 KB Output is correct
52 Correct 6 ms 1468 KB Output is correct
53 Correct 5 ms 1492 KB Output is correct
54 Correct 6 ms 1492 KB Output is correct
55 Correct 7 ms 1492 KB Output is correct
56 Correct 7 ms 1504 KB Output is correct
57 Correct 7 ms 1492 KB Output is correct
58 Correct 5 ms 1452 KB Output is correct
59 Correct 5 ms 1468 KB Output is correct
60 Correct 6 ms 1492 KB Output is correct
61 Correct 6 ms 1492 KB Output is correct
62 Correct 257 ms 49504 KB Output is correct
63 Correct 353 ms 52040 KB Output is correct
64 Correct 538 ms 52476 KB Output is correct
65 Correct 724 ms 52416 KB Output is correct
66 Correct 487 ms 52484 KB Output is correct
67 Correct 740 ms 52544 KB Output is correct
68 Correct 257 ms 52108 KB Output is correct
69 Correct 253 ms 52296 KB Output is correct
70 Correct 212 ms 52424 KB Output is correct
71 Correct 241 ms 52580 KB Output is correct
72 Correct 353 ms 52412 KB Output is correct
73 Correct 418 ms 52388 KB Output is correct
74 Correct 490 ms 52452 KB Output is correct
75 Correct 717 ms 52520 KB Output is correct
76 Correct 258 ms 49592 KB Output is correct
77 Correct 507 ms 49572 KB Output is correct
78 Correct 645 ms 49508 KB Output is correct
79 Correct 629 ms 49600 KB Output is correct
80 Correct 536 ms 49552 KB Output is correct
81 Correct 736 ms 49596 KB Output is correct
82 Correct 294 ms 49532 KB Output is correct
83 Correct 239 ms 49496 KB Output is correct
84 Correct 230 ms 49196 KB Output is correct
85 Correct 363 ms 49364 KB Output is correct
86 Correct 749 ms 49524 KB Output is correct
87 Correct 475 ms 49516 KB Output is correct
88 Correct 739 ms 52548 KB Output is correct
89 Correct 720 ms 52548 KB Output is correct
90 Correct 772 ms 52612 KB Output is correct
91 Correct 694 ms 52584 KB Output is correct
92 Correct 418 ms 52568 KB Output is correct
93 Correct 695 ms 52480 KB Output is correct
94 Correct 662 ms 52392 KB Output is correct
95 Correct 658 ms 52508 KB Output is correct
96 Correct 665 ms 52500 KB Output is correct
97 Correct 748 ms 52468 KB Output is correct
98 Correct 753 ms 52512 KB Output is correct
99 Correct 719 ms 52452 KB Output is correct
100 Correct 727 ms 52532 KB Output is correct
101 Correct 217 ms 52404 KB Output is correct
102 Correct 235 ms 52420 KB Output is correct
103 Correct 255 ms 52556 KB Output is correct
104 Correct 367 ms 52416 KB Output is correct
105 Correct 460 ms 52516 KB Output is correct
106 Correct 319 ms 52520 KB Output is correct
107 Correct 379 ms 52460 KB Output is correct
108 Correct 608 ms 52436 KB Output is correct
109 Correct 377 ms 52384 KB Output is correct
110 Correct 664 ms 52512 KB Output is correct
111 Correct 662 ms 52392 KB Output is correct
112 Correct 343 ms 52560 KB Output is correct
113 Correct 779 ms 52496 KB Output is correct
114 Correct 702 ms 52508 KB Output is correct
115 Correct 265 ms 52472 KB Output is correct
116 Correct 252 ms 52488 KB Output is correct
117 Correct 363 ms 52428 KB Output is correct
118 Correct 331 ms 52412 KB Output is correct
119 Correct 365 ms 52392 KB Output is correct
120 Correct 308 ms 52392 KB Output is correct