답안 #545167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545167	2022-04-03T18:01:53 Z	AA_Surely	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	43 ms	5372 KB

triusis

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 2e5 + 7;
const int ALPHA = 27;
const LL INF = 1e18 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

LL n, ns[MAXN], lis[MAXN], m;

int main() {
    IOS;
    
    cin >> n >> m;
    F0R(i, n) {
        cin >> ns[i];
        ns[i] -= m * (i + 1);
        if (ns[i] > 0) ns[i] = INF;
    }

    fill(lis + 1, lis + n + 1, INF);
    lis[0] = -INF;

    R0F(i, n) {
        int place = upper_bound(lis, lis + n, ns[i]) - lis;
        lis[place] = min(lis[place], ns[i]);
    }

    int ans = 0;
    F0R(i, n + 1) if (lis[i] != INF) ans = i;
    cout << n - ans;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
28.0 / 28.0

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

Subtask #4
37.0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	2 ms	336 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	2 ms	340 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	324 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	324 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	328 KB	Output is correct
44	Correct	23 ms	3892 KB	Output is correct
45	Correct	26 ms	5372 KB	Output is correct
46	Correct	29 ms	5308 KB	Output is correct
47	Correct	31 ms	5300 KB	Output is correct
48	Correct	24 ms	4308 KB	Output is correct
49	Correct	25 ms	4532 KB	Output is correct
50	Correct	43 ms	5324 KB	Output is correct
51	Correct	43 ms	5324 KB	Output is correct
52	Correct	23 ms	4224 KB	Output is correct
53	Correct	21 ms	4680 KB	Output is correct
54	Correct	26 ms	4456 KB	Output is correct
55	Correct	29 ms	4488 KB	Output is correct

답안 #545167

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