Submission #947381

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
947381	2024-03-16T04:56:00 Z	oblantis	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	226 ms	23992 KB

triusis

//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxn = 2e5 + 12;
int tr[maxn * 4], it, x;
void upd(int v, int l, int r){
	if(l + 1 == r){
		tr[v] = x;
		return;
	}
	if((l + r) / 2 <= it)upd(v * 2 + 2, (l + r) / 2, r);
	else upd(v * 2 + 1, l, (l + r) / 2);
	tr[v] = max(tr[v * 2 + 1], tr[v * 2 + 2]);
}
int get(int v, int l, int r){
	if(r - 1 <= it)return tr[v];
	if(it < l)return 0;
	return max(get(v * 2 + 1, l, (l + r) / 2), get(v * 2 + 2, (l + r) / 2, r));
}
void solve() {
	int n, k, cnt = 0;
	cin >> n >> k;
	int a[n];
	set<int> s;
	map<int, int> m;
	s.insert(0);
	for(int i = 0; i < n; i++){
		cin >> a[i];
		a[i] = a[i] - (i + 1) * k;
		s.insert(a[i]);
	}
	for(auto i : s)m[i] = cnt++;
	for(int i = n - 1; i >= 0; i--){
		a[i] = m[a[i]];
		it = a[i];
		x = get(0, 0, cnt) + 1;
		upd(0, 0, cnt);
	}
	it = m[0];
	cout << n - get(0, 0, cnt);
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	376 KB	Output is correct
13	Correct	0 ms	432 KB	Output is correct
14	Correct	0 ms	472 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	376 KB	Output is correct
13	Correct	0 ms	432 KB	Output is correct
14	Correct	0 ms	472 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	468 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	860 KB	Output is correct
21	Correct	2 ms	860 KB	Output is correct
22	Correct	3 ms	604 KB	Output is correct
23	Correct	3 ms	860 KB	Output is correct
24	Correct	3 ms	856 KB	Output is correct
25	Correct	3 ms	860 KB	Output is correct
26	Correct	2 ms	860 KB	Output is correct
27	Correct	1 ms	480 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	2 ms	600 KB	Output is correct
32	Correct	3 ms	860 KB	Output is correct
33	Correct	3 ms	860 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	2 ms	860 KB	Output is correct
5	Correct	2 ms	860 KB	Output is correct
6	Correct	3 ms	604 KB	Output is correct
7	Correct	3 ms	860 KB	Output is correct
8	Correct	3 ms	856 KB	Output is correct
9	Correct	3 ms	860 KB	Output is correct
10	Correct	2 ms	860 KB	Output is correct
11	Correct	1 ms	480 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	860 KB	Output is correct
14	Correct	3 ms	860 KB	Output is correct
15	Correct	2 ms	600 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	3 ms	860 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	468 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	376 KB	Output is correct
30	Correct	0 ms	432 KB	Output is correct
31	Correct	0 ms	472 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	3 ms	856 KB	Output is correct
35	Correct	3 ms	924 KB	Output is correct
36	Correct	3 ms	860 KB	Output is correct
37	Correct	3 ms	860 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	3 ms	860 KB	Output is correct
43	Correct	2 ms	860 KB	Output is correct

Subtask #4

37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	856 KB	Output is correct
2	Correct	3 ms	924 KB	Output is correct
3	Correct	3 ms	860 KB	Output is correct
4	Correct	3 ms	860 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	3 ms	860 KB	Output is correct
10	Correct	2 ms	860 KB	Output is correct
11	Correct	0 ms	468 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	2 ms	860 KB	Output is correct
15	Correct	2 ms	860 KB	Output is correct
16	Correct	3 ms	604 KB	Output is correct
17	Correct	3 ms	860 KB	Output is correct
18	Correct	3 ms	856 KB	Output is correct
19	Correct	3 ms	860 KB	Output is correct
20	Correct	2 ms	860 KB	Output is correct
21	Correct	1 ms	480 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	3 ms	860 KB	Output is correct
25	Correct	2 ms	600 KB	Output is correct
26	Correct	3 ms	860 KB	Output is correct
27	Correct	3 ms	860 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	468 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	0 ms	376 KB	Output is correct
40	Correct	0 ms	432 KB	Output is correct
41	Correct	0 ms	472 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	135 ms	22232 KB	Output is correct
45	Correct	223 ms	23992 KB	Output is correct
46	Correct	216 ms	23888 KB	Output is correct
47	Correct	226 ms	23908 KB	Output is correct
48	Correct	123 ms	22388 KB	Output is correct
49	Correct	126 ms	23020 KB	Output is correct
50	Correct	22 ms	3152 KB	Output is correct
51	Correct	25 ms	3164 KB	Output is correct
52	Correct	96 ms	12372 KB	Output is correct
53	Correct	16 ms	2396 KB	Output is correct
54	Correct	132 ms	22776 KB	Output is correct
55	Correct	135 ms	22868 KB	Output is correct