oj.uz

Submission #696701

# Submission time Handle Problem Language Result Execution time Memory
696701 2023-02-07T05:13:06 Z Alihan_8 Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 1000 ms 3796 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

    int n, M; cin >> n >> M;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    vector <int> dp(n+1);
    for ( int i = 1; i <= n; i++ ){
        if ( M*i < p[i-1] ) continue;
        dp[i] = 1;
        for ( int j = i-1; j > 0; j-- ){
            if ( p[j-1] <= M*j and p[i-1] <= p[j-1]+(i-j)*M ){
                dp[i] = max(dp[i], dp[j]+1);
            }
        }
    }
    cout << n-*max_element(all(dp));

	cout << '\n';
}

Compilation message

triusis.cpp: In function 'void IO(std::string)':
triusis.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 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 320 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 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 320 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 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 29 ms 328 KB Output is correct
21 Correct 43 ms 340 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 44 ms 400 KB Output is correct
24 Correct 46 ms 340 KB Output is correct
25 Correct 46 ms 404 KB Output is correct
26 Correct 42 ms 408 KB Output is correct
27 Correct 26 ms 420 KB Output is correct
28 Correct 43 ms 404 KB Output is correct
29 Correct 42 ms 332 KB Output is correct
30 Correct 43 ms 340 KB Output is correct
31 Correct 29 ms 460 KB Output is correct
32 Correct 43 ms 404 KB Output is correct
33 Correct 47 ms 408 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 29 ms 328 KB Output is correct
5 Correct 43 ms 340 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 44 ms 400 KB Output is correct
8 Correct 46 ms 340 KB Output is correct
9 Correct 46 ms 404 KB Output is correct
10 Correct 42 ms 408 KB Output is correct
11 Correct 26 ms 420 KB Output is correct
12 Correct 43 ms 404 KB Output is correct
13 Correct 42 ms 332 KB Output is correct
14 Correct 43 ms 340 KB Output is correct
15 Correct 29 ms 460 KB Output is correct
16 Correct 43 ms 404 KB Output is correct
17 Correct 47 ms 408 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 260 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 324 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 320 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 1 ms 332 KB Output is correct
35 Correct 1 ms 408 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 42 ms 340 KB Output is correct
38 Correct 31 ms 424 KB Output is correct
39 Correct 43 ms 420 KB Output is correct
40 Correct 29 ms 448 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 44 ms 412 KB Output is correct
43 Correct 44 ms 332 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 408 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 42 ms 340 KB Output is correct
5 Correct 31 ms 424 KB Output is correct
6 Correct 43 ms 420 KB Output is correct
7 Correct 29 ms 448 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 44 ms 412 KB Output is correct
10 Correct 44 ms 332 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 29 ms 328 KB Output is correct
15 Correct 43 ms 340 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 44 ms 400 KB Output is correct
18 Correct 46 ms 340 KB Output is correct
19 Correct 46 ms 404 KB Output is correct
20 Correct 42 ms 408 KB Output is correct
21 Correct 26 ms 420 KB Output is correct
22 Correct 43 ms 404 KB Output is correct
23 Correct 42 ms 332 KB Output is correct
24 Correct 43 ms 340 KB Output is correct
25 Correct 29 ms 460 KB Output is correct
26 Correct 43 ms 404 KB Output is correct
27 Correct 47 ms 408 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 260 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 324 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 320 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 Execution timed out 1082 ms 3796 KB Time limit exceeded
45 Halted 0 ms 0 KB -