oj.uz

Submission #643984

# Submission time Handle Problem Language Result Execution time Memory
643984 2022-09-23T11:41:44 Z elif Kamenčići (COCI21_kamencici) C++17
0 / 70
 79 ms 182888 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 360

int dp[N][N][N];
int red[N];
int n, k;

int f(int i, int j, int l){

	int m = red[n] - red[j] + red[i - 1] - l;
	
	if(l >= k)
		return 0;
	
	if(m >= k)
		return 1;
	
	if(dp[i][j][k] != -1)
		return dp[i][j][k];
	
	return dp[i][j][k] = !f(i + 1, j, m) || !f(i, j - 1, m);
}		

int main(){

	memset(dp, -1, sizeof(dp));

	string s;
	cin >> n >> k >> s;

	for(int i=1; i<=n; i++){
		red[i] = red[i - 1];
		if(s[i - 1] == 'C') red[i]++;
	}

	if(f(1, n, 0) == 1)
		cout << "DA" << endl;
	else cout << "NE" << endl;


	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 182888 KB Output is correct
2 Correct 72 ms 182876 KB Output is correct
3 Correct 70 ms 182772 KB Output is correct
4 Correct 75 ms 182772 KB Output is correct
5 Incorrect 72 ms 182816 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 182888 KB Output is correct
2 Correct 72 ms 182876 KB Output is correct
3 Correct 70 ms 182772 KB Output is correct
4 Correct 75 ms 182772 KB Output is correct
5 Incorrect 72 ms 182816 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 182888 KB Output is correct
2 Correct 72 ms 182876 KB Output is correct
3 Correct 70 ms 182772 KB Output is correct
4 Correct 75 ms 182772 KB Output is correct
5 Incorrect 72 ms 182816 KB Output isn't correct
6 Halted 0 ms 0 KB -