oj.uz

Submission #905227

# Submission time Handle Problem Language Result Execution time Memory
905227 2024-01-12T19:31:26 Z qin Financial Report (JOI21_financial) C++17
100 / 100
 767 ms 48464 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18;
int base = 1;
struct seg{
		struct Node{
				int mn1, mn2, mx, p;
				Node(){ mn1 = inf-1, mn2 = inf, mx = 0, p = 0; } // mn1 < mn2 
				Node(int m1, int m2, int mxx, int pp) { mn1 = m1, mn2 = m2, mx = mxx, p = pp; }
		};
		vector<Node> t;
		void init(int n){
				while(base < n) base <<= 1;
				t.resize(base<<1);
		}
		void merge(int i){
				t[i].mx = max(t[i<<1].mx, t[i<<1|1].mx);
				if(t[i<<1].mn1 < t[i<<1|1].mn1) t[i].mn1 = t[i<<1].mn1, t[i].mn2 = min(t[i<<1].mn2, t[i<<1|1].mn1);
				else if(t[i<<1].mn1 > t[i<<1|1].mn1) t[i].mn1 = t[i<<1|1].mn1, t[i].mn2 = min(t[i<<1].mn1, t[i<<1|1].mn2);
				else t[i].mn1 = t[i<<1].mn1, t[i].mn2 = min(t[i<<1].mn2, t[i<<1|1].mn2);
		}
		void max_node(int i, int val){ t[i].mn1 = val, t[i].p = max(t[i].p, val); }
		void push(int i){
				if(t[i].p){
						if(t[i<<1].mn1 < t[i].p) max_node(i<<1, t[i].p);
						if(t[i<<1|1].mn1 < t[i].p)max_node(i<<1|1, t[i].p);
						t[i].p = 0;
				}
		}
		void upd_point(int i, int s, int e, int x, int val, int time){
				if(s == e) return void(t[i] = Node(time, inf, val, 0));
				int mid = (s+e)>>1; push(i);
				if(x <= mid) upd_point(i<<1, s, mid, x, val, time);
				else 		 upd_point(i<<1|1, mid+1, e, x, val, time);
				merge(i);
		}
		void update(int x, int val, int time){ upd_point(1, 1, base, x, val, time); }
		void purge_point(int i, int &time){
				if(base <= i) return void(t[i] = Node());
				push(i);
				if(t[i<<1].mn1 < time)   purge_point(i<<1, time);
				if(t[i<<1|1].mn1 < time) purge_point(i<<1|1, time);
				merge(i);
		}
		void zero(int time){ purge_point(1, time); }
		int qr(int i, int s, int e, int x, int y){
				if(x <= s && e <= y) return t[i].mx;
				int mid = (s+e)>>1, ret = 0; push(i);
				if(x <= mid) ret = max(ret, qr(i<<1, s, mid, x, y));
				if(mid < y) ret = max(ret, qr(i<<1|1, mid+1, e, x, y));
				merge(i);
				return ret;
		}
		int query(int x, int y){
				if(x <= y) return qr(1, 1, base, max(1, x), min(base, y));
				return 0;
		}
		void mx_time(int i, int s, int e, int x, int y, int time){
				if(x <= s && e <= y && t[i].mn1 <= time && time < t[i].mn2) return void(max_node(i, time));
				int mid = (s+e)>>1; push(i);
				if(x <= mid && t[i<<1].mn1 <= time) mx_time(i<<1, s, mid, x, y, time);
				if(mid < y && t[i<<1|1].mn1 <= time) mx_time(i<<1|1, mid+1, e, x, y, time);
				merge(i);
		}
		void max_time(int l, int r, int time){ mx_time(1, 1, base, l, r, time); }
};
void answer(){
		int n, d; scanf("%d%d", &n, &d);
		set<int> sc;
		vector<int> t(n+1);
		for(int i = 1; i <= n; ++i) scanf("%d", &t[i]), sc.emplace(t[i]);
		unordered_map<int, int> mp; int it = 0;
		for(int u : sc) mp[u] = ++it;
		for(int i = 1; i <= n; ++i) t[i] = mp[t[i]];
		
		seg seg; seg.init(n);
		int result = 0;
		deque<int> dq;
		for(int i = 1; i <= n; ++i){
				if(ssize(dq) && dq.front() < i-d) dq.pop_front();
				int mn = ssize(dq) ? t[dq.front()] : inf, mn_time = ssize(dq) ? dq.front() : 0;
				while(ssize(dq) && t[i] <= t[dq.back()]) dq.pop_back();
				dq.emplace_back(i);
				//~ printf("%d %d\n", mn, mn_time);
				
				if(mn != inf) seg.max_time(mn, base, mn_time), seg.zero(i-d);
				if(i != n) seg.update(t[i], max(seg.query(1, t[i]-1)+1, seg.query(t[i], t[i])), i);
				else result = max(seg.query(1, t[i]-1)+1, seg.query(t[i], base));
				//~ for(int j = 1; j <= n; ++j) printf("%d %d, ", seg.query(j, j), seg.t[j+base-1].mn1);
				//~ pn;
		}
		printf("%d\n", result);
}
int main(){
		int T = 1;
		for(++T; --T; ) answer();
		return 0;
}

Compilation message

Main.cpp: In function 'void answer()':
Main.cpp:75:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |   int n, d; scanf("%d%d", &n, &d);
      |             ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:78:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |   for(int i = 1; i <= n; ++i) scanf("%d", &t[i]), sc.emplace(t[i]);
      |                               ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 552 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 552 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 1 ms 348 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 2 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 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 552 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 1 ms 348 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 2 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 8 ms 860 KB Output is correct
42 Correct 9 ms 1372 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 7 ms 860 KB Output is correct
45 Correct 8 ms 860 KB Output is correct
46 Correct 8 ms 1372 KB Output is correct
47 Correct 9 ms 1404 KB Output is correct
48 Correct 9 ms 1416 KB Output is correct
49 Correct 8 ms 1372 KB Output is correct
50 Correct 9 ms 1372 KB Output is correct
51 Correct 8 ms 1372 KB Output is correct
52 Correct 9 ms 1372 KB Output is correct
53 Correct 7 ms 1372 KB Output is correct
54 Correct 9 ms 1372 KB Output is correct
55 Correct 8 ms 1372 KB Output is correct
56 Correct 8 ms 1372 KB Output is correct
57 Correct 8 ms 1372 KB Output is correct
58 Correct 6 ms 1372 KB Output is correct
59 Correct 6 ms 1220 KB Output is correct
60 Correct 7 ms 1372 KB Output is correct
61 Correct 7 ms 1372 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 18248 KB Output is correct
2 Correct 239 ms 17980 KB Output is correct
3 Correct 299 ms 20820 KB Output is correct
4 Correct 703 ms 43524 KB Output is correct
5 Correct 616 ms 47176 KB Output is correct
6 Correct 664 ms 47156 KB Output is correct
7 Correct 346 ms 46972 KB Output is correct
8 Correct 342 ms 47032 KB Output is correct
9 Correct 379 ms 47156 KB Output is correct
10 Correct 408 ms 46976 KB Output is correct
11 Correct 588 ms 47152 KB Output is correct
12 Correct 581 ms 47228 KB Output is correct
13 Correct 553 ms 46976 KB Output is correct
14 Correct 636 ms 47160 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 17980 KB Output is correct
2 Correct 211 ms 18236 KB Output is correct
3 Correct 255 ms 18172 KB Output is correct
4 Correct 520 ms 47276 KB Output is correct
5 Correct 571 ms 47248 KB Output is correct
6 Correct 494 ms 47232 KB Output is correct
7 Correct 263 ms 48464 KB Output is correct
8 Correct 320 ms 47132 KB Output is correct
9 Correct 362 ms 47308 KB Output is correct
10 Correct 421 ms 46976 KB Output is correct
11 Correct 506 ms 47188 KB Output is correct
12 Correct 589 ms 47228 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 552 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 1 ms 348 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 2 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 8 ms 860 KB Output is correct
42 Correct 9 ms 1372 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 7 ms 860 KB Output is correct
45 Correct 8 ms 860 KB Output is correct
46 Correct 8 ms 1372 KB Output is correct
47 Correct 9 ms 1404 KB Output is correct
48 Correct 9 ms 1416 KB Output is correct
49 Correct 8 ms 1372 KB Output is correct
50 Correct 9 ms 1372 KB Output is correct
51 Correct 8 ms 1372 KB Output is correct
52 Correct 9 ms 1372 KB Output is correct
53 Correct 7 ms 1372 KB Output is correct
54 Correct 9 ms 1372 KB Output is correct
55 Correct 8 ms 1372 KB Output is correct
56 Correct 8 ms 1372 KB Output is correct
57 Correct 8 ms 1372 KB Output is correct
58 Correct 6 ms 1372 KB Output is correct
59 Correct 6 ms 1220 KB Output is correct
60 Correct 7 ms 1372 KB Output is correct
61 Correct 7 ms 1372 KB Output is correct
62 Correct 133 ms 18248 KB Output is correct
63 Correct 239 ms 17980 KB Output is correct
64 Correct 299 ms 20820 KB Output is correct
65 Correct 703 ms 43524 KB Output is correct
66 Correct 616 ms 47176 KB Output is correct
67 Correct 664 ms 47156 KB Output is correct
68 Correct 346 ms 46972 KB Output is correct
69 Correct 342 ms 47032 KB Output is correct
70 Correct 379 ms 47156 KB Output is correct
71 Correct 408 ms 46976 KB Output is correct
72 Correct 588 ms 47152 KB Output is correct
73 Correct 581 ms 47228 KB Output is correct
74 Correct 553 ms 46976 KB Output is correct
75 Correct 636 ms 47160 KB Output is correct
76 Correct 130 ms 17980 KB Output is correct
77 Correct 211 ms 18236 KB Output is correct
78 Correct 255 ms 18172 KB Output is correct
79 Correct 520 ms 47276 KB Output is correct
80 Correct 571 ms 47248 KB Output is correct
81 Correct 494 ms 47232 KB Output is correct
82 Correct 263 ms 48464 KB Output is correct
83 Correct 320 ms 47132 KB Output is correct
84 Correct 362 ms 47308 KB Output is correct
85 Correct 421 ms 46976 KB Output is correct
86 Correct 506 ms 47188 KB Output is correct
87 Correct 589 ms 47228 KB Output is correct
88 Correct 340 ms 20820 KB Output is correct
89 Correct 767 ms 46272 KB Output is correct
90 Correct 427 ms 25024 KB Output is correct
91 Correct 616 ms 47168 KB Output is correct
92 Correct 200 ms 20920 KB Output is correct
93 Correct 252 ms 21332 KB Output is correct
94 Correct 524 ms 40160 KB Output is correct
95 Correct 629 ms 47152 KB Output is correct
96 Correct 716 ms 47156 KB Output is correct
97 Correct 674 ms 46976 KB Output is correct
98 Correct 755 ms 46968 KB Output is correct
99 Correct 653 ms 47152 KB Output is correct
100 Correct 627 ms 47024 KB Output is correct
101 Correct 399 ms 46972 KB Output is correct
102 Correct 462 ms 47156 KB Output is correct
103 Correct 458 ms 47160 KB Output is correct
104 Correct 461 ms 46940 KB Output is correct
105 Correct 487 ms 47228 KB Output is correct
106 Correct 473 ms 47296 KB Output is correct
107 Correct 513 ms 47156 KB Output is correct
108 Correct 612 ms 47128 KB Output is correct
109 Correct 487 ms 47156 KB Output is correct
110 Correct 660 ms 47156 KB Output is correct
111 Correct 637 ms 47152 KB Output is correct
112 Correct 521 ms 47072 KB Output is correct
113 Correct 542 ms 47156 KB Output is correct
114 Correct 686 ms 47176 KB Output is correct
115 Correct 326 ms 47112 KB Output is correct
116 Correct 316 ms 47232 KB Output is correct
117 Correct 335 ms 47164 KB Output is correct
118 Correct 355 ms 47152 KB Output is correct
119 Correct 462 ms 46976 KB Output is correct
120 Correct 472 ms 47076 KB Output is correct