답안 #396970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396970	2021-05-01T03:32:50 Z	huukhang	Rabbit Carrot (LMIO19_triusis)	C++11	100 / 100	36 ms	4672 KB

triusis

// - Only when necessary :d
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fileopen(a, b) freopen(((string)a + ".inp").c_str(), "r", stdin); freopen(((string)b + ".out").c_str(), "w", stdout); 

#define ll long long
// #define int long long
#define fi first
#define se second
#define pb push_back
#define pob pop_back
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll mod = 1e9 + 7;
const ll inf = 1e9 + 7;
const double eps = 1e-9;

int n, k;
int a[200005];
vector<int> lis;
int dp[200005];

void solve() {
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		if (k*i - a[i] >= 0) lis.pb(k*i - a[i]);
	}
	int n2 = lis.size();

	dp[0] = -inf;
	for (int i = 1; i <= n2; ++i) dp[i] = inf;

	for (int i = 0; i < n2; ++i) {
		int idx = upper_bound(dp + 1, dp + n2 + 1, lis[i]) - dp;
		if (dp[idx - 1] <= lis[i]) dp[idx] = lis[i];
	}

	for (int i = n2; i >= 0; --i) {
		if (dp[i] != inf) {
			cout << n - i;
			return;
		}
	}
}

signed main() {
	#ifdef khangorz
		fileopen("input", "output");
	#endif
	#ifndef khangorz
//		fileopen("LAH", "LAH");
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
	return 0;
}

Subtask #1

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct

Subtask #2

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	2 ms	332 KB	Output is correct
33	Correct	1 ms	372 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	1 ms	372 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	2 ms	332 KB	Output is correct
38	Correct	2 ms	332 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	2 ms	332 KB	Output is correct
43	Correct	2 ms	332 KB	Output is correct

Subtask #4

37.0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	2 ms	332 KB	Output is correct
6	Correct	2 ms	460 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	1 ms	372 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	300 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	26 ms	3140 KB	Output is correct
45	Correct	24 ms	3100 KB	Output is correct
46	Correct	32 ms	3816 KB	Output is correct
47	Correct	32 ms	3856 KB	Output is correct
48	Correct	29 ms	3708 KB	Output is correct
49	Correct	31 ms	3872 KB	Output is correct
50	Correct	33 ms	4296 KB	Output is correct
51	Correct	36 ms	4672 KB	Output is correct
52	Correct	29 ms	3600 KB	Output is correct
53	Correct	19 ms	2316 KB	Output is correct
54	Correct	31 ms	3784 KB	Output is correct
55	Correct	31 ms	3860 KB	Output is correct