//Coded by Chirath Nirodha
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const ll mod=1e9+7;
inline void io(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n,k;
string s;
ll dp[350][350][350];
ll rec(int a,int b,int c){
if(dp[a][b][c]!=-1)return dp[a][b][c];
if(c==0){dp[a][b][c]=0;return dp[a][b][c];}
if(a==b){
if(s[a]=='C' && c==1)dp[a][b][c]=1;
else dp[a][b][c]=INT32_MAX;
return dp[a][b][c];
}
if(b-a==1){
if(s[a]=='C' && s[b]=='C' && c==1)dp[a][b][c]=1;
else dp[a][b][c]=INT32_MAX;
return dp[a][b][c];
}
ll tem;
dp[a][b][c]=INT32_MIN;
if(s[a]=='C')tem=min(rec(a+1,b-1,c-1),rec(a+2,b,c-1));
else tem=min(rec(a+1,b-1,c),rec(a+2,b,c));
dp[a][b][c]=max(dp[a][b][c],tem+1-rec(a+1,b,c));
if(s[b]=='C')tem=min(rec(a+1,b-1,c-1),rec(a,b-2,c-1));
else tem=min(rec(a+1,b-1,c),rec(a,b-2,c));
dp[a][b][c]=max(dp[a][b][c],tem+1-rec(a,b-1,c));
return dp[a][b][c];
}
void solve(){
io();
cin>>n>>k;
cin>>s;
memset(dp,-1,sizeof(dp));
if(rec(0,n-1,k)>0)cout<<"DA"<<endl;
else cout<<"NE"<<endl;
}
int main(){
io();
solve();
//int t;cin>>t;for(int i=0;i<t;i++)solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
128 ms |
335816 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
128 ms |
335816 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
128 ms |
335816 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
