Submission #1096966

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1096966	2024-10-05T15:10:40 Z	andrewp	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	1000 ms	3928 KB

triusis

//Dedicated to my love, ivaziva
#pragma GCC optimize("Ofast") 
#include <bits/stdc++.h> 
using namespace std;   
 
#define int long long 
 
using pii = pair<int, int>;
using ll = int64_t;  
  
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back  
#define dbg(x) cerr<<#x<<": "<<x<<'\n';  
#define dbga(A,l_,r_){for(int i_=l_;i_<=r_;i_++)cerr<<A[i_]<<' ';cerr<<'\n';}
#define dbgv(a_){for(auto x_:a_) cerr<<x_<<' ';cerr<<'\n';}   

const int maxn = 2e5 + 10, inf = 1e9;
int n, m, a[maxn], dp[maxn];

int32_t main()  {
    ios::sync_with_stdio(false); cin.tie(nullptr);  
    cout.tie(nullptr); cerr.tie(nullptr);
    
    cin >> n >> m; 
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        dp[i] = -inf;
    }
    for (int i = 0; i <= n; i++) {
        a[i] += (n - i) * m;
    } 
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] >= a[i]) {
                dp[i] = max(dp[j] + 1, dp[i]);
            } 
        } 
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, dp[i]);
    }
    cout << n - ans << '\n';
    return 0;       
}

Subtask #1
14.0 / 14.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	468 KB	Output is correct
6	Correct	392 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	716 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	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	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	392 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	716 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	464 KB	Output is correct
20	Correct	6 ms	536 KB	Output is correct
21	Correct	9 ms	348 KB	Output is correct
22	Correct	27 ms	348 KB	Output is correct
23	Correct	9 ms	348 KB	Output is correct
24	Correct	9 ms	348 KB	Output is correct
25	Correct	9 ms	348 KB	Output is correct
26	Correct	9 ms	348 KB	Output is correct
27	Correct	11 ms	576 KB	Output is correct
28	Correct	11 ms	348 KB	Output is correct
29	Correct	10 ms	348 KB	Output is correct
30	Correct	9 ms	568 KB	Output is correct
31	Correct	9 ms	348 KB	Output is correct
32	Correct	10 ms	348 KB	Output is correct
33	Correct	11 ms	572 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	464 KB	Output is correct
4	Correct	6 ms	536 KB	Output is correct
5	Correct	9 ms	348 KB	Output is correct
6	Correct	27 ms	348 KB	Output is correct
7	Correct	9 ms	348 KB	Output is correct
8	Correct	9 ms	348 KB	Output is correct
9	Correct	9 ms	348 KB	Output is correct
10	Correct	9 ms	348 KB	Output is correct
11	Correct	11 ms	576 KB	Output is correct
12	Correct	11 ms	348 KB	Output is correct
13	Correct	10 ms	348 KB	Output is correct
14	Correct	9 ms	568 KB	Output is correct
15	Correct	9 ms	348 KB	Output is correct
16	Correct	10 ms	348 KB	Output is correct
17	Correct	11 ms	572 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 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	392 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	716 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	23 ms	604 KB	Output is correct
35	Correct	23 ms	480 KB	Output is correct
36	Correct	24 ms	344 KB	Output is correct
37	Correct	10 ms	344 KB	Output is correct
38	Correct	11 ms	588 KB	Output is correct
39	Correct	10 ms	348 KB	Output is correct
40	Correct	9 ms	472 KB	Output is correct
41	Correct	9 ms	568 KB	Output is correct
42	Correct	9 ms	348 KB	Output is correct
43	Correct	9 ms	348 KB	Output is correct

Subtask #4
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	604 KB	Output is correct
2	Correct	23 ms	480 KB	Output is correct
3	Correct	24 ms	344 KB	Output is correct
4	Correct	10 ms	344 KB	Output is correct
5	Correct	11 ms	588 KB	Output is correct
6	Correct	10 ms	348 KB	Output is correct
7	Correct	9 ms	472 KB	Output is correct
8	Correct	9 ms	568 KB	Output is correct
9	Correct	9 ms	348 KB	Output is correct
10	Correct	9 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	464 KB	Output is correct
14	Correct	6 ms	536 KB	Output is correct
15	Correct	9 ms	348 KB	Output is correct
16	Correct	27 ms	348 KB	Output is correct
17	Correct	9 ms	348 KB	Output is correct
18	Correct	9 ms	348 KB	Output is correct
19	Correct	9 ms	348 KB	Output is correct
20	Correct	9 ms	348 KB	Output is correct
21	Correct	11 ms	576 KB	Output is correct
22	Correct	11 ms	348 KB	Output is correct
23	Correct	10 ms	348 KB	Output is correct
24	Correct	9 ms	568 KB	Output is correct
25	Correct	9 ms	348 KB	Output is correct
26	Correct	10 ms	348 KB	Output is correct
27	Correct	11 ms	572 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 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	392 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	716 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Execution timed out	1034 ms	3928 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

Submission #1096966

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 37.0