oj.uz

Submission #920436

# Submission time Handle Problem Language Result Execution time Memory
920436 2024-02-02T14:38:28 Z KiaRez Financial Report (JOI21_financial) C++17
100 / 100
 842 ms 45768 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef __int128 ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 19;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

struct node {
	int mx, pref, suff, res, sz;
	node() {
		mx = pref = suff = res = sz = 0;
	}
} seg[4*N];

int n, d, a[N], ans;
vector<int> comp, vec[N];

node merge(node x, node y) {
	x.mx = max(x.mx, y.mx);
	x.res = max({x.res, y.res, x.suff+y.pref});
	(x.pref == x.sz) && (x.pref += y.pref);
	(y.suff == y.sz) && (y.suff += x.suff);
	x.suff = y.suff;
	x.sz += y.sz;
	return x;
}

void update(int ind, int mx) {
	if(ind == 0) return;
	if(ind >= (1<<lg)) {
		seg[ind].pref = seg[ind].suff = seg[ind].res = 0;
		seg[ind].mx = mx;
	} else {
		seg[ind] = merge(seg[2*ind], seg[2*ind+1]);
	}
	update(ind/2, mx);
}

void build(int ind) {
	if(ind >= (1<<lg)) {
		seg[ind].sz = seg[ind].pref = seg[ind].suff = seg[ind].res = 1;
		return;
	}
	build(2*ind); build(2*ind+1);
	seg[ind] = merge(seg[2*ind], seg[2*ind+1]);
}

node glob;
void query(int x, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	if(ind >= (1<<lg)) {
		node tmp = merge(seg[ind], glob);
		if(tmp.res < d) glob = tmp;
		return;
	}
	int mid = (lc+rc)/2;
	if(x >= rc) {
		if(merge(seg[2*ind+1], glob).res < d) {
			glob = merge(seg[2*ind+1], glob);
			query(x, 2*ind, lc, mid);
		} else query(x, 2*ind+1, mid, rc);
		return;
	}
	if(x>=mid) {
		query(x, 2*ind+1, mid, rc);
		if(glob.sz == x-mid+1) {
			query(x, 2*ind, lc, mid);
		}
		return;
	}
	query(x, 2*ind, lc, mid);
}

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

	cin>>n>>d;
	for(int i=1; i<=n; i++) cin>>a[i], comp.pb(a[i]);
	sort(all(comp));
	comp.resize(unique(all(comp)) - comp.begin());

	for(int i=1; i<=n; i++) {
		int ptr = lower_bound(all(comp), a[i]) - comp.begin() + 1;
		a[i] = ptr;
		vec[ptr].pb(i);
	}

	build(1);

	for(int i=1; i<=n; i++) {
		vector<int> reses;
		for(auto it : vec[i]) {
			glob = node();
			query(it-1);
			reses.pb(glob.mx+1);
		}
		for(int j=0; j<size(vec[i]); j++) {
			update(vec[i][j]+(1<<lg)-1, reses[j]);
		}
	}

	cout<<seg[1].mx<<endl;

	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32088 KB Output is correct
2 Correct 18 ms 32088 KB Output is correct
3 Correct 19 ms 32088 KB Output is correct
4 Correct 19 ms 32088 KB Output is correct
5 Correct 19 ms 32088 KB Output is correct
6 Correct 18 ms 32088 KB Output is correct
7 Correct 20 ms 32344 KB Output is correct
8 Correct 20 ms 32092 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 32088 KB Output is correct
11 Correct 19 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 18 ms 32088 KB Output is correct
14 Correct 19 ms 32088 KB Output is correct
15 Correct 19 ms 32088 KB Output is correct
16 Correct 18 ms 32088 KB Output is correct
17 Correct 18 ms 32088 KB Output is correct
18 Correct 18 ms 32088 KB Output is correct
19 Correct 18 ms 32088 KB Output is correct
20 Correct 19 ms 32348 KB Output is correct
21 Correct 19 ms 32124 KB Output is correct
22 Correct 18 ms 32088 KB Output is correct
23 Correct 18 ms 32344 KB Output is correct
24 Correct 18 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 18 ms 32088 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32088 KB Output is correct
2 Correct 18 ms 32088 KB Output is correct
3 Correct 19 ms 32088 KB Output is correct
4 Correct 19 ms 32088 KB Output is correct
5 Correct 19 ms 32088 KB Output is correct
6 Correct 18 ms 32088 KB Output is correct
7 Correct 20 ms 32344 KB Output is correct
8 Correct 20 ms 32092 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 32088 KB Output is correct
11 Correct 19 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 18 ms 32088 KB Output is correct
14 Correct 19 ms 32088 KB Output is correct
15 Correct 19 ms 32088 KB Output is correct
16 Correct 18 ms 32088 KB Output is correct
17 Correct 18 ms 32088 KB Output is correct
18 Correct 18 ms 32088 KB Output is correct
19 Correct 18 ms 32088 KB Output is correct
20 Correct 19 ms 32348 KB Output is correct
21 Correct 19 ms 32124 KB Output is correct
22 Correct 18 ms 32088 KB Output is correct
23 Correct 18 ms 32344 KB Output is correct
24 Correct 18 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 18 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32176 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 19 ms 32088 KB Output is correct
31 Correct 19 ms 32088 KB Output is correct
32 Correct 18 ms 32088 KB Output is correct
33 Correct 19 ms 32288 KB Output is correct
34 Correct 19 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 19 ms 32336 KB Output is correct
37 Correct 19 ms 32172 KB Output is correct
38 Correct 18 ms 32088 KB Output is correct
39 Correct 19 ms 32088 KB Output is correct
40 Correct 18 ms 32088 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32088 KB Output is correct
2 Correct 18 ms 32088 KB Output is correct
3 Correct 19 ms 32088 KB Output is correct
4 Correct 19 ms 32088 KB Output is correct
5 Correct 19 ms 32088 KB Output is correct
6 Correct 18 ms 32088 KB Output is correct
7 Correct 20 ms 32344 KB Output is correct
8 Correct 20 ms 32092 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 32088 KB Output is correct
11 Correct 19 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 18 ms 32088 KB Output is correct
14 Correct 19 ms 32088 KB Output is correct
15 Correct 19 ms 32088 KB Output is correct
16 Correct 18 ms 32088 KB Output is correct
17 Correct 18 ms 32088 KB Output is correct
18 Correct 18 ms 32088 KB Output is correct
19 Correct 18 ms 32088 KB Output is correct
20 Correct 19 ms 32348 KB Output is correct
21 Correct 19 ms 32124 KB Output is correct
22 Correct 18 ms 32088 KB Output is correct
23 Correct 18 ms 32344 KB Output is correct
24 Correct 18 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 18 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32176 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 19 ms 32088 KB Output is correct
31 Correct 19 ms 32088 KB Output is correct
32 Correct 18 ms 32088 KB Output is correct
33 Correct 19 ms 32288 KB Output is correct
34 Correct 19 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 19 ms 32336 KB Output is correct
37 Correct 19 ms 32172 KB Output is correct
38 Correct 18 ms 32088 KB Output is correct
39 Correct 19 ms 32088 KB Output is correct
40 Correct 18 ms 32088 KB Output is correct
41 Correct 23 ms 32088 KB Output is correct
42 Correct 24 ms 32344 KB Output is correct
43 Correct 23 ms 32088 KB Output is correct
44 Correct 26 ms 32088 KB Output is correct
45 Correct 27 ms 32088 KB Output is correct
46 Correct 28 ms 32412 KB Output is correct
47 Correct 26 ms 32344 KB Output is correct
48 Correct 26 ms 32344 KB Output is correct
49 Correct 28 ms 32344 KB Output is correct
50 Correct 29 ms 32344 KB Output is correct
51 Correct 24 ms 32344 KB Output is correct
52 Correct 24 ms 32344 KB Output is correct
53 Correct 28 ms 32344 KB Output is correct
54 Correct 27 ms 32344 KB Output is correct
55 Correct 28 ms 32344 KB Output is correct
56 Correct 29 ms 32344 KB Output is correct
57 Correct 28 ms 32344 KB Output is correct
58 Correct 28 ms 32436 KB Output is correct
59 Correct 27 ms 32344 KB Output is correct
60 Correct 28 ms 32344 KB Output is correct
61 Correct 28 ms 32388 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 37444 KB Output is correct
2 Correct 173 ms 35272 KB Output is correct
3 Correct 218 ms 35012 KB Output is correct
4 Correct 375 ms 41168 KB Output is correct
5 Correct 317 ms 42692 KB Output is correct
6 Correct 381 ms 42688 KB Output is correct
7 Correct 620 ms 42404 KB Output is correct
8 Correct 177 ms 45508 KB Output is correct
9 Correct 483 ms 45508 KB Output is correct
10 Correct 183 ms 45512 KB Output is correct
11 Correct 263 ms 45508 KB Output is correct
12 Correct 274 ms 45508 KB Output is correct
13 Correct 410 ms 45508 KB Output is correct
14 Correct 306 ms 45508 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 596 ms 37444 KB Output is correct
2 Correct 623 ms 37572 KB Output is correct
3 Correct 701 ms 38088 KB Output is correct
4 Correct 812 ms 45508 KB Output is correct
5 Correct 777 ms 45512 KB Output is correct
6 Correct 812 ms 45560 KB Output is correct
7 Correct 613 ms 45512 KB Output is correct
8 Correct 623 ms 45576 KB Output is correct
9 Correct 634 ms 45508 KB Output is correct
10 Correct 698 ms 45512 KB Output is correct
11 Correct 753 ms 45504 KB Output is correct
12 Correct 702 ms 45508 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32088 KB Output is correct
2 Correct 18 ms 32088 KB Output is correct
3 Correct 19 ms 32088 KB Output is correct
4 Correct 19 ms 32088 KB Output is correct
5 Correct 19 ms 32088 KB Output is correct
6 Correct 18 ms 32088 KB Output is correct
7 Correct 20 ms 32344 KB Output is correct
8 Correct 20 ms 32092 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 32088 KB Output is correct
11 Correct 19 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 18 ms 32088 KB Output is correct
14 Correct 19 ms 32088 KB Output is correct
15 Correct 19 ms 32088 KB Output is correct
16 Correct 18 ms 32088 KB Output is correct
17 Correct 18 ms 32088 KB Output is correct
18 Correct 18 ms 32088 KB Output is correct
19 Correct 18 ms 32088 KB Output is correct
20 Correct 19 ms 32348 KB Output is correct
21 Correct 19 ms 32124 KB Output is correct
22 Correct 18 ms 32088 KB Output is correct
23 Correct 18 ms 32344 KB Output is correct
24 Correct 18 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 18 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32176 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 19 ms 32088 KB Output is correct
31 Correct 19 ms 32088 KB Output is correct
32 Correct 18 ms 32088 KB Output is correct
33 Correct 19 ms 32288 KB Output is correct
34 Correct 19 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 19 ms 32336 KB Output is correct
37 Correct 19 ms 32172 KB Output is correct
38 Correct 18 ms 32088 KB Output is correct
39 Correct 19 ms 32088 KB Output is correct
40 Correct 18 ms 32088 KB Output is correct
41 Correct 23 ms 32088 KB Output is correct
42 Correct 24 ms 32344 KB Output is correct
43 Correct 23 ms 32088 KB Output is correct
44 Correct 26 ms 32088 KB Output is correct
45 Correct 27 ms 32088 KB Output is correct
46 Correct 28 ms 32412 KB Output is correct
47 Correct 26 ms 32344 KB Output is correct
48 Correct 26 ms 32344 KB Output is correct
49 Correct 28 ms 32344 KB Output is correct
50 Correct 29 ms 32344 KB Output is correct
51 Correct 24 ms 32344 KB Output is correct
52 Correct 24 ms 32344 KB Output is correct
53 Correct 28 ms 32344 KB Output is correct
54 Correct 27 ms 32344 KB Output is correct
55 Correct 28 ms 32344 KB Output is correct
56 Correct 29 ms 32344 KB Output is correct
57 Correct 28 ms 32344 KB Output is correct
58 Correct 28 ms 32436 KB Output is correct
59 Correct 27 ms 32344 KB Output is correct
60 Correct 28 ms 32344 KB Output is correct
61 Correct 28 ms 32388 KB Output is correct
62 Correct 151 ms 37444 KB Output is correct
63 Correct 173 ms 35272 KB Output is correct
64 Correct 218 ms 35012 KB Output is correct
65 Correct 375 ms 41168 KB Output is correct
66 Correct 317 ms 42692 KB Output is correct
67 Correct 381 ms 42688 KB Output is correct
68 Correct 620 ms 42404 KB Output is correct
69 Correct 177 ms 45508 KB Output is correct
70 Correct 483 ms 45508 KB Output is correct
71 Correct 183 ms 45512 KB Output is correct
72 Correct 263 ms 45508 KB Output is correct
73 Correct 274 ms 45508 KB Output is correct
74 Correct 410 ms 45508 KB Output is correct
75 Correct 306 ms 45508 KB Output is correct
76 Correct 596 ms 37444 KB Output is correct
77 Correct 623 ms 37572 KB Output is correct
78 Correct 701 ms 38088 KB Output is correct
79 Correct 812 ms 45508 KB Output is correct
80 Correct 777 ms 45512 KB Output is correct
81 Correct 812 ms 45560 KB Output is correct
82 Correct 613 ms 45512 KB Output is correct
83 Correct 623 ms 45576 KB Output is correct
84 Correct 634 ms 45508 KB Output is correct
85 Correct 698 ms 45512 KB Output is correct
86 Correct 753 ms 45504 KB Output is correct
87 Correct 702 ms 45508 KB Output is correct
88 Correct 261 ms 37824 KB Output is correct
89 Correct 420 ms 45068 KB Output is correct
90 Correct 493 ms 38852 KB Output is correct
91 Correct 821 ms 45456 KB Output is correct
92 Correct 650 ms 38084 KB Output is correct
93 Correct 687 ms 38084 KB Output is correct
94 Correct 764 ms 42948 KB Output is correct
95 Correct 348 ms 45580 KB Output is correct
96 Correct 574 ms 45764 KB Output is correct
97 Correct 680 ms 45768 KB Output is correct
98 Correct 758 ms 45584 KB Output is correct
99 Correct 842 ms 45464 KB Output is correct
100 Correct 804 ms 45508 KB Output is correct
101 Correct 523 ms 45508 KB Output is correct
102 Correct 651 ms 45508 KB Output is correct
103 Correct 681 ms 45408 KB Output is correct
104 Correct 696 ms 45508 KB Output is correct
105 Correct 718 ms 45508 KB Output is correct
106 Correct 440 ms 45420 KB Output is correct
107 Correct 592 ms 45508 KB Output is correct
108 Correct 730 ms 45508 KB Output is correct
109 Correct 451 ms 45508 KB Output is correct
110 Correct 643 ms 45508 KB Output is correct
111 Correct 741 ms 45512 KB Output is correct
112 Correct 668 ms 45540 KB Output is correct
113 Correct 784 ms 45508 KB Output is correct
114 Correct 820 ms 45508 KB Output is correct
115 Correct 617 ms 45548 KB Output is correct
116 Correct 619 ms 45508 KB Output is correct
117 Correct 664 ms 45512 KB Output is correct
118 Correct 676 ms 45508 KB Output is correct
119 Correct 710 ms 45508 KB Output is correct
120 Correct 700 ms 45416 KB Output is correct