oj.uz

Submission #531184

# Submission time Handle Problem Language Result Execution time Memory
531184 2022-02-28T03:55:02 Z chaoyue Financial Report (JOI21_financial) C++17
100 / 100
 575 ms 37224 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

struct node{
	int s, e, m, maxi;
	node *l, *r;
	
	node(int S, int E){
		s = S;
		e = E;
		m = (s+e)/2;
		maxi = 0;
		if(s != e){
			l = new node(s, m);
			r = new node(m+1, e);
		}
	}
	
	int query(int S, int E){
		if(s > E || e < S) return 0;
		if(s >= S && e <= E) return maxi;
		return max(l->query(S, E), r->query(S, E));
	}
	
	void update(int idx, int V){
		if(s > idx || e < idx) return;
		if(s == idx && e == idx){
			maxi = V;
			return;
		}
		l->update(idx, V);
		r->update(idx, V);
		maxi = max(l->maxi, r->maxi);
	}
} *root;

bool cmp(pair<int, int> a, pair<int, int> b){
	if(a.first < b.first || (a.first == b.first && a.second > b.second)) return 1;
	return 0;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, d, l, r, pos;
	cin>>n>>d;
	vector<pair<int, int> > v(n);
	set<pair<int, int> > s;
	set<pair<int, int> >::iterator it;
	for(int i=0; i<n; i++){
		cin>>v[i].first;
		v[i].second = i;
	}
	sort(v.begin(), v.end(), cmp);
	/*for(int i=0; i<n; i++){
		cout<<"("<<v[i].first<<", "<<v[i].second<<") ";
	}
	cout<<"\n";*/
	s.insert({0, n-1});
	root = new node(0, n);
	for(int i=0; i<n; i++){
		//insert into s and find rightmost gap
		pos = v[i].second;
		if(!s.empty()){
			it = s.upper_bound({pos, n+1});
			if(it != s.begin()){
				it--;
				l = (*it).first;
				r = (*it).second;
				if(r >= pos){
					s.erase(it);
					if(pos - l >= d){
						s.insert({l, pos-1});
					}
					if(r - pos >= d){
						s.insert({pos+1, r});
					}
				}
			}
		}
		it = s.upper_bound({pos, n+1});
		if(it == s.begin()){
			l = 0;
		}
		else{
			it--;
			l = (*it).second + 1;
		}
		//cout<<"l: "<<l<<"\n";
		//cout<<"query: "<<root->query(l, pos)<<"\n";
		root->update(pos, root->query(l, pos) + 1);
		/*cout<<"updated: "<<root->query(pos, pos)<<"\nset: ";
		for(it = s.begin(); it!=s.end(); it++){
			cout<<"("<<(*it).first<<", "<<(*it).second<<") ";
		}
		cout<<"\n";*/
		
	}
	cout<<root->query(0, n-1);
	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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 264 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 312 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 264 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 312 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 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 312 KB Output is correct
33 Correct 1 ms 320 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 312 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 264 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 312 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 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 312 KB Output is correct
33 Correct 1 ms 320 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 312 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 1056 KB Output is correct
42 Correct 7 ms 1068 KB Output is correct
43 Correct 5 ms 1092 KB Output is correct
44 Correct 6 ms 972 KB Output is correct
45 Correct 4 ms 964 KB Output is correct
46 Correct 4 ms 972 KB Output is correct
47 Correct 5 ms 1080 KB Output is correct
48 Correct 5 ms 972 KB Output is correct
49 Correct 4 ms 1076 KB Output is correct
50 Correct 4 ms 1096 KB Output is correct
51 Correct 5 ms 1092 KB Output is correct
52 Correct 6 ms 1100 KB Output is correct
53 Correct 3 ms 1100 KB Output is correct
54 Correct 4 ms 972 KB Output is correct
55 Correct 4 ms 1100 KB Output is correct
56 Correct 4 ms 972 KB Output is correct
57 Correct 5 ms 1000 KB Output is correct
58 Correct 3 ms 1100 KB Output is correct
59 Correct 4 ms 960 KB Output is correct
60 Correct 4 ms 972 KB Output is correct
61 Correct 4 ms 968 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 30952 KB Output is correct
2 Correct 275 ms 34524 KB Output is correct
3 Correct 444 ms 34400 KB Output is correct
4 Correct 575 ms 37224 KB Output is correct
5 Correct 388 ms 36188 KB Output is correct
6 Correct 565 ms 37208 KB Output is correct
7 Correct 143 ms 33420 KB Output is correct
8 Correct 154 ms 33604 KB Output is correct
9 Correct 157 ms 33608 KB Output is correct
10 Correct 158 ms 33608 KB Output is correct
11 Correct 354 ms 33868 KB Output is correct
12 Correct 375 ms 34124 KB Output is correct
13 Correct 336 ms 33720 KB Output is correct
14 Correct 466 ms 33956 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 30916 KB Output is correct
2 Correct 257 ms 30916 KB Output is correct
3 Correct 311 ms 30952 KB Output is correct
4 Correct 287 ms 30952 KB Output is correct
5 Correct 294 ms 31044 KB Output is correct
6 Correct 278 ms 31080 KB Output is correct
7 Correct 128 ms 30972 KB Output is correct
8 Correct 134 ms 31084 KB Output is correct
9 Correct 140 ms 30824 KB Output is correct
10 Correct 187 ms 30932 KB Output is correct
11 Correct 326 ms 31072 KB Output is correct
12 Correct 202 ms 31052 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 264 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 0 ms 308 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 312 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 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 312 KB Output is correct
33 Correct 1 ms 320 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 312 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 1056 KB Output is correct
42 Correct 7 ms 1068 KB Output is correct
43 Correct 5 ms 1092 KB Output is correct
44 Correct 6 ms 972 KB Output is correct
45 Correct 4 ms 964 KB Output is correct
46 Correct 4 ms 972 KB Output is correct
47 Correct 5 ms 1080 KB Output is correct
48 Correct 5 ms 972 KB Output is correct
49 Correct 4 ms 1076 KB Output is correct
50 Correct 4 ms 1096 KB Output is correct
51 Correct 5 ms 1092 KB Output is correct
52 Correct 6 ms 1100 KB Output is correct
53 Correct 3 ms 1100 KB Output is correct
54 Correct 4 ms 972 KB Output is correct
55 Correct 4 ms 1100 KB Output is correct
56 Correct 4 ms 972 KB Output is correct
57 Correct 5 ms 1000 KB Output is correct
58 Correct 3 ms 1100 KB Output is correct
59 Correct 4 ms 960 KB Output is correct
60 Correct 4 ms 972 KB Output is correct
61 Correct 4 ms 968 KB Output is correct
62 Correct 137 ms 30952 KB Output is correct
63 Correct 275 ms 34524 KB Output is correct
64 Correct 444 ms 34400 KB Output is correct
65 Correct 575 ms 37224 KB Output is correct
66 Correct 388 ms 36188 KB Output is correct
67 Correct 565 ms 37208 KB Output is correct
68 Correct 143 ms 33420 KB Output is correct
69 Correct 154 ms 33604 KB Output is correct
70 Correct 157 ms 33608 KB Output is correct
71 Correct 158 ms 33608 KB Output is correct
72 Correct 354 ms 33868 KB Output is correct
73 Correct 375 ms 34124 KB Output is correct
74 Correct 336 ms 33720 KB Output is correct
75 Correct 466 ms 33956 KB Output is correct
76 Correct 136 ms 30916 KB Output is correct
77 Correct 257 ms 30916 KB Output is correct
78 Correct 311 ms 30952 KB Output is correct
79 Correct 287 ms 30952 KB Output is correct
80 Correct 294 ms 31044 KB Output is correct
81 Correct 278 ms 31080 KB Output is correct
82 Correct 128 ms 30972 KB Output is correct
83 Correct 134 ms 31084 KB Output is correct
84 Correct 140 ms 30824 KB Output is correct
85 Correct 187 ms 30932 KB Output is correct
86 Correct 326 ms 31072 KB Output is correct
87 Correct 202 ms 31052 KB Output is correct
88 Correct 484 ms 35796 KB Output is correct
89 Correct 472 ms 35116 KB Output is correct
90 Correct 403 ms 34252 KB Output is correct
91 Correct 306 ms 33732 KB Output is correct
92 Correct 288 ms 33612 KB Output is correct
93 Correct 305 ms 33740 KB Output is correct
94 Correct 314 ms 33744 KB Output is correct
95 Correct 399 ms 35276 KB Output is correct
96 Correct 383 ms 34252 KB Output is correct
97 Correct 360 ms 33736 KB Output is correct
98 Correct 332 ms 33736 KB Output is correct
99 Correct 300 ms 33616 KB Output is correct
100 Correct 307 ms 33712 KB Output is correct
101 Correct 159 ms 33608 KB Output is correct
102 Correct 144 ms 33624 KB Output is correct
103 Correct 171 ms 33716 KB Output is correct
104 Correct 171 ms 33712 KB Output is correct
105 Correct 210 ms 33732 KB Output is correct
106 Correct 218 ms 33740 KB Output is correct
107 Correct 227 ms 33604 KB Output is correct
108 Correct 288 ms 33720 KB Output is correct
109 Correct 285 ms 33632 KB Output is correct
110 Correct 342 ms 33876 KB Output is correct
111 Correct 313 ms 33740 KB Output is correct
112 Correct 184 ms 33732 KB Output is correct
113 Correct 344 ms 33720 KB Output is correct
114 Correct 255 ms 33720 KB Output is correct
115 Correct 147 ms 33640 KB Output is correct
116 Correct 127 ms 33716 KB Output is correct
117 Correct 174 ms 33612 KB Output is correct
118 Correct 175 ms 33604 KB Output is correct
119 Correct 211 ms 33620 KB Output is correct
120 Correct 194 ms 33624 KB Output is correct