Submission #1142256

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142256		12345678	Kamenčići (COCI21_kamencici)	C++20	70 / 70	59 ms	102984 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int nx=355;

int n, k, vs[nx][nx][nx], dp[nx][nx][nx], qs[nx];
string s;

int solve(int l, int r, int cur)
{
    if (vs[l][r][cur]) return dp[l][r][cur];
    vs[l][r][cur]=1;
    if (qs[n]-(qs[r]-qs[l-1])-cur==k) return dp[l][r][cur]=1;
    return dp[l][r][cur]=(!solve(l+1, r, qs[n]-(qs[r]-qs[l-1])-cur))||!solve(l, r-1, qs[n]-(qs[r]-qs[l-1])-cur); 
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k>>s;
    s=' '+s;
    for (int i=1; i<=n; i++) qs[i]=(s[i]=='C')+qs[i-1];
    if (solve(1, n, 0)) cout<<"DA";
    else cout<<"NE";
}

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