Submission #581680

#	Time	Username	Problem	Language	Result	Execution time	Memory
581680		chirathnirodha	Kamenčići (COCI21_kamencici)	C++17	70 / 70	161 ms	335992 KiB

Main

//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 red[350];
void rec(int a,int b,int c){
	if(dp[a][b][c]!=-1)return;
	int x=red[n-1]-c-red[b];if(a>0)x+=red[a-1];
	if(c>=k){dp[a][b][c]=0;return;}
	if(x>=k){dp[a][b][c]=1;return;}
	if(a==b ){
		if(s[a]=='C' && c==k-1)dp[a][b][c]=0;
		else dp[a][b][c]=1;
	} 
	if(dp[a][b][c]!=-1)return;
	rec(a+1,b,x);rec(a,b-1,x);
	if(dp[a+1][b][x]==false || dp[a][b-1][x]==false)dp[a][b][c]=1;
	else dp[a][b][c]=0;
}
void solve(){
    io();
	cin>>n>>k;
	cin>>s;
	for(int i=0;i<n;i++){
		if(s[i]=='C')red[i]=1;
		else red[i]=0;
		if(i>0)red[i]+=red[i-1];
	}
	memset(dp,-1,sizeof(dp));
	rec(0,n-1,0);
	if(dp[0][n-1][0]==1)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;
}

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