oj.uz

Submission #920432

# Submission time Handle Problem Language Result Execution time Memory
920432 2024-02-02T14:33:11 Z KiaRez Financial Report (JOI21_financial) C++17
48 / 100
 4000 ms 45508 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>=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 32136 KB Output is correct
2 Correct 20 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 19 ms 32088 KB Output is correct
7 Correct 19 ms 32136 KB Output is correct
8 Correct 19 ms 32088 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 31960 KB Output is correct
11 Correct 18 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 19 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 19 ms 32088 KB Output is correct
17 Correct 19 ms 32088 KB Output is correct
18 Correct 18 ms 32344 KB Output is correct
19 Correct 19 ms 32088 KB Output is correct
20 Correct 19 ms 32088 KB Output is correct
21 Correct 19 ms 32088 KB Output is correct
22 Correct 19 ms 32088 KB Output is correct
23 Correct 19 ms 32088 KB Output is correct
24 Correct 20 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 19 ms 32088 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32136 KB Output is correct
2 Correct 20 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 19 ms 32088 KB Output is correct
7 Correct 19 ms 32136 KB Output is correct
8 Correct 19 ms 32088 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 31960 KB Output is correct
11 Correct 18 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 19 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 19 ms 32088 KB Output is correct
17 Correct 19 ms 32088 KB Output is correct
18 Correct 18 ms 32344 KB Output is correct
19 Correct 19 ms 32088 KB Output is correct
20 Correct 19 ms 32088 KB Output is correct
21 Correct 19 ms 32088 KB Output is correct
22 Correct 19 ms 32088 KB Output is correct
23 Correct 19 ms 32088 KB Output is correct
24 Correct 20 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 19 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32088 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 20 ms 32088 KB Output is correct
31 Correct 20 ms 32088 KB Output is correct
32 Correct 20 ms 32088 KB Output is correct
33 Correct 20 ms 32088 KB Output is correct
34 Correct 20 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 20 ms 32088 KB Output is correct
37 Correct 20 ms 32088 KB Output is correct
38 Correct 20 ms 32088 KB Output is correct
39 Correct 20 ms 32088 KB Output is correct
40 Correct 20 ms 32088 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32136 KB Output is correct
2 Correct 20 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 19 ms 32088 KB Output is correct
7 Correct 19 ms 32136 KB Output is correct
8 Correct 19 ms 32088 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 31960 KB Output is correct
11 Correct 18 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 19 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 19 ms 32088 KB Output is correct
17 Correct 19 ms 32088 KB Output is correct
18 Correct 18 ms 32344 KB Output is correct
19 Correct 19 ms 32088 KB Output is correct
20 Correct 19 ms 32088 KB Output is correct
21 Correct 19 ms 32088 KB Output is correct
22 Correct 19 ms 32088 KB Output is correct
23 Correct 19 ms 32088 KB Output is correct
24 Correct 20 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 19 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32088 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 20 ms 32088 KB Output is correct
31 Correct 20 ms 32088 KB Output is correct
32 Correct 20 ms 32088 KB Output is correct
33 Correct 20 ms 32088 KB Output is correct
34 Correct 20 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 20 ms 32088 KB Output is correct
37 Correct 20 ms 32088 KB Output is correct
38 Correct 20 ms 32088 KB Output is correct
39 Correct 20 ms 32088 KB Output is correct
40 Correct 20 ms 32088 KB Output is correct
41 Correct 25 ms 32088 KB Output is correct
42 Correct 36 ms 32460 KB Output is correct
43 Correct 56 ms 32336 KB Output is correct
44 Correct 200 ms 32088 KB Output is correct
45 Correct 325 ms 32344 KB Output is correct
46 Correct 370 ms 32592 KB Output is correct
47 Correct 210 ms 32344 KB Output is correct
48 Correct 171 ms 32456 KB Output is correct
49 Correct 185 ms 32344 KB Output is correct
50 Correct 283 ms 32468 KB Output is correct
51 Correct 34 ms 32344 KB Output is correct
52 Correct 44 ms 32344 KB Output is correct
53 Correct 364 ms 32336 KB Output is correct
54 Correct 370 ms 32460 KB Output is correct
55 Correct 372 ms 32456 KB Output is correct
56 Correct 359 ms 32344 KB Output is correct
57 Correct 342 ms 32592 KB Output is correct
58 Correct 368 ms 32596 KB Output is correct
59 Correct 364 ms 32344 KB Output is correct
60 Correct 356 ms 32344 KB Output is correct
61 Correct 379 ms 32452 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 37448 KB Output is correct
2 Correct 172 ms 35272 KB Output is correct
3 Correct 218 ms 35012 KB Output is correct
4 Correct 376 ms 44228 KB Output is correct
5 Correct 359 ms 45508 KB Output is correct
6 Correct 373 ms 45504 KB Output is correct
7 Execution timed out 4017 ms 45508 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4035 ms 36292 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32136 KB Output is correct
2 Correct 20 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 19 ms 32088 KB Output is correct
7 Correct 19 ms 32136 KB Output is correct
8 Correct 19 ms 32088 KB Output is correct
9 Correct 18 ms 32088 KB Output is correct
10 Correct 18 ms 31960 KB Output is correct
11 Correct 18 ms 32088 KB Output is correct
12 Correct 19 ms 32088 KB Output is correct
13 Correct 19 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 19 ms 32088 KB Output is correct
17 Correct 19 ms 32088 KB Output is correct
18 Correct 18 ms 32344 KB Output is correct
19 Correct 19 ms 32088 KB Output is correct
20 Correct 19 ms 32088 KB Output is correct
21 Correct 19 ms 32088 KB Output is correct
22 Correct 19 ms 32088 KB Output is correct
23 Correct 19 ms 32088 KB Output is correct
24 Correct 20 ms 32088 KB Output is correct
25 Correct 18 ms 32088 KB Output is correct
26 Correct 19 ms 32088 KB Output is correct
27 Correct 19 ms 32088 KB Output is correct
28 Correct 20 ms 32088 KB Output is correct
29 Correct 20 ms 32088 KB Output is correct
30 Correct 20 ms 32088 KB Output is correct
31 Correct 20 ms 32088 KB Output is correct
32 Correct 20 ms 32088 KB Output is correct
33 Correct 20 ms 32088 KB Output is correct
34 Correct 20 ms 32088 KB Output is correct
35 Correct 19 ms 32088 KB Output is correct
36 Correct 20 ms 32088 KB Output is correct
37 Correct 20 ms 32088 KB Output is correct
38 Correct 20 ms 32088 KB Output is correct
39 Correct 20 ms 32088 KB Output is correct
40 Correct 20 ms 32088 KB Output is correct
41 Correct 25 ms 32088 KB Output is correct
42 Correct 36 ms 32460 KB Output is correct
43 Correct 56 ms 32336 KB Output is correct
44 Correct 200 ms 32088 KB Output is correct
45 Correct 325 ms 32344 KB Output is correct
46 Correct 370 ms 32592 KB Output is correct
47 Correct 210 ms 32344 KB Output is correct
48 Correct 171 ms 32456 KB Output is correct
49 Correct 185 ms 32344 KB Output is correct
50 Correct 283 ms 32468 KB Output is correct
51 Correct 34 ms 32344 KB Output is correct
52 Correct 44 ms 32344 KB Output is correct
53 Correct 364 ms 32336 KB Output is correct
54 Correct 370 ms 32460 KB Output is correct
55 Correct 372 ms 32456 KB Output is correct
56 Correct 359 ms 32344 KB Output is correct
57 Correct 342 ms 32592 KB Output is correct
58 Correct 368 ms 32596 KB Output is correct
59 Correct 364 ms 32344 KB Output is correct
60 Correct 356 ms 32344 KB Output is correct
61 Correct 379 ms 32452 KB Output is correct
62 Correct 154 ms 37448 KB Output is correct
63 Correct 172 ms 35272 KB Output is correct
64 Correct 218 ms 35012 KB Output is correct
65 Correct 376 ms 44228 KB Output is correct
66 Correct 359 ms 45508 KB Output is correct
67 Correct 373 ms 45504 KB Output is correct
68 Execution timed out 4017 ms 45508 KB Time limit exceeded
69 Halted 0 ms 0 KB -