QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #322782 | #8224. Caught in the Middle | james1BadCreeper | 0 | 0ms | 3668kb | C++14 | 592b | 2024-02-07 18:22:42 | 2024-02-07 18:22:43 |
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
char a[N];
void solve(void) {
cin >> n >> a + 1;
if (a[1] == 'L' || a[n] == 'R') return cout << "Alice\n", void();
int t = (a[2] == 'R') + (a[n - 1] == 'L');
if (t == 0) return cout << "Bob\n", void();
if (t == 1 || t == 2) return cout << "Alice\n", void();
// t == 1
// cout << "Alice\n";
// RRRRRLLLL
}
int main(void) {
ios::sync_with_stdio(0);
int T = 1; cin >> T;
while (T--) solve();
return 0;
}
/*
6
RLLLRL
*/
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3668kb
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%