Submission #705711

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
705711	2023-03-05T02:59:01 Z	Mathandski	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	79 ms	6836 KB

triusis

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define is insert
#define ll long long
#define f0r(i, begin, n) for (ll i = begin; i < n; i ++)
#define len(x) x.length()
#define sz(x) x.size()
#include <bits/stdc++.h>
using namespace std;

int main () {
	ifstream fin; ofstream fout;
	fin.open("cowjog.in"); fout.open("cowjog.out");

	ll N, M; cin >> N >> M;
	vector<ll> lis = {0};
	f0r (i, 1, N + 1) {
		ll a; cin >> a;
		a -= M * i;
		lis.pb(-a);
	}
	
	vector<ll> dp;
	for (ll i : lis) {
		if(i < 0) {
			continue;
		}
		ll pos = upper_bound(dp.begin(), dp.end(), i) - dp.begin();
		if (pos == dp.size()) {
			// we can have a new, longer increasing subsequence!
			dp.push_back(i);
		} else {
			// oh ok, at least we can make the ending element smaller
			dp[pos] = i;
		}
	}
	cout << N - dp.size() + 1 << endl;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:30:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   if (pos == dp.size()) {
      |       ~~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	312 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	312 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	304 KB	Output is correct
13	Correct	1 ms	212 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	212 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	312 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	312 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	304 KB	Output is correct
13	Correct	1 ms	212 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	212 KB	Output is correct
17	Correct	0 ms	308 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	340 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	2 ms	468 KB	Output is correct
27	Correct	2 ms	340 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	2 ms	448 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	324 KB	Output is correct
33	Correct	2 ms	340 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	308 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	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	2 ms	340 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	2 ms	468 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	448 KB	Output is correct
15	Correct	2 ms	340 KB	Output is correct
16	Correct	2 ms	324 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	0 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	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	312 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	304 KB	Output is correct
30	Correct	1 ms	212 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	212 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	3 ms	468 KB	Output is correct
37	Correct	2 ms	468 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	2 ms	456 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	2 ms	340 KB	Output is correct
43	Correct	2 ms	340 KB	Output is correct

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	3 ms	468 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	2 ms	456 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	0 ms	308 KB	Output is correct
12	Correct	1 ms	212 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	468 KB	Output is correct
16	Correct	2 ms	340 KB	Output is correct
17	Correct	2 ms	468 KB	Output is correct
18	Correct	2 ms	468 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	2 ms	468 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	2 ms	468 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	448 KB	Output is correct
25	Correct	2 ms	340 KB	Output is correct
26	Correct	2 ms	324 KB	Output is correct
27	Correct	2 ms	340 KB	Output is correct
28	Correct	0 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	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	312 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	1 ms	312 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	304 KB	Output is correct
40	Correct	1 ms	212 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	212 KB	Output is correct
44	Correct	39 ms	5232 KB	Output is correct
45	Correct	76 ms	3956 KB	Output is correct
46	Correct	79 ms	3908 KB	Output is correct
47	Correct	77 ms	3892 KB	Output is correct
48	Correct	55 ms	5872 KB	Output is correct
49	Correct	56 ms	6168 KB	Output is correct
50	Correct	77 ms	5572 KB	Output is correct
51	Correct	76 ms	6836 KB	Output is correct
52	Correct	49 ms	4564 KB	Output is correct
53	Correct	55 ms	3440 KB	Output is correct
54	Correct	51 ms	5916 KB	Output is correct
55	Correct	55 ms	5992 KB	Output is correct

Submission #705711

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