Submission #872195

#	Time	Username	Problem	Language	Result	Execution time	Memory
872195		Foolestboy	Kamenčići (COCI21_kamencici)	C++14	70 / 70	44 ms	175704 KiB

Main

#include <bits/stdc++.h>

#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back
#define all(x)    x.begin(), x.end()
#define rall(x)   x.rbegin(), x.rend()
#define sz(s)     (int)s.size()
#define prev      __prev
#define next      __next
#define left      __left
#define right     __right

#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class BUI, class TRONG>
    bool minimize(BUI &x, const TRONG y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class BUI, class TRONG>
    bool maximize(BUI &x, const TRONG y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */

                           /** Losing in Provincial Contests **/
                                    /** TRYING HARDER**/
                                   /**      ORZ     **/

/* -----------------[ MAIN CODE GOES HERE ]----------------- */

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 355;

int n, k;
string s;
int c[N];
int f[N][N][N];

int F(int l, int r, int picked){
    if(f[l][r][picked] != -1) return f[l][r][picked];
    int ans = 0;
    int L = picked + (s[l] == 'C'), R = picked + (s[r] == 'C');
    int e = c[l - 1] + c[n] - c[r] - picked;
    if(L < k) maximize(ans, 1 ^ F(l + 1, r, e));
    if(R < k) maximize(ans, 1 ^ F(l, r - 1, e));
    return f[l][r][picked] = ans;
}

void solve(){
    cin >> n >> k;
    cin >> s;
    s = ' ' + s;
    for(int i = 1; i <= n; i++) c[i] = c[i - 1] + (s[i] == 'C');
    memset(f, -1, sizeof f);
    cout << (F(1, n, 0) ? "DA" : "NE") << '\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;

    while( tt-- ){

        solve();

    }

    return 0;
}

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