oj.uz

Submission #574579

# Submission time Handle Problem Language Result Execution time Memory
574579 2022-06-08T21:31:50 Z beaboss Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

int mod = 1000000007;

typedef long long ll;

int main() {
	int n, m;
	cin >> n >> m;

	vector<int> vals(n);

	for (int i = 0; i < n; i++) {
		cin >> vals[i];
	}

	vector<int> dp(n + 1, 0);
	
    for (int i = 0; i < n; i++) {
    	
    	if (m * (i + 1) < vals[i]) continue;

    	int best = 0;
    	int best_s = 0;

    	for (int j = 0; j < i; j++) {
    		if (vals[i] > vals[j] + m * (i - j)) continue;
    		if (dp[j + 1] >= best_s) {
    			best_s = dp[j + 1];
    			best = j;
    		}
    	}

    	dp[i + 1] = 1 + dp[best + 1];
        
        
		
    }

    cout << n - dp[n] << endl;
}

Subtask #1
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 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 28.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 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.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 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -