oj.uz

Submission #541612

# Submission time Handle Problem Language Result Execution time Memory
541612 2022-03-23T21:14:51 Z xuliu Financial Report (JOI21_financial) C++17
100 / 100
 499 ms 29896 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long 
#define ld long double 
#define debug if(0)

struct segtree {
	int size;
	vector<int> seg;
	void init(int n) {
		size = 1;
		while(size < n) size <<= 1;
		seg.assign(2*size+2, 0);
	}
	void set(int x, int v) {
		x += size;
		seg[x] = v; x>>=1;
		while(x) {
			seg[x] = max(seg[2*x], seg[2*x+1]);
			x>>=1;
		}
	}
	int query(int l, int r, int x, int lx, int rx) {
		if(l <= lx && r >= rx) return seg[x];
		if(l > rx || r < lx) return 0;
		int m = (lx+rx)/2;
		return max(query(l, r, 2*x, lx, m), query(l, r, 2*x+1, m+1, rx));
	}
	int query(int l, int r) { return query(l, r, 1, 0, size-1); }
};

struct Dsu {
	static const int N = 3e5 + 4;
	int tab[N], cnt[N], mn[N];
	Dsu() {
		memset(cnt, 0, sizeof cnt);
		for(int i=0; i<N; i++) { tab[i] = mn[i] = i; }
	}
	int Find(int x) {
		if(tab[x] == x) return tab[x];
		return tab[x] = Find(tab[x]);
	}
	void unite(int a, int b) {
		int fa = Find(a), fb = Find(b);
		if(fa == fb) return;
		if(cnt[fa] < cnt[fb]) {
			tab[fa] = fb;
			cnt[fb] += cnt[fa];
			mn[fb] = min(mn[fa], mn[fb]);
		}
		else {
			tab[fb] = fa;
			cnt[fa] += cnt[fb];
			mn[fa] = min(mn[fa], mn[fb]);
		}
	}
	int getmn(int x) { return mn[Find(x)]; }
};

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, d; cin>>n>>d;
	segtree st; st.init(n+1);
	Dsu dsu;
	vector<int> a(n), dp(n+1, 0);
	set<int> used;
	vector<pair<int, int>> ev(n);
	for(int i=0; i<n; i++) {
		cin>>a[i];
		ev[i] = {a[i], -(i+1)};
	}
	sort(ev.begin(), ev.end());
	for(auto e : ev) {
		int v, id; tie(v, id) = e;
		id *= (-1);
		auto it = used.lower_bound(id);
		if(it != used.end()) {
			int ii = *it;
			if(abs(id-ii) <= d) dsu.unite(id, ii);
		}
		if(it != used.begin()) {
			--it; int ii = *it;
			if(abs(id-ii) <= d) dsu.unite(id, ii);
		}
		used.insert(id);
		dp[id] = st.query(dsu.getmn(id), id) + 1;
		st.set(id, dp[id]);
		debug cerr<<"dp["<<id<<"] = st.getmin("<<dsu.getmn(id)<<", "<<id<<")_+ 1 = "<<dp[id]<<"\n";
	}
	cout<<st.query(1, n)<<"\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3836 KB Output is correct
3 Correct 2 ms 3844 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3836 KB Output is correct
11 Correct 2 ms 3728 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3840 KB Output is correct
17 Correct 2 ms 3844 KB Output is correct
18 Correct 2 ms 3836 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 3 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 2 ms 3796 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3836 KB Output is correct
3 Correct 2 ms 3844 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3836 KB Output is correct
11 Correct 2 ms 3728 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3840 KB Output is correct
17 Correct 2 ms 3844 KB Output is correct
18 Correct 2 ms 3836 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 3 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 2 ms 3796 KB Output is correct
27 Correct 2 ms 3796 KB Output is correct
28 Correct 2 ms 3796 KB Output is correct
29 Correct 2 ms 3796 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 3 ms 3796 KB Output is correct
32 Correct 2 ms 3796 KB Output is correct
33 Correct 2 ms 3844 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 4 ms 3844 KB Output is correct
36 Correct 3 ms 3796 KB Output is correct
37 Correct 3 ms 3796 KB Output is correct
38 Correct 2 ms 3840 KB Output is correct
39 Correct 3 ms 3788 KB Output is correct
40 Correct 2 ms 3796 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3836 KB Output is correct
3 Correct 2 ms 3844 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3836 KB Output is correct
11 Correct 2 ms 3728 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3840 KB Output is correct
17 Correct 2 ms 3844 KB Output is correct
18 Correct 2 ms 3836 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 3 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 2 ms 3796 KB Output is correct
27 Correct 2 ms 3796 KB Output is correct
28 Correct 2 ms 3796 KB Output is correct
29 Correct 2 ms 3796 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 3 ms 3796 KB Output is correct
32 Correct 2 ms 3796 KB Output is correct
33 Correct 2 ms 3844 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 4 ms 3844 KB Output is correct
36 Correct 3 ms 3796 KB Output is correct
37 Correct 3 ms 3796 KB Output is correct
38 Correct 2 ms 3840 KB Output is correct
39 Correct 3 ms 3788 KB Output is correct
40 Correct 2 ms 3796 KB Output is correct
41 Correct 7 ms 4332 KB Output is correct
42 Correct 7 ms 4308 KB Output is correct
43 Correct 6 ms 4364 KB Output is correct
44 Correct 7 ms 4236 KB Output is correct
45 Correct 7 ms 4308 KB Output is correct
46 Correct 7 ms 4308 KB Output is correct
47 Correct 7 ms 4308 KB Output is correct
48 Correct 8 ms 4492 KB Output is correct
49 Correct 8 ms 4364 KB Output is correct
50 Correct 7 ms 4308 KB Output is correct
51 Correct 6 ms 4308 KB Output is correct
52 Correct 7 ms 4364 KB Output is correct
53 Correct 6 ms 4344 KB Output is correct
54 Correct 6 ms 4380 KB Output is correct
55 Correct 7 ms 4308 KB Output is correct
56 Correct 7 ms 4336 KB Output is correct
57 Correct 7 ms 4308 KB Output is correct
58 Correct 6 ms 4328 KB Output is correct
59 Correct 6 ms 4364 KB Output is correct
60 Correct 7 ms 4336 KB Output is correct
61 Correct 6 ms 4308 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 29608 KB Output is correct
2 Correct 198 ms 29252 KB Output is correct
3 Correct 296 ms 29520 KB Output is correct
4 Correct 409 ms 29580 KB Output is correct
5 Correct 296 ms 29704 KB Output is correct
6 Correct 409 ms 29556 KB Output is correct
7 Correct 211 ms 29388 KB Output is correct
8 Correct 191 ms 29500 KB Output is correct
9 Correct 181 ms 29652 KB Output is correct
10 Correct 166 ms 29516 KB Output is correct
11 Correct 251 ms 29528 KB Output is correct
12 Correct 259 ms 29612 KB Output is correct
13 Correct 320 ms 29620 KB Output is correct
14 Correct 384 ms 29676 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 29896 KB Output is correct
2 Correct 378 ms 29648 KB Output is correct
3 Correct 468 ms 29512 KB Output is correct
4 Correct 485 ms 29544 KB Output is correct
5 Correct 396 ms 29644 KB Output is correct
6 Correct 471 ms 29788 KB Output is correct
7 Correct 216 ms 29620 KB Output is correct
8 Correct 192 ms 29700 KB Output is correct
9 Correct 209 ms 29364 KB Output is correct
10 Correct 288 ms 29516 KB Output is correct
11 Correct 463 ms 29500 KB Output is correct
12 Correct 348 ms 29548 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3836 KB Output is correct
3 Correct 2 ms 3844 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3836 KB Output is correct
11 Correct 2 ms 3728 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3840 KB Output is correct
17 Correct 2 ms 3844 KB Output is correct
18 Correct 2 ms 3836 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 3 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Correct 2 ms 3796 KB Output is correct
27 Correct 2 ms 3796 KB Output is correct
28 Correct 2 ms 3796 KB Output is correct
29 Correct 2 ms 3796 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 3 ms 3796 KB Output is correct
32 Correct 2 ms 3796 KB Output is correct
33 Correct 2 ms 3844 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 4 ms 3844 KB Output is correct
36 Correct 3 ms 3796 KB Output is correct
37 Correct 3 ms 3796 KB Output is correct
38 Correct 2 ms 3840 KB Output is correct
39 Correct 3 ms 3788 KB Output is correct
40 Correct 2 ms 3796 KB Output is correct
41 Correct 7 ms 4332 KB Output is correct
42 Correct 7 ms 4308 KB Output is correct
43 Correct 6 ms 4364 KB Output is correct
44 Correct 7 ms 4236 KB Output is correct
45 Correct 7 ms 4308 KB Output is correct
46 Correct 7 ms 4308 KB Output is correct
47 Correct 7 ms 4308 KB Output is correct
48 Correct 8 ms 4492 KB Output is correct
49 Correct 8 ms 4364 KB Output is correct
50 Correct 7 ms 4308 KB Output is correct
51 Correct 6 ms 4308 KB Output is correct
52 Correct 7 ms 4364 KB Output is correct
53 Correct 6 ms 4344 KB Output is correct
54 Correct 6 ms 4380 KB Output is correct
55 Correct 7 ms 4308 KB Output is correct
56 Correct 7 ms 4336 KB Output is correct
57 Correct 7 ms 4308 KB Output is correct
58 Correct 6 ms 4328 KB Output is correct
59 Correct 6 ms 4364 KB Output is correct
60 Correct 7 ms 4336 KB Output is correct
61 Correct 6 ms 4308 KB Output is correct
62 Correct 199 ms 29608 KB Output is correct
63 Correct 198 ms 29252 KB Output is correct
64 Correct 296 ms 29520 KB Output is correct
65 Correct 409 ms 29580 KB Output is correct
66 Correct 296 ms 29704 KB Output is correct
67 Correct 409 ms 29556 KB Output is correct
68 Correct 211 ms 29388 KB Output is correct
69 Correct 191 ms 29500 KB Output is correct
70 Correct 181 ms 29652 KB Output is correct
71 Correct 166 ms 29516 KB Output is correct
72 Correct 251 ms 29528 KB Output is correct
73 Correct 259 ms 29612 KB Output is correct
74 Correct 320 ms 29620 KB Output is correct
75 Correct 384 ms 29676 KB Output is correct
76 Correct 201 ms 29896 KB Output is correct
77 Correct 378 ms 29648 KB Output is correct
78 Correct 468 ms 29512 KB Output is correct
79 Correct 485 ms 29544 KB Output is correct
80 Correct 396 ms 29644 KB Output is correct
81 Correct 471 ms 29788 KB Output is correct
82 Correct 216 ms 29620 KB Output is correct
83 Correct 192 ms 29700 KB Output is correct
84 Correct 209 ms 29364 KB Output is correct
85 Correct 288 ms 29516 KB Output is correct
86 Correct 463 ms 29500 KB Output is correct
87 Correct 348 ms 29548 KB Output is correct
88 Correct 382 ms 29620 KB Output is correct
89 Correct 419 ms 29660 KB Output is correct
90 Correct 499 ms 29564 KB Output is correct
91 Correct 481 ms 29684 KB Output is correct
92 Correct 313 ms 29652 KB Output is correct
93 Correct 471 ms 29632 KB Output is correct
94 Correct 491 ms 29580 KB Output is correct
95 Correct 360 ms 29644 KB Output is correct
96 Correct 409 ms 29624 KB Output is correct
97 Correct 471 ms 29612 KB Output is correct
98 Correct 476 ms 29708 KB Output is correct
99 Correct 469 ms 29544 KB Output is correct
100 Correct 485 ms 29764 KB Output is correct
101 Correct 192 ms 29528 KB Output is correct
102 Correct 210 ms 29548 KB Output is correct
103 Correct 227 ms 29584 KB Output is correct
104 Correct 260 ms 29524 KB Output is correct
105 Correct 321 ms 29516 KB Output is correct
106 Correct 246 ms 29524 KB Output is correct
107 Correct 291 ms 29616 KB Output is correct
108 Correct 424 ms 29776 KB Output is correct
109 Correct 267 ms 29608 KB Output is correct
110 Correct 439 ms 29520 KB Output is correct
111 Correct 469 ms 29620 KB Output is correct
112 Correct 284 ms 29564 KB Output is correct
113 Correct 410 ms 29520 KB Output is correct
114 Correct 438 ms 29528 KB Output is correct
115 Correct 244 ms 29520 KB Output is correct
116 Correct 237 ms 29652 KB Output is correct
117 Correct 288 ms 29532 KB Output is correct
118 Correct 282 ms 29640 KB Output is correct
119 Correct 239 ms 29528 KB Output is correct
120 Correct 252 ms 29536 KB Output is correct