QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #398501 | #8224. Caught in the Middle | New_hope | 0 | 1ms | 3580kb | C++14 | 426b | 2024-04-25 14:08:23 | 2024-04-25 14:08:23 |
answer
#include <bits/stdc++.h>
using namespace std;
int t;
void work()
{
int n;
string s;
bool f(0);
cin >> n >> s;
for (int i(1); i < n; i += 2) {
if (s[i] != 'L' || s[i - 1] != 'R') {
f = 1;
break;
}
}
if (f || n & 1) cout << "Alice\n";
else cout << "Bob\n";
}
int main()
{
cin >> t;
while (t --) work();
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: 3580kb
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 Alice Alice Alice Alice Alice Alice Bob Alice Alice Alice
result:
wrong answer 11th lines differ - expected: 'Bob', found: 'Alice'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
0%