QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #322781 | #8224. Caught in the Middle | james1BadCreeper | 0 | 1ms | 3736kb | C++14 | 582b | 2024-02-07 18:20:58 | 2024-02-07 18:20:58 |
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 || t == 2) return cout << "Bob\n", void();
if (t == 1) 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;
}
// RRRRRL
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 23
Accepted
time: 1ms
memory: 3696kb
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: -23
Wrong Answer
time: 1ms
memory: 3736kb
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 Bob Alice Alice Bob Alice Alice Bob Alice Alice Alice Bob
result:
wrong answer 6th 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%