QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #405900 | #8224. Caught in the Middle | 11d10xy | 0 | 1ms | 3676kb | C++17 | 374b | 2024-05-06 16:27:16 | 2024-05-06 16:27:17 |
answer
#include<bits/stdc++.h>
using namespace std;
#define N 1000005
int t,n,A,B;
char a[N];
int main(){
scanf("%d",&t);
while(t--){
A=B=0;
scanf("%d%s",&n,a+1);
for(int i=1;i<=n;i++){
if(a[i]=='R'&&a[i+1]=='L')i+=1;
else if(a[i]=='L')++A;
else ++B;
}
puts(!(A^B)?"Bob":"Alice");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3676kb
input:
20 10 RLRRRRLLRR 10 LRLLLLRRLR 6 RLRLRL 10 LLRLRRRRLR 6 LRRLLL 3 RLR 5 LLRRR 6 RRRRRL 9 LRRRLRRLR 1 R 10 RRRLLRRLLL 6 LRLLLR 9 LLRLRLRLR 7 RRRRLRR 2 LL 10 RRRLLRRLRR 2 RL 7 RRLRRLR 3 LLR 10 LLRLRRRLLR
output:
Alice Alice Bob Alice Alice Alice Alice Alice Alice Alice Bob Alice Alice Alice Alice Alice Bob Alice Alice Bob
result:
wrong answer 20th lines differ - expected: 'Alice', found: 'Bob'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
0%