oj.uz

Submission #420286

# Submission time Handle Problem Language Result Execution time Memory
420286 2021-06-08T08:56:45 Z Sho10 Financial Report (JOI21_financial) C++17
100 / 100
 743 ms 48536 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,d,a[300005],tree[3][1200005],lazy[12000005];
map<ll,ll>m;
void build(ll node,ll l,ll r){
if(l==r){
    tree[1][node]=a[l];
    return;
}
ll mid=(l+r)/2;
build(2*node,l,mid);
build(2*node+1,mid+1,r);
tree[1][node]=min(tree[1][2*node],tree[1][2*node+1]);
}
ll query1(ll node,ll l,ll r,ll st,ll dr){
if(l>dr){
    return LINF;
}
if(r<st){
    return LINF;
}
if(st<=l&&r<=dr){
    return tree[1][node];
}
ll mid=(l+r)/2;
return min(query1(2*node,l,mid,st,dr),query1(2*node+1,mid+1,r,st,dr));
}
void push(ll node,ll l,ll r){
if(lazy[node]==1){
    tree[2][node]=0;
    if(l!=r){
        lazy[2*node]=1;
        lazy[2*node+1]=1;
    }
    lazy[node]=0;
}
}
void update2(ll node,ll l,ll r,ll st,ll dr){
push(node,l,r);
if(l>dr){
    return;
}
if(r<st){
    return;
}
if(st<=l&&r<=dr){
    lazy[node]=1;
    push(node,l,r);
    return;
}
ll mid=(l+r)/2;
update2(2*node,l,mid,st,dr);
update2(2*node+1,mid+1,r,st,dr);
tree[2][node]=max(tree[2][node*2],tree[2][node*2+1]);
}
ll query2(ll node,ll l,ll r,ll st,ll dr){
push(node,l,r);
if(l>dr){
    return 0;
}
if(r<st){
    return 0;
}
if(st<=l&&r<=dr){
    return tree[2][node];
}
ll mid=(l+r)/2;
return max(query2(2*node,l,mid,st,dr),query2(2*node+1,mid+1,r,st,dr));
}
void update3(ll node,ll l,ll r,ll pos,ll val){
push(node,l,r);
if(l==r){
    tree[2][node]=max(tree[2][node],val);
    return;
}
ll mid=(l+r)/2;
tree[2][node]=max(tree[2][node],val);
if(pos<=mid){
    update3(2*node,l,mid,pos,val);
}else {
update3(2*node+1,mid+1,r,pos,val);
}
}
int32_t main(){
CODE_START;
cin>>n>>d;
vector<ll>v;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
    v.pb(a[i]);
}
sort(v.begin(),v.end());
ll s1=0;
for(ll i=0;i<v.size();i++)
{
    if(i==0||v[i]!=v[i-1]){
        m[v[i]]=++s1;
    }
}
for(ll i=1;i<=n;i++)
{
    a[i]=m[a[i]];
}
build(1,1,n);
for(ll i=1;i<=n;i++)
{
    if(i>=2){
        ll nr=query1(1,1,n,max(1ll,i-d),i-1);
        if(nr>=2){
            update2(1,1,n,1,nr-1);
        }
}
ll val=1;
if(a[i]>=2){
    val+=query2(1,1,n,1,a[i]-1);
}
update3(1,1,n,a[i],val);
}
cout<<tree[2][1]<<endl;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:112:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 | for(ll i=0;i<v.size();i++)
      |            ~^~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 7 ms 716 KB Output is correct
42 Correct 8 ms 1228 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 6 ms 900 KB Output is correct
45 Correct 6 ms 844 KB Output is correct
46 Correct 7 ms 1228 KB Output is correct
47 Correct 7 ms 1228 KB Output is correct
48 Correct 8 ms 1244 KB Output is correct
49 Correct 8 ms 1216 KB Output is correct
50 Correct 8 ms 1228 KB Output is correct
51 Correct 7 ms 1228 KB Output is correct
52 Correct 8 ms 1276 KB Output is correct
53 Correct 7 ms 1228 KB Output is correct
54 Correct 7 ms 1248 KB Output is correct
55 Correct 8 ms 1216 KB Output is correct
56 Correct 9 ms 1172 KB Output is correct
57 Correct 8 ms 1184 KB Output is correct
58 Correct 6 ms 1100 KB Output is correct
59 Correct 5 ms 1100 KB Output is correct
60 Correct 8 ms 1148 KB Output is correct
61 Correct 8 ms 1100 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 13336 KB Output is correct
2 Correct 216 ms 13452 KB Output is correct
3 Correct 257 ms 13384 KB Output is correct
4 Correct 681 ms 43368 KB Output is correct
5 Correct 561 ms 48376 KB Output is correct
6 Correct 743 ms 48372 KB Output is correct
7 Correct 365 ms 48280 KB Output is correct
8 Correct 360 ms 48228 KB Output is correct
9 Correct 367 ms 48344 KB Output is correct
10 Correct 374 ms 48404 KB Output is correct
11 Correct 472 ms 48372 KB Output is correct
12 Correct 518 ms 48524 KB Output is correct
13 Correct 625 ms 48372 KB Output is correct
14 Correct 700 ms 48436 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 13388 KB Output is correct
2 Correct 184 ms 13408 KB Output is correct
3 Correct 235 ms 13576 KB Output is correct
4 Correct 694 ms 44288 KB Output is correct
5 Correct 582 ms 47348 KB Output is correct
6 Correct 626 ms 42152 KB Output is correct
7 Correct 289 ms 40208 KB Output is correct
8 Correct 361 ms 48348 KB Output is correct
9 Correct 300 ms 40132 KB Output is correct
10 Correct 374 ms 40408 KB Output is correct
11 Correct 631 ms 40304 KB Output is correct
12 Correct 553 ms 48376 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 7 ms 716 KB Output is correct
42 Correct 8 ms 1228 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 6 ms 900 KB Output is correct
45 Correct 6 ms 844 KB Output is correct
46 Correct 7 ms 1228 KB Output is correct
47 Correct 7 ms 1228 KB Output is correct
48 Correct 8 ms 1244 KB Output is correct
49 Correct 8 ms 1216 KB Output is correct
50 Correct 8 ms 1228 KB Output is correct
51 Correct 7 ms 1228 KB Output is correct
52 Correct 8 ms 1276 KB Output is correct
53 Correct 7 ms 1228 KB Output is correct
54 Correct 7 ms 1248 KB Output is correct
55 Correct 8 ms 1216 KB Output is correct
56 Correct 9 ms 1172 KB Output is correct
57 Correct 8 ms 1184 KB Output is correct
58 Correct 6 ms 1100 KB Output is correct
59 Correct 5 ms 1100 KB Output is correct
60 Correct 8 ms 1148 KB Output is correct
61 Correct 8 ms 1100 KB Output is correct
62 Correct 106 ms 13336 KB Output is correct
63 Correct 216 ms 13452 KB Output is correct
64 Correct 257 ms 13384 KB Output is correct
65 Correct 681 ms 43368 KB Output is correct
66 Correct 561 ms 48376 KB Output is correct
67 Correct 743 ms 48372 KB Output is correct
68 Correct 365 ms 48280 KB Output is correct
69 Correct 360 ms 48228 KB Output is correct
70 Correct 367 ms 48344 KB Output is correct
71 Correct 374 ms 48404 KB Output is correct
72 Correct 472 ms 48372 KB Output is correct
73 Correct 518 ms 48524 KB Output is correct
74 Correct 625 ms 48372 KB Output is correct
75 Correct 700 ms 48436 KB Output is correct
76 Correct 111 ms 13388 KB Output is correct
77 Correct 184 ms 13408 KB Output is correct
78 Correct 235 ms 13576 KB Output is correct
79 Correct 694 ms 44288 KB Output is correct
80 Correct 582 ms 47348 KB Output is correct
81 Correct 626 ms 42152 KB Output is correct
82 Correct 289 ms 40208 KB Output is correct
83 Correct 361 ms 48348 KB Output is correct
84 Correct 300 ms 40132 KB Output is correct
85 Correct 374 ms 40408 KB Output is correct
86 Correct 631 ms 40304 KB Output is correct
87 Correct 553 ms 48376 KB Output is correct
88 Correct 294 ms 13596 KB Output is correct
89 Correct 725 ms 47036 KB Output is correct
90 Correct 390 ms 18456 KB Output is correct
91 Correct 695 ms 47428 KB Output is correct
92 Correct 205 ms 13320 KB Output is correct
93 Correct 270 ms 13848 KB Output is correct
94 Correct 543 ms 34204 KB Output is correct
95 Correct 621 ms 48372 KB Output is correct
96 Correct 645 ms 48176 KB Output is correct
97 Correct 712 ms 48280 KB Output is correct
98 Correct 693 ms 45564 KB Output is correct
99 Correct 720 ms 47700 KB Output is correct
100 Correct 696 ms 40824 KB Output is correct
101 Correct 370 ms 48444 KB Output is correct
102 Correct 388 ms 48536 KB Output is correct
103 Correct 407 ms 47292 KB Output is correct
104 Correct 433 ms 43612 KB Output is correct
105 Correct 499 ms 41336 KB Output is correct
106 Correct 443 ms 48472 KB Output is correct
107 Correct 495 ms 47972 KB Output is correct
108 Correct 655 ms 48108 KB Output is correct
109 Correct 551 ms 48360 KB Output is correct
110 Correct 682 ms 43128 KB Output is correct
111 Correct 682 ms 47956 KB Output is correct
112 Correct 536 ms 41696 KB Output is correct
113 Correct 665 ms 40240 KB Output is correct
114 Correct 716 ms 48300 KB Output is correct
115 Correct 281 ms 40240 KB Output is correct
116 Correct 277 ms 40116 KB Output is correct
117 Correct 371 ms 40252 KB Output is correct
118 Correct 368 ms 40268 KB Output is correct
119 Correct 542 ms 40312 KB Output is correct
120 Correct 550 ms 40272 KB Output is correct