Submission #874562

#	Time	Username	Problem	Language	Result	Execution time	Memory
874562		ngjabach	Kamenčići (COCI21_kamencici)	C++14	0 / 70	61 ms	175456 KiB

Main

// NgJaBach: Forever Meadow <3

#include<bits/stdc++.h>

using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long int ll;
typedef unsigned long long ull;
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define bend(a) a.begin(),a.end()
#define rev(x) reverse(bend(x))
#define mset(a) memset(a, 0, sizeof(a))
#define fi first
#define se second
#define gcd __gcd
#define getl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
#define endl '\n'
const int N=355,M=1000000007;
const ll INF=1e18+7;
int dp[N][N][N],pref[N],n,k;
string s;
int can_win(int L,int R,int reds){
    int &res=dp[L][R][reds];
    if(res!=-1) return res;
    if(reds>=k) return res=0;
    int other_reds=pref[n]-pref[R]+pref[L-1]-reds;
    if(other_reds>=k) return res=1;
    if(can_win(L+1,R,other_reds) or can_win(L,R-1,other_reds)) return res=1;
    return res=0;
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
//    freopen(".inp","r",stdin);
//    freopen(".out","w",stdout);
    cin>>n>>k;
    cin>>s; s="$"+s;
    pref[0]=0;
    for(int i=1;i<=n;++i) pref[i]=pref[i-1]+(s[i]=='C');
    memset(dp,-1,sizeof dp);
    if(can_win(1,n,(s[n]=='C'))) cout<<"DA";
    else cout<<"NE";
    return 0;
}
/*
==================================+
INPUT:                            |
------------------------------    |

------------------------------    |
==================================+
OUTPUT:                           |
------------------------------    |

------------------------------    |
==================================+
*/

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