oj.uz

Submission #522584

# Submission time Handle Problem Language Result Execution time Memory
522584 2022-02-05T08:30:42 Z ddy888 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 36 ms 5344 KB 
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

const int INF = 1e18;
int N, M, lis;
int A[200010], dp[200010];

signed main() {
    fast;
    cin >> N >> M;
    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
        A[i] -= (i * M);
    }
    A[0] = 0;
    for (int i = 0; i <= 200010; ++i) dp[i] = INF;
    for (int i = N; i >= 0; --i) {
        int p = upper_bound(dp + 1, dp + N + 2, A[i]) - dp;
        dp[p] = A[i];
        // debug(A[i], p);
        lis = p;
    }
    cout << N - lis + 1;
    return 0;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:29:45: warning: iteration 200010 invokes undefined behavior [-Waggressive-loop-optimizations]
   29 |     for (int i = 0; i <= 200010; ++i) dp[i] = INF;
      |                                       ~~~~~~^~~~~
triusis.cpp:29:23: note: within this loop
   29 |     for (int i = 0; i <= 200010; ++i) dp[i] = INF;
      |                     ~~^~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1848 KB Output is correct
2 Correct 1 ms 1860 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 1868 KB Output is correct
9 Correct 1 ms 1856 KB Output is correct
10 Correct 1 ms 1872 KB Output is correct
11 Correct 1 ms 1860 KB Output is correct
12 Correct 1 ms 1856 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1852 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1856 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1848 KB Output is correct
2 Correct 1 ms 1860 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 1868 KB Output is correct
9 Correct 1 ms 1856 KB Output is correct
10 Correct 1 ms 1872 KB Output is correct
11 Correct 1 ms 1860 KB Output is correct
12 Correct 1 ms 1856 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1852 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1856 KB Output is correct
17 Correct 1 ms 1860 KB Output is correct
18 Correct 1 ms 1868 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 1 ms 1804 KB Output is correct
21 Correct 2 ms 1868 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1864 KB Output is correct
24 Correct 2 ms 1892 KB Output is correct
25 Correct 2 ms 1872 KB Output is correct
26 Correct 2 ms 1868 KB Output is correct
27 Correct 2 ms 1868 KB Output is correct
28 Correct 2 ms 1868 KB Output is correct
29 Correct 2 ms 1868 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 2 ms 1872 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 1 ms 1872 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1860 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1804 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1864 KB Output is correct
8 Correct 2 ms 1892 KB Output is correct
9 Correct 2 ms 1872 KB Output is correct
10 Correct 2 ms 1868 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1868 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1872 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 1 ms 1872 KB Output is correct
18 Correct 1 ms 1848 KB Output is correct
19 Correct 1 ms 1860 KB Output is correct
20 Correct 1 ms 1868 KB Output is correct
21 Correct 1 ms 1868 KB Output is correct
22 Correct 1 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 2 ms 1868 KB Output is correct
26 Correct 1 ms 1856 KB Output is correct
27 Correct 1 ms 1872 KB Output is correct
28 Correct 1 ms 1860 KB Output is correct
29 Correct 1 ms 1856 KB Output is correct
30 Correct 1 ms 1868 KB Output is correct
31 Correct 1 ms 1852 KB Output is correct
32 Correct 1 ms 1868 KB Output is correct
33 Correct 1 ms 1856 KB Output is correct
34 Correct 2 ms 1864 KB Output is correct
35 Correct 2 ms 1868 KB Output is correct
36 Correct 2 ms 1868 KB Output is correct
37 Correct 2 ms 1868 KB Output is correct
38 Correct 2 ms 1868 KB Output is correct
39 Correct 2 ms 1868 KB Output is correct
40 Correct 2 ms 1864 KB Output is correct
41 Correct 3 ms 1868 KB Output is correct
42 Correct 2 ms 1900 KB Output is correct
43 Correct 2 ms 1872 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1864 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 2 ms 1868 KB Output is correct
4 Correct 2 ms 1868 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1864 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 2 ms 1872 KB Output is correct
11 Correct 1 ms 1860 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1804 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 2 ms 1864 KB Output is correct
18 Correct 2 ms 1892 KB Output is correct
19 Correct 2 ms 1872 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 1868 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1872 KB Output is correct
26 Correct 2 ms 1868 KB Output is correct
27 Correct 1 ms 1872 KB Output is correct
28 Correct 1 ms 1848 KB Output is correct
29 Correct 1 ms 1860 KB Output is correct
30 Correct 1 ms 1868 KB Output is correct
31 Correct 1 ms 1868 KB Output is correct
32 Correct 1 ms 1868 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 2 ms 1868 KB Output is correct
36 Correct 1 ms 1856 KB Output is correct
37 Correct 1 ms 1872 KB Output is correct
38 Correct 1 ms 1860 KB Output is correct
39 Correct 1 ms 1856 KB Output is correct
40 Correct 1 ms 1868 KB Output is correct
41 Correct 1 ms 1852 KB Output is correct
42 Correct 1 ms 1868 KB Output is correct
43 Correct 1 ms 1856 KB Output is correct
44 Correct 20 ms 3816 KB Output is correct
45 Correct 35 ms 5272 KB Output is correct
46 Correct 36 ms 5240 KB Output is correct
47 Correct 34 ms 5344 KB Output is correct
48 Correct 23 ms 4292 KB Output is correct
49 Correct 27 ms 4536 KB Output is correct
50 Correct 32 ms 5340 KB Output is correct
51 Correct 30 ms 5288 KB Output is correct
52 Correct 28 ms 4264 KB Output is correct
53 Correct 27 ms 4672 KB Output is correct
54 Correct 27 ms 4516 KB Output is correct
55 Correct 25 ms 4380 KB Output is correct