Submission #1032705

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032705		vjudge1	Kamenčići (COCI21_kamencici)	C++17	70 / 70	97 ms	172116 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int N = 355;
int n, k, dp[N][N][N];
string s;

int main(){
    cin >> n >> k >> s;
    for (int len = 1; len <= n; len ++){
        for (int l = 0; l < n; l ++){
            int r = l + len - 1;

            int total = 0;
            for (int i = 0; i < l; i ++)
                total += (s[i] == 'C');
            for (int i = r + 1; i < n; i ++)
                total += (s[i] == 'C');

            for (int c = 0; c <= total; c ++){
                int o = total - c;
                if (c >= k) dp[l][r][c] = 0;
                else if (o >= k) dp[l][r][c] = 1;
                else{
                    if (len == 1){
                        dp[l][r][c] = 0;
                        continue;
                    }
                    dp[l][r][c] = (!dp[l + 1][r][o] or !dp[l][r - 1][o]);
                }
            }
        }
    }

    cout << (dp[0][n - 1][0] ? "DA" : "NE") << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 40 / 40