oj.uz

Submission #907225

# Submission time Handle Problem Language Result Execution time Memory
907225 2024-01-15T09:28:40 Z dsyz Financial Report (JOI21_financial) C++17
100 / 100
 655 ms 104340 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
ll N,D;
struct node1 {
	ll s,e,m,v;
	node1 *l, *r;
	node1(ll _s,ll _e){
		s = _s;
		e = _e;
		m = (s + e) / 2;
		v = 0;
		if(s != e){
			l = new node1(s,m);
			r = new node1(m + 1,e);
		}
	}
	void update(ll x,ll nval){
		if(s == e){
			v = nval;
			return;
		}else{
			if(x > m) r -> update(x,nval);
			else l -> update(x,nval);
			v = max(l -> v,r -> v);
		}
	}
	ll bs(ll x){ //binary serach for leftmost position with v > x
		if(s == e){
			if(v <= x) return N + 5;
			else return s;
		}else{
			if(l->v > x) return l -> bs(x);
			else if(r->v > x) return r -> bs(x);
			else return N + 5;
		}
	}
} *root1;
struct node2 {
	ll s,e,m,lazy,v;
	node2 *l, *r;
	node2(ll _s,ll _e){
		s = _s;
		e = _e;
		m = (s + e) / 2;
		lazy = -1;
		v = 0;
		if(s != e){
			l = new node2(s,m);
			r = new node2(m + 1,e);
		}
	}
	void propo(){
		if(lazy == -1) return;
		v = max(v,lazy);
		if(s != e){
			l->lazy = max(l->lazy,lazy);
			r->lazy = max(r->lazy,lazy);
		}
		lazy = -1;
	}
	void update(ll x,ll y,ll nval){
		propo();
		if(s == x && e == y){
			lazy = max(lazy,nval);
			return;
		}else{
			if(x > m) r -> update(x,y,nval);
			else if(y <= m) l -> update(x,y,nval);
			else l -> update(x,m,nval), r -> update(m + 1,y,nval);
			l -> propo(), r -> propo();
			v = max(l -> v,r -> v);
		}
	}
	ll query(ll x){
		propo();
		if(s == e){
			return v;
		}else{
			if(x > m) return r -> query(x);
			else return l -> query(x);
		}
	}
} *root2;
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	cin>>N>>D;
	ll mini[N], rightmost[N];
	pair<ll,ll> arr[N];
	root1 = new node1(0,N + 5);
	root2 = new node2(0,N + 5);
	for(ll i = 0;i < N;i++){
		cin>>arr[i].first;
		arr[i].second = -i;
	}
	multiset<ll> s;
	for(ll i = 0;i < N;i++){
		s.insert(arr[i].first);
		if(i >= D) s.erase(s.find(arr[i - D].first));
		mini[i] = *s.begin();
	}
	for(ll i = N - 1;i >= 0;i--){
		if(i + D < N) root1 -> update(i + D,mini[i + D]); //update (i+D)th position with value mini[i+D]
		rightmost[i] = root1 -> bs(arr[i].first);
	}
	sort(arr,arr + N); //increasing A[i], if tie (same A[i]) from right to left
	ll dp[N];
	ll ans = 0;
	for(auto u : arr){ //loop in order of increasing A[i], if tie (same A[i]) from right to left
		ll ind = -1 * u.second;
		dp[ind] = root2 -> query(ind) + 1;
		root2 -> update(ind,rightmost[ind],dp[ind]); //future states can only come from ind if their original position <= rightmost[ind]
		ans = max(ans,dp[ind]);
	}
	cout<<ans<<'\n';
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 504 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 756 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 5 ms 2392 KB Output is correct
42 Correct 7 ms 2456 KB Output is correct
43 Correct 5 ms 2392 KB Output is correct
44 Correct 6 ms 2524 KB Output is correct
45 Correct 6 ms 2396 KB Output is correct
46 Correct 5 ms 2652 KB Output is correct
47 Correct 5 ms 2396 KB Output is correct
48 Correct 6 ms 2396 KB Output is correct
49 Correct 6 ms 2396 KB Output is correct
50 Correct 6 ms 2396 KB Output is correct
51 Correct 5 ms 2392 KB Output is correct
52 Correct 6 ms 2392 KB Output is correct
53 Correct 5 ms 2396 KB Output is correct
54 Correct 6 ms 2396 KB Output is correct
55 Correct 6 ms 2396 KB Output is correct
56 Correct 6 ms 2496 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 4 ms 2648 KB Output is correct
59 Correct 4 ms 2652 KB Output is correct
60 Correct 5 ms 2396 KB Output is correct
61 Correct 5 ms 2396 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 89952 KB Output is correct
2 Correct 326 ms 89684 KB Output is correct
3 Correct 441 ms 90204 KB Output is correct
4 Correct 480 ms 90216 KB Output is correct
5 Correct 333 ms 90176 KB Output is correct
6 Correct 441 ms 90020 KB Output is correct
7 Correct 208 ms 89652 KB Output is correct
8 Correct 217 ms 89936 KB Output is correct
9 Correct 217 ms 90176 KB Output is correct
10 Correct 226 ms 90172 KB Output is correct
11 Correct 256 ms 90196 KB Output is correct
12 Correct 282 ms 90192 KB Output is correct
13 Correct 261 ms 90112 KB Output is correct
14 Correct 463 ms 90176 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 104340 KB Output is correct
2 Correct 538 ms 104012 KB Output is correct
3 Correct 589 ms 104272 KB Output is correct
4 Correct 608 ms 104280 KB Output is correct
5 Correct 465 ms 104020 KB Output is correct
6 Correct 544 ms 104172 KB Output is correct
7 Correct 208 ms 104052 KB Output is correct
8 Correct 215 ms 103776 KB Output is correct
9 Correct 237 ms 103116 KB Output is correct
10 Correct 299 ms 103760 KB Output is correct
11 Correct 465 ms 104016 KB Output is correct
12 Correct 372 ms 104020 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 504 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 756 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 5 ms 2392 KB Output is correct
42 Correct 7 ms 2456 KB Output is correct
43 Correct 5 ms 2392 KB Output is correct
44 Correct 6 ms 2524 KB Output is correct
45 Correct 6 ms 2396 KB Output is correct
46 Correct 5 ms 2652 KB Output is correct
47 Correct 5 ms 2396 KB Output is correct
48 Correct 6 ms 2396 KB Output is correct
49 Correct 6 ms 2396 KB Output is correct
50 Correct 6 ms 2396 KB Output is correct
51 Correct 5 ms 2392 KB Output is correct
52 Correct 6 ms 2392 KB Output is correct
53 Correct 5 ms 2396 KB Output is correct
54 Correct 6 ms 2396 KB Output is correct
55 Correct 6 ms 2396 KB Output is correct
56 Correct 6 ms 2496 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 4 ms 2648 KB Output is correct
59 Correct 4 ms 2652 KB Output is correct
60 Correct 5 ms 2396 KB Output is correct
61 Correct 5 ms 2396 KB Output is correct
62 Correct 232 ms 89952 KB Output is correct
63 Correct 326 ms 89684 KB Output is correct
64 Correct 441 ms 90204 KB Output is correct
65 Correct 480 ms 90216 KB Output is correct
66 Correct 333 ms 90176 KB Output is correct
67 Correct 441 ms 90020 KB Output is correct
68 Correct 208 ms 89652 KB Output is correct
69 Correct 217 ms 89936 KB Output is correct
70 Correct 217 ms 90176 KB Output is correct
71 Correct 226 ms 90172 KB Output is correct
72 Correct 256 ms 90196 KB Output is correct
73 Correct 282 ms 90192 KB Output is correct
74 Correct 261 ms 90112 KB Output is correct
75 Correct 463 ms 90176 KB Output is correct
76 Correct 224 ms 104340 KB Output is correct
77 Correct 538 ms 104012 KB Output is correct
78 Correct 589 ms 104272 KB Output is correct
79 Correct 608 ms 104280 KB Output is correct
80 Correct 465 ms 104020 KB Output is correct
81 Correct 544 ms 104172 KB Output is correct
82 Correct 208 ms 104052 KB Output is correct
83 Correct 215 ms 103776 KB Output is correct
84 Correct 237 ms 103116 KB Output is correct
85 Correct 299 ms 103760 KB Output is correct
86 Correct 465 ms 104016 KB Output is correct
87 Correct 372 ms 104020 KB Output is correct
88 Correct 491 ms 90216 KB Output is correct
89 Correct 510 ms 90172 KB Output is correct
90 Correct 579 ms 90216 KB Output is correct
91 Correct 593 ms 90220 KB Output is correct
92 Correct 494 ms 90256 KB Output is correct
93 Correct 581 ms 90860 KB Output is correct
94 Correct 603 ms 100112 KB Output is correct
95 Correct 446 ms 90220 KB Output is correct
96 Correct 510 ms 90200 KB Output is correct
97 Correct 655 ms 90220 KB Output is correct
98 Correct 574 ms 90216 KB Output is correct
99 Correct 569 ms 90248 KB Output is correct
100 Correct 587 ms 90244 KB Output is correct
101 Correct 226 ms 90196 KB Output is correct
102 Correct 275 ms 90216 KB Output is correct
103 Correct 307 ms 90192 KB Output is correct
104 Correct 346 ms 90308 KB Output is correct
105 Correct 410 ms 91160 KB Output is correct
106 Correct 274 ms 90120 KB Output is correct
107 Correct 302 ms 90412 KB Output is correct
108 Correct 509 ms 90508 KB Output is correct
109 Correct 280 ms 90436 KB Output is correct
110 Correct 443 ms 90216 KB Output is correct
111 Correct 497 ms 90456 KB Output is correct
112 Correct 286 ms 90448 KB Output is correct
113 Correct 496 ms 90452 KB Output is correct
114 Correct 479 ms 90460 KB Output is correct
115 Correct 233 ms 104272 KB Output is correct
116 Correct 235 ms 104304 KB Output is correct
117 Correct 307 ms 97268 KB Output is correct
118 Correct 270 ms 97104 KB Output is correct
119 Correct 313 ms 90296 KB Output is correct
120 Correct 300 ms 90072 KB Output is correct