답안 #857722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
857722	2023-10-06T16:51:39 Z	DP_196	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	25 ms	5700 KB

triusis

#include <bits/stdc++.h>

using namespace std;

#define int int64_t
#define sz(x) (int)x.size()
#define MASK(i) ((1LL) << (i))
#define all(x) x.begin(), x.end()
#define BIT(x, i) ((x) >> (i) & (1LL))
#define dbg(...) cerr << "#" << __LINE__ << ":[" << #__VA_ARGS__ \
<< "] = [" ,DBG(__VA_ARGS__)

string to_string(const string& s) { return '"' + s + '"'; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << to_string(h); if(sizeof...(t)) cerr << ", "; DBG(t...);
}

template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b, 1) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b, 1) : 0); }

const int MAXN = 2e5 + 6;
const int INF = 1e18;
const int MOD = 1e9 + 7;

int n, lim, a[MAXN], b[MAXN], res, cnt;

void solve() {
    cin >> n >> lim;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        int x = i * lim - a[i];
        if (x >= 0) b[++cnt] = x;
    }

    for (int i = 1; i <= cnt; i++) {
        int p = upper_bound(b + 1, b + res + 1, b[i]) - b;
        maximize(res, p);
        b[p] = b[i];
    }

    cout << n - res;
}

#define TASK ""
int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    int ntest = 1;
    //cin >> ntest;
    while (ntest--) solve();

    return 0;
}
//612

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2484 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2464 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2524 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2484 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2464 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2524 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	0 ms	2396 KB	Output is correct
28	Correct	0 ms	2396 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	0 ms	2396 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct
33	Correct	0 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2568 KB	Output is correct
38	Correct	1 ms	2572 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2392 KB	Output is correct
41	Correct	1 ms	2524 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct

Subtask #4
37.0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2568 KB	Output is correct
5	Correct	1 ms	2572 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2524 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2484 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2464 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2524 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	0 ms	2396 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	0 ms	2396 KB	Output is correct
31	Correct	0 ms	2396 KB	Output is correct
32	Correct	0 ms	2396 KB	Output is correct
33	Correct	0 ms	2396 KB	Output is correct
34	Correct	0 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	0 ms	2396 KB	Output is correct
38	Correct	0 ms	2396 KB	Output is correct
39	Correct	0 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	0 ms	2396 KB	Output is correct
42	Correct	1 ms	2392 KB	Output is correct
43	Correct	0 ms	2396 KB	Output is correct
44	Correct	14 ms	3932 KB	Output is correct
45	Correct	19 ms	5212 KB	Output is correct
46	Correct	25 ms	5700 KB	Output is correct
47	Correct	21 ms	5340 KB	Output is correct
48	Correct	15 ms	4504 KB	Output is correct
49	Correct	16 ms	4700 KB	Output is correct
50	Correct	19 ms	5496 KB	Output is correct
51	Correct	20 ms	5660 KB	Output is correct
52	Correct	16 ms	4400 KB	Output is correct
53	Correct	12 ms	4444 KB	Output is correct
54	Correct	17 ms	4432 KB	Output is correct
55	Correct	19 ms	4844 KB	Output is correct

답안 #857722

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 37.0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
37.0 / 37.0