oj.uz

Submission #479359

# Submission time Handle Problem Language Result Execution time Memory
479359 2021-10-11T13:15:10 Z Arvin Financial Report (JOI21_financial) C++11
100 / 100
 490 ms 18228 KB 
#include <bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353

const int maxN = 3e5 + 5;

struct SegTree { // index start from 0 (v)
	int tree[4*maxN], lazy[4*maxN];
	
	int n;
	void resize(int m){
		n = m;
	}
	
	void push(int v){
		if(lazy[v] == -1) return ;
		
		tree[v*2+1] = lazy[v];
		lazy[v*2+1] = lazy[v];
		
		tree[v*2+2] = lazy[v];
		lazy[v*2+2] = lazy[v];
		
		lazy[v] = -1;
	}
	
	void update(int v, int curL, int curR, int l, int r, int val){
		if(l > r) return;
		if(curL == l && r == curR){
			tree[v] = val;
			lazy[v] = val;
		} else {
			push(v);
			
			int curM = (curL+curR) >> 1;
			
			update(v*2+1, curL, curM, l, min(r, curM), val);
			update(v*2+2, curM+1, curR, max(l, curM+1), r, val);
			
			tree[v] = max(tree[v*2+1], tree[v*2+2]);
		}
	}
	
	int query(int v, int curL, int curR, int l, int r){
		if(l > r || curL > curR) return 0;
		if(l <= curL && curR <= r){
			return tree[v];
		}
		
		push(v);
		
		int curM = (curL+curR) >> 1;
		return max(query(v*2+1, curL, curM, l, min(r, curM)), query(v*2+2, curM+1, curR, max(l, curM+1), r));
	}
};

SegTree tree;

int main(){
	ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

	int n, d;
	cin >> n >> d;
	
	vector<int> v;
	int a[n];
	for(int x=0;x<n;x++){
		cin >> a[x];
		v.push_back(a[x]);
	}
	
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	
	for(int x=0;x<n;x++){
		a[x] = lower_bound(v.begin(), v.end(), a[x]) - v.begin();	
	}
	
	tree.update(0, 0, v.size()-1, a[0], a[0], 1);
	
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	pq.push({a[0], 0});
	
	for(int x=1;x<n;x++){
		while(!pq.empty() && x-pq.top().second > d){
			pq.pop();
		}
		
		tree.update(0, 0, v.size()-1, 0, pq.top().first-1, 0);
		int val = tree.query(0, 0, v.size()-1, pq.top().first, a[x]-1)+1;
		int val2 = tree.query(0, 0, v.size()-1, a[x], a[x]);
		
//		cout << x+1 << "(" << a[x] << ") -> " << val << " " << val2 << " " << pq.top().first << "\n";
//		cout << x << "(" << a[x] << "): " << p.first << " " << p.second << " " << pq.top().first << "\n";
		
		tree.update(0, 0, v.size()-1, a[x], a[x], max(val, val2));
		pq.push({a[x], x});
	}
	while(!pq.empty() && n-1-pq.top().second > d){
		pq.pop();
	}
		
	cout << tree.query(0, 0, v.size()-1, pq.top().first, v.size()-1) << "\n";
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 216 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 320 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 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 316 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 320 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 216 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 320 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 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 316 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 320 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 460 KB Output is correct
42 Correct 9 ms 588 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 7 ms 460 KB Output is correct
45 Correct 6 ms 588 KB Output is correct
46 Correct 7 ms 588 KB Output is correct
47 Correct 8 ms 588 KB Output is correct
48 Correct 8 ms 612 KB Output is correct
49 Correct 8 ms 604 KB Output is correct
50 Correct 8 ms 620 KB Output is correct
51 Correct 7 ms 596 KB Output is correct
52 Correct 8 ms 588 KB Output is correct
53 Correct 6 ms 588 KB Output is correct
54 Correct 8 ms 592 KB Output is correct
55 Correct 8 ms 588 KB Output is correct
56 Correct 7 ms 588 KB Output is correct
57 Correct 8 ms 588 KB Output is correct
58 Correct 5 ms 588 KB Output is correct
59 Correct 5 ms 588 KB Output is correct
60 Correct 6 ms 588 KB Output is correct
61 Correct 7 ms 588 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 3636 KB Output is correct
2 Correct 86 ms 6076 KB Output is correct
3 Correct 174 ms 6240 KB Output is correct
4 Correct 437 ms 9768 KB Output is correct
5 Correct 388 ms 13876 KB Output is correct
6 Correct 446 ms 13804 KB Output is correct
7 Correct 253 ms 13756 KB Output is correct
8 Correct 232 ms 17072 KB Output is correct
9 Correct 261 ms 13880 KB Output is correct
10 Correct 280 ms 16076 KB Output is correct
11 Correct 387 ms 13876 KB Output is correct
12 Correct 405 ms 13960 KB Output is correct
13 Correct 408 ms 13880 KB Output is correct
14 Correct 368 ms 13884 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 6840 KB Output is correct
2 Correct 124 ms 9748 KB Output is correct
3 Correct 211 ms 9796 KB Output is correct
4 Correct 418 ms 17932 KB Output is correct
5 Correct 377 ms 18012 KB Output is correct
6 Correct 380 ms 18012 KB Output is correct
7 Correct 205 ms 17020 KB Output is correct
8 Correct 219 ms 16992 KB Output is correct
9 Correct 224 ms 17032 KB Output is correct
10 Correct 282 ms 17456 KB Output is correct
11 Correct 402 ms 17940 KB Output is correct
12 Correct 314 ms 18040 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 216 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 320 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 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 316 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 320 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 460 KB Output is correct
42 Correct 9 ms 588 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 7 ms 460 KB Output is correct
45 Correct 6 ms 588 KB Output is correct
46 Correct 7 ms 588 KB Output is correct
47 Correct 8 ms 588 KB Output is correct
48 Correct 8 ms 612 KB Output is correct
49 Correct 8 ms 604 KB Output is correct
50 Correct 8 ms 620 KB Output is correct
51 Correct 7 ms 596 KB Output is correct
52 Correct 8 ms 588 KB Output is correct
53 Correct 6 ms 588 KB Output is correct
54 Correct 8 ms 592 KB Output is correct
55 Correct 8 ms 588 KB Output is correct
56 Correct 7 ms 588 KB Output is correct
57 Correct 8 ms 588 KB Output is correct
58 Correct 5 ms 588 KB Output is correct
59 Correct 5 ms 588 KB Output is correct
60 Correct 6 ms 588 KB Output is correct
61 Correct 7 ms 588 KB Output is correct
62 Correct 50 ms 3636 KB Output is correct
63 Correct 86 ms 6076 KB Output is correct
64 Correct 174 ms 6240 KB Output is correct
65 Correct 437 ms 9768 KB Output is correct
66 Correct 388 ms 13876 KB Output is correct
67 Correct 446 ms 13804 KB Output is correct
68 Correct 253 ms 13756 KB Output is correct
69 Correct 232 ms 17072 KB Output is correct
70 Correct 261 ms 13880 KB Output is correct
71 Correct 280 ms 16076 KB Output is correct
72 Correct 387 ms 13876 KB Output is correct
73 Correct 405 ms 13960 KB Output is correct
74 Correct 408 ms 13880 KB Output is correct
75 Correct 368 ms 13884 KB Output is correct
76 Correct 57 ms 6840 KB Output is correct
77 Correct 124 ms 9748 KB Output is correct
78 Correct 211 ms 9796 KB Output is correct
79 Correct 418 ms 17932 KB Output is correct
80 Correct 377 ms 18012 KB Output is correct
81 Correct 380 ms 18012 KB Output is correct
82 Correct 205 ms 17020 KB Output is correct
83 Correct 219 ms 16992 KB Output is correct
84 Correct 224 ms 17032 KB Output is correct
85 Correct 282 ms 17456 KB Output is correct
86 Correct 402 ms 17940 KB Output is correct
87 Correct 314 ms 18040 KB Output is correct
88 Correct 292 ms 6324 KB Output is correct
89 Correct 490 ms 13832 KB Output is correct
90 Correct 417 ms 8248 KB Output is correct
91 Correct 455 ms 17972 KB Output is correct
92 Correct 104 ms 9816 KB Output is correct
93 Correct 228 ms 9900 KB Output is correct
94 Correct 363 ms 13884 KB Output is correct
95 Correct 454 ms 13884 KB Output is correct
96 Correct 471 ms 14528 KB Output is correct
97 Correct 484 ms 15608 KB Output is correct
98 Correct 465 ms 18228 KB Output is correct
99 Correct 447 ms 17964 KB Output is correct
100 Correct 442 ms 17912 KB Output is correct
101 Correct 276 ms 13876 KB Output is correct
102 Correct 318 ms 13872 KB Output is correct
103 Correct 340 ms 14000 KB Output is correct
104 Correct 375 ms 13968 KB Output is correct
105 Correct 430 ms 15536 KB Output is correct
106 Correct 372 ms 17468 KB Output is correct
107 Correct 387 ms 17720 KB Output is correct
108 Correct 410 ms 18032 KB Output is correct
109 Correct 396 ms 13976 KB Output is correct
110 Correct 467 ms 16824 KB Output is correct
111 Correct 433 ms 16820 KB Output is correct
112 Correct 368 ms 16784 KB Output is correct
113 Correct 438 ms 17976 KB Output is correct
114 Correct 434 ms 18156 KB Output is correct
115 Correct 226 ms 16976 KB Output is correct
116 Correct 218 ms 17032 KB Output is correct
117 Correct 292 ms 18136 KB Output is correct
118 Correct 291 ms 17944 KB Output is correct
119 Correct 395 ms 18104 KB Output is correct
120 Correct 375 ms 17952 KB Output is correct