oj.uz

Submission #846916

# Submission time Handle Problem Language Result Execution time Memory
846916 2023-09-08T16:19:48 Z Abito Financial Report (JOI21_financial) C++17
65 / 100
 4000 ms 21584 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=3e5+5;
int a[N],n,d,bit[N],seg[4*N+5],b[N],dp[N];
void upd(int x){
    while (x<=n){
        bit[x]++;
        x+=x&-x;
    }return;
}int calc(int x){
    int y=0;
    while (x){
        y+=bit[x];
        x-=x&-x;
    }return y;
}
int edit(int node,int l,int r,int idx,int val){
    if (l==r) return seg[node]=val;
    int mid=(l+r)/2;
    if (idx<=mid) return seg[node]=max(edit(node*2,l,mid,idx,val),seg[node*2+1]);
    return seg[node]=max(edit(node*2+1,mid+1,r,idx,val),seg[node*2]);
}
int query(int node,int l,int r,int lx,int rx){
    if (r<lx || l>rx) return 0;
    if (l>=lx && r<=rx) return seg[node];
    int mid=(l+r)/2;
    return max(query(node*2,l,mid,lx,rx),query(node*2+1,mid+1,r,lx,rx));
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>d;
    for (int i=1;i<=n;i++) cin>>a[i];
    a[0]=INT_MIN;
    if (d==1){
        stack<int> s;
        for (int i=1;i<=n;i++){
            while (!s.empty()){
                if (a[s.top()]<a[i]) s.pop();
                else{
                    b[i]=s.top();
                    break;
                }
            }s.push(i);
        }
        int ans=0;
        for (int i=n;i;i--){
            upd(b[i]+1);
            ans=max(ans,calc(i));
        }cout<<ans<<endl;
        return 0;
    }
    if (d==n){
        map<int,int> mp;mp[INT_MIN]++;
        for (int i=1;i<=n;i++) mp[a[i]]++;
        int c=0;
        for (auto u:mp) mp[u.F]=c++;
        for (int i=1;i<=n;i++){
            a[i]=mp[a[i]];
            edit(1,1,n,a[i],query(1,1,n,0,a[i]-1)+1);
        }cout<<query(1,1,n,0,4*N+4)<<endl;
        return 0;
    }int ans=0;
    for (int i=1;i<=n;i++){
        dp[i]=1;
        int x=i;
        for (int j=i-1;j;j--){
            if (x-j>d) break;
            if (a[j]>=a[i]) continue;
            dp[i]=max(dp[i],dp[j]+1);
            x=j;
        }ans=max(ans,dp[i]);
    }cout<<ans<<endl;
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 0 ms 2392 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2392 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 2392 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 0 ms 2392 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2392 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 2392 KB Output is correct
41 Correct 2 ms 4440 KB Output is correct
42 Correct 3 ms 2392 KB Output is correct
43 Correct 6 ms 2392 KB Output is correct
44 Correct 42 ms 2392 KB Output is correct
45 Correct 67 ms 2580 KB Output is correct
46 Correct 5 ms 2904 KB Output is correct
47 Correct 29 ms 2392 KB Output is correct
48 Correct 28 ms 2612 KB Output is correct
49 Correct 29 ms 2584 KB Output is correct
50 Correct 48 ms 2392 KB Output is correct
51 Correct 2 ms 4440 KB Output is correct
52 Correct 3 ms 2392 KB Output is correct
53 Correct 29 ms 2584 KB Output is correct
54 Correct 26 ms 2584 KB Output is correct
55 Correct 60 ms 2392 KB Output is correct
56 Correct 32 ms 2392 KB Output is correct
57 Correct 39 ms 2592 KB Output is correct
58 Correct 16 ms 2600 KB Output is correct
59 Correct 17 ms 2528 KB Output is correct
60 Correct 21 ms 2392 KB Output is correct
61 Correct 20 ms 2392 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 8712 KB Output is correct
2 Correct 32 ms 7760 KB Output is correct
3 Correct 35 ms 7512 KB Output is correct
4 Correct 37 ms 8164 KB Output is correct
5 Correct 32 ms 7508 KB Output is correct
6 Correct 33 ms 7512 KB Output is correct
7 Correct 46 ms 3416 KB Output is correct
8 Correct 29 ms 8784 KB Output is correct
9 Correct 42 ms 7852 KB Output is correct
10 Correct 31 ms 8020 KB Output is correct
11 Correct 34 ms 7512 KB Output is correct
12 Correct 34 ms 7764 KB Output is correct
13 Correct 31 ms 7516 KB Output is correct
14 Correct 29 ms 7512 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7504 KB Output is correct
2 Correct 85 ms 5712 KB Output is correct
3 Correct 131 ms 5788 KB Output is correct
4 Correct 396 ms 21576 KB Output is correct
5 Correct 305 ms 21504 KB Output is correct
6 Correct 415 ms 21552 KB Output is correct
7 Correct 178 ms 21584 KB Output is correct
8 Correct 185 ms 21328 KB Output is correct
9 Correct 158 ms 21584 KB Output is correct
10 Correct 243 ms 21432 KB Output is correct
11 Correct 424 ms 21580 KB Output is correct
12 Correct 364 ms 21584 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 0 ms 2392 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2392 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 2392 KB Output is correct
41 Correct 2 ms 4440 KB Output is correct
42 Correct 3 ms 2392 KB Output is correct
43 Correct 6 ms 2392 KB Output is correct
44 Correct 42 ms 2392 KB Output is correct
45 Correct 67 ms 2580 KB Output is correct
46 Correct 5 ms 2904 KB Output is correct
47 Correct 29 ms 2392 KB Output is correct
48 Correct 28 ms 2612 KB Output is correct
49 Correct 29 ms 2584 KB Output is correct
50 Correct 48 ms 2392 KB Output is correct
51 Correct 2 ms 4440 KB Output is correct
52 Correct 3 ms 2392 KB Output is correct
53 Correct 29 ms 2584 KB Output is correct
54 Correct 26 ms 2584 KB Output is correct
55 Correct 60 ms 2392 KB Output is correct
56 Correct 32 ms 2392 KB Output is correct
57 Correct 39 ms 2592 KB Output is correct
58 Correct 16 ms 2600 KB Output is correct
59 Correct 17 ms 2528 KB Output is correct
60 Correct 21 ms 2392 KB Output is correct
61 Correct 20 ms 2392 KB Output is correct
62 Correct 29 ms 8712 KB Output is correct
63 Correct 32 ms 7760 KB Output is correct
64 Correct 35 ms 7512 KB Output is correct
65 Correct 37 ms 8164 KB Output is correct
66 Correct 32 ms 7508 KB Output is correct
67 Correct 33 ms 7512 KB Output is correct
68 Correct 46 ms 3416 KB Output is correct
69 Correct 29 ms 8784 KB Output is correct
70 Correct 42 ms 7852 KB Output is correct
71 Correct 31 ms 8020 KB Output is correct
72 Correct 34 ms 7512 KB Output is correct
73 Correct 34 ms 7764 KB Output is correct
74 Correct 31 ms 7516 KB Output is correct
75 Correct 29 ms 7512 KB Output is correct
76 Correct 43 ms 7504 KB Output is correct
77 Correct 85 ms 5712 KB Output is correct
78 Correct 131 ms 5788 KB Output is correct
79 Correct 396 ms 21576 KB Output is correct
80 Correct 305 ms 21504 KB Output is correct
81 Correct 415 ms 21552 KB Output is correct
82 Correct 178 ms 21584 KB Output is correct
83 Correct 185 ms 21328 KB Output is correct
84 Correct 158 ms 21584 KB Output is correct
85 Correct 243 ms 21432 KB Output is correct
86 Correct 424 ms 21580 KB Output is correct
87 Correct 364 ms 21584 KB Output is correct
88 Correct 278 ms 8628 KB Output is correct
89 Correct 1183 ms 8632 KB Output is correct
90 Execution timed out 4035 ms 8636 KB Time limit exceeded
91 Halted 0 ms 0 KB -