oj.uz

Submission #420025

# Submission time Handle Problem Language Result Execution time Memory
420025 2021-06-07T23:59:35 Z zaneyu Financial Report (JOI21_financial) C++14
100 / 100
 666 ms 15848 KB 
/*input
7 1
100 600 600 200 300 500 500
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (ll)x.size()
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e17;
const int INF=0x3f3f3f3f;
const ll MOD=3006703054056749LL;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
	ll res=0;
	while(b){
		if(b&1) res+=a,res%=MOD;
		a+=a;
		a%=MOD; 
		b>>=1;
	}
	return res;
}
ll mypow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1) res=mult(res,a);
		a=mult(a,a);
		b/=2;
	}
	return res;
}
int a[maxn];
struct seg{
	int seg[4*maxn];
	void upd(int idx,int l,int r,int p,int x){
		if(r<p or l>p) return;
		if(l==r){
			seg[idx]=x;
			return;
		}
		int mid=(l+r)/2;
		upd(idx*2,l,mid,p,x);
		upd(idx*2+1,mid+1,r,p,x);
		seg[idx]=max(seg[idx*2],seg[idx*2+1]);
	}
	int query(int idx,int l,int r,int ql,int qr){
		if(r<ql or l>qr) return 0;
		if(ql<=l and r<=qr) return seg[idx];
		int mid=(l+r)/2;
		return max(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
	}
}dp;
struct seg2{
	int seg[4*maxn];
	void build(int idx,int l,int r){
		if(l==r){
			seg[idx]=INF;
			return;
		}
		int mid=(l+r)/2;
		build(idx*2,l,mid);
		build(idx*2+1,mid+1,r);
		seg[idx]=min(seg[idx*2],seg[idx*2+1]);
	}
	void upd(int idx,int l,int r,int p,int x){
		if(r<p or l>p) return;
		if(l==r){
			seg[idx]=x;
			return;
		}
		int mid=(l+r)/2;
		upd(idx*2,l,mid,p,x);
		upd(idx*2+1,mid+1,r,p,x);
		seg[idx]=min(seg[idx*2],seg[idx*2+1]);
	}
	int query(int idx,int l,int r,int ql,int qr){
		if(r<ql or l>qr) return INF;
		if(ql<=l and r<=qr) return seg[idx];
		int mid=(l+r)/2;
		return min(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
	}
}segg;
int mn[maxn];
int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0);
	int n,d;
	cin>>n>>d;
	vector<pii> v;
	REP(i,n) cin>>a[i],v.pb({a[i],-i}),mn[i]=INF;
	sort(ALL(v));
	segg.build(1,0,n-1);
	REP(asd,n){
		int i=-v[asd].s;
		mn[i]=i-d;
		int p=i-d;
		//cout<<mn[i]<<' ';
		while(segg.query(1,0,n-1,p,i)<p){
			//cout<<p<<' '<<i<<'\n';
			p=segg.query(1,0,n-1,p,i);
		}
		mn[i]=p;
		//cout<<mn[i]<<'\n';
		segg.upd(1,0,n-1,i,mn[i]);
		dp.upd(1,0,n-1,i,dp.query(1,0,n-1,max(0,mn[i]),i)+1);
	}
	//REP(i,n) cout<<mn[i]<<' ';
	cout<<dp.query(1,0,n-1,0,n-1);
}

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 1 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 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 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 1 ms 332 KB Output is correct
18 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 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 1 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 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 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 1 ms 332 KB Output is correct
18 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 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 1 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 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 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 1 ms 332 KB Output is correct
18 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 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 8 ms 760 KB Output is correct
42 Correct 8 ms 716 KB Output is correct
43 Correct 11 ms 760 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 8 ms 716 KB Output is correct
46 Correct 7 ms 716 KB Output is correct
47 Correct 7 ms 720 KB Output is correct
48 Correct 8 ms 716 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 10 ms 716 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 760 KB Output is correct
53 Correct 6 ms 716 KB Output is correct
54 Correct 6 ms 740 KB Output is correct
55 Correct 8 ms 716 KB Output is correct
56 Correct 8 ms 764 KB Output is correct
57 Correct 8 ms 716 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 7 ms 716 KB Output is correct
61 Correct 7 ms 756 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 15668 KB Output is correct
2 Correct 314 ms 15772 KB Output is correct
3 Correct 406 ms 15808 KB Output is correct
4 Correct 454 ms 15652 KB Output is correct
5 Correct 382 ms 15648 KB Output is correct
6 Correct 447 ms 15656 KB Output is correct
7 Correct 263 ms 15600 KB Output is correct
8 Correct 228 ms 15588 KB Output is correct
9 Correct 284 ms 15676 KB Output is correct
10 Correct 262 ms 15652 KB Output is correct
11 Correct 383 ms 15656 KB Output is correct
12 Correct 389 ms 15688 KB Output is correct
13 Correct 462 ms 15780 KB Output is correct
14 Correct 443 ms 15652 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 15760 KB Output is correct
2 Correct 380 ms 15588 KB Output is correct
3 Correct 426 ms 15652 KB Output is correct
4 Correct 435 ms 15576 KB Output is correct
5 Correct 384 ms 15656 KB Output is correct
6 Correct 425 ms 15612 KB Output is correct
7 Correct 257 ms 15612 KB Output is correct
8 Correct 222 ms 15800 KB Output is correct
9 Correct 267 ms 15652 KB Output is correct
10 Correct 340 ms 15792 KB Output is correct
11 Correct 413 ms 15848 KB Output is correct
12 Correct 364 ms 15672 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 1 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 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 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 1 ms 332 KB Output is correct
18 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 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 8 ms 760 KB Output is correct
42 Correct 8 ms 716 KB Output is correct
43 Correct 11 ms 760 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 8 ms 716 KB Output is correct
46 Correct 7 ms 716 KB Output is correct
47 Correct 7 ms 720 KB Output is correct
48 Correct 8 ms 716 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 10 ms 716 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 760 KB Output is correct
53 Correct 6 ms 716 KB Output is correct
54 Correct 6 ms 740 KB Output is correct
55 Correct 8 ms 716 KB Output is correct
56 Correct 8 ms 764 KB Output is correct
57 Correct 8 ms 716 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 7 ms 716 KB Output is correct
61 Correct 7 ms 756 KB Output is correct
62 Correct 237 ms 15668 KB Output is correct
63 Correct 314 ms 15772 KB Output is correct
64 Correct 406 ms 15808 KB Output is correct
65 Correct 454 ms 15652 KB Output is correct
66 Correct 382 ms 15648 KB Output is correct
67 Correct 447 ms 15656 KB Output is correct
68 Correct 263 ms 15600 KB Output is correct
69 Correct 228 ms 15588 KB Output is correct
70 Correct 284 ms 15676 KB Output is correct
71 Correct 262 ms 15652 KB Output is correct
72 Correct 383 ms 15656 KB Output is correct
73 Correct 389 ms 15688 KB Output is correct
74 Correct 462 ms 15780 KB Output is correct
75 Correct 443 ms 15652 KB Output is correct
76 Correct 238 ms 15760 KB Output is correct
77 Correct 380 ms 15588 KB Output is correct
78 Correct 426 ms 15652 KB Output is correct
79 Correct 435 ms 15576 KB Output is correct
80 Correct 384 ms 15656 KB Output is correct
81 Correct 425 ms 15612 KB Output is correct
82 Correct 257 ms 15612 KB Output is correct
83 Correct 222 ms 15800 KB Output is correct
84 Correct 267 ms 15652 KB Output is correct
85 Correct 340 ms 15792 KB Output is correct
86 Correct 413 ms 15848 KB Output is correct
87 Correct 364 ms 15672 KB Output is correct
88 Correct 501 ms 15656 KB Output is correct
89 Correct 539 ms 15676 KB Output is correct
90 Correct 539 ms 15576 KB Output is correct
91 Correct 485 ms 15684 KB Output is correct
92 Correct 666 ms 15784 KB Output is correct
93 Correct 498 ms 15604 KB Output is correct
94 Correct 463 ms 15580 KB Output is correct
95 Correct 443 ms 15632 KB Output is correct
96 Correct 527 ms 15652 KB Output is correct
97 Correct 518 ms 15652 KB Output is correct
98 Correct 490 ms 15652 KB Output is correct
99 Correct 495 ms 15652 KB Output is correct
100 Correct 501 ms 15776 KB Output is correct
101 Correct 294 ms 15696 KB Output is correct
102 Correct 302 ms 15748 KB Output is correct
103 Correct 349 ms 15752 KB Output is correct
104 Correct 372 ms 15780 KB Output is correct
105 Correct 428 ms 15816 KB Output is correct
106 Correct 415 ms 15816 KB Output is correct
107 Correct 458 ms 15612 KB Output is correct
108 Correct 475 ms 15628 KB Output is correct
109 Correct 416 ms 15680 KB Output is correct
110 Correct 540 ms 15824 KB Output is correct
111 Correct 526 ms 15652 KB Output is correct
112 Correct 380 ms 15652 KB Output is correct
113 Correct 468 ms 15780 KB Output is correct
114 Correct 500 ms 15748 KB Output is correct
115 Correct 265 ms 15664 KB Output is correct
116 Correct 256 ms 15628 KB Output is correct
117 Correct 294 ms 15652 KB Output is correct
118 Correct 303 ms 15780 KB Output is correct
119 Correct 408 ms 15636 KB Output is correct
120 Correct 416 ms 15640 KB Output is correct