#include <bits/stdc++.h>
using namespace std;
int n, k;
int main () {
cin >> n >> k;
int c[2];
c[0] = c[1] = k;
string s;
cin >> s;
int l = 0, r = n-1;
int turn = 0;
while(l < r && c[0] > 0 && c[1] > 0) {
if(s[l] == 'P') {
l++;
}
else if(s[r] == 'P') {
r--;
}
else {
c[turn]--;
int t1, t2;
t1 = t2 = 0;
while(s[l + t1] != 'P' && (t1 + 1) < n) {
t1++;
}
while(s[r-t2]!= 'P' && (t2-1) >= 0) {
t2++;
}
if(t1 >= t2) {
l++;
}
else {
r--;
}
}
turn ^=1;
}
if(c[0] > 0) {
cout << "DA" << endl;
}
else {
cout << "NE" << endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |