QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #685041 | #8287. Caught in the Middle | Joyeuse_Ordre# | WA | 0ms | 1508kb | C++14 | 454b | 2024-10-28 17:16:28 | 2024-10-28 17:16:29 |
Judging History
answer
#include<cstdio>
const int MAXN = 1e6 + 5;
char S[MAXN];
void solve(){
int n; scanf("%d", &n);
for(int i=1;i<=n;i++) scanf("\n%c",S+i);
S[n+1] = '\0';
int begin = 1, end = n, totL = 0, totR = 0;
while(S[begin] == 'R') ++begin, ++totL;
while(S[end] == 'L') --end, ++totR;
puts(totL != totR || totL + totR == 0 ? "Alice" : "Bob");
}
int main(){
int T; scanf("%d", &T);
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1508kb
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 Alice
result:
ok 20 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 1448kb
input:
20 7 LRLLRRR 8 LRLRLRRR 3 RLL 10 RLRLRLRLRL 10 RLRLRLRLRL 6 RLLLRL 10 RLRLRLRLLL 5 RLRRR 2 LL 10 RRRRLRLRLL 7 LLRRLLR 3 LRR 10 RRRRRLLLLL 10 RLRRRLRLRR 2 LR 6 RRLLLL 4 RRLR 10 LRLRLLRLRR 4 LRLL 10 RRLLRRRLLL
output:
Alice Alice Alice Bob Bob Bob Alice Alice Alice Alice Alice Alice Bob Alice Alice Alice Alice Alice Alice Alice
result:
wrong answer 6th lines differ - expected: 'Alice', found: 'Bob'