#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
int main(){
ll n , k , cnt=0 , j=0 ,ans=1e9;
cin >> n >> k ;
string s ; cin >> s ;
for(ll i=0 ; i<n ;i++)
{
if(s[i]=='C')cnt++;
while(cnt>k&&j<n)
{
if(cnt==k+1)ans=min(ans,i-j+1);
if(s[j]=='C')cnt--;
j++;
}
if(cnt==k&&cnt==i-j+1){
//cout<<i-j+1<<endl;
ans=min(ans,i-j+1);
}
}
//cout<<ans<<endl;
string res=((n-ans)%2)?"NE":"DA";
cout<<res<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |