oj.uz

Submission #752211

# Submission time Handle Problem Language Result Execution time Memory
752211 2023-06-02T13:44:53 Z hariaakas646 Kamenčići (COCI21_kamencici) C++17
0 / 70
 1 ms 308 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

int main()
{
    int n, k;
    cin >> n >> k;
    string str;
    cin >> str;

    vector<vvi> dp(n, vvi(n, vi(k + 1)));

    frange(i, n)
    {
        if (str[i] == 'C')
        {
            dp[i][i][1] = 1;
        }
        // dp[i][i][0] = 1;
    }

    forr(i, 1, n)
    {
        for (int l = 0; l + i < n; l++)
        {
            int r = l + i;
            dp[l][r][0] = 1;
            forr(j, 1, k + 1)
            {
                if (!dp[l + 1][r][j] && !dp[l][r - 1][j])
                {
                    dp[l][r][j] = 1;
                }
                else if (!dp[l + 1][r][j])
                {
                    if (str[r] == 'C')
                    {
                        if (!dp[l][r - 1][j - 1])
                        {
                            dp[l][r][j] = 1;
                        }
                    }
                }
                else if (!dp[l][r - 1][j])
                {
                    if (str[l] == 'C')
                    {
                        if (!dp[l + 1][r][j - 1])
                        {
                            dp[l][r][j] = 1;
                        }
                    }
                }
                else
                {
                    if (str[r] == 'C' && str[l] == 'C')
                    {
                        if (!dp[l + 1][r][j - 1] && !dp[l][r - 1][j - 1])
                        {
                            dp[l][r][j] = 1;
                        }
                    }
                }
            }
        }
    }

    if (dp[0][n - 1][k])
    {
        printf("NE");
    }
    else
    {
        printf("DA");
    }
}

Subtask #1
0 / 10.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 Correct 0 ms 308 KB Output is correct
5 Incorrect 0 ms 304 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.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 Correct 0 ms 308 KB Output is correct
5 Incorrect 0 ms 304 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 40.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 Correct 0 ms 308 KB Output is correct
5 Incorrect 0 ms 304 KB Output isn't correct
6 Halted 0 ms 0 KB -