QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #358406 | #8287. Caught in the Middle | PPP# | WA | 1ms | 3832kb | C++14 | 731b | 2024-03-19 19:40:43 | 2024-03-19 19:40:43 |
Judging History
answer
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define X first
#define Y second
const ll mod = 1000000007;
//const ll mod = 998244353;
void solve()
{
int n;
cin >> n;
string s;
cin >> s;
if (s[0]=='L' or s[n-1]=='R')
{
cout << "Alice\n";
return;
}
int D0 = 0, D1 = 0;
for (int i=0;i<n;i++)
{
if (s[i]=='L') D0++;
else D1++;
}
if (D0==D1) cout << "Bob\n";
else cout << "Alice\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll T;
T = 1;
cin >> T;
while (T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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: 0
Accepted
time: 1ms
memory: 3648kb
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 Alice Alice Alice Alice Alice Alice Alice Bob Alice Alice Alice Alice Alice Alice Bob
result:
ok 20 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
20 8 LLLRRRRR 10 LRRRLRLLRL 10 RLRLRLRLRL 6 RRLRRL 10 RLLLLRLLRR 2 RR 8 LLRRRLRL 10 LRLRLRRRRR 4 RRLL 5 LLRLL 10 RLRRLLRLRL 1 R 10 RLLRRLRLLL 10 LLLRLLRLRR 10 LRRLRLLRRR 3 RRL 10 RRRLRLLRLL 1 L 3 RRL 5 LRRLL
output:
Alice Alice Bob Alice Alice Alice Alice Alice Bob Alice Bob Alice Alice Alice Alice Alice Bob Alice Alice Alice
result:
ok 20 lines
Test #4:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
20 6 RLRLLL 2 RL 10 LRRRLRLRLR 7 LLLRRRR 3 RRR 3 LRL 10 LRLRRLLLLR 10 RRLLLLRLLR 5 LLLLL 10 RLRLLRLRLR 8 RRLRLRLL 9 RRLRLRRLR 8 RLRLRLRL 1 R 10 RRLRLRRRLL 3 LLL 1 L 6 LLLRLL 10 RLRLRLRRLL 3 LRL
output:
Alice Bob Alice Alice Alice Alice Alice Alice Alice Alice Bob Alice Bob Alice Alice Alice Alice Alice Bob Alice
result:
ok 20 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
20 4 RLRL 10 RRRLLRLLRL 10 RLRRLRLRLL 4 RLRL 4 RLRL 2 LR 2 RL 1 R 6 RRLRLL 10 RRRLRRLLLL 1 L 10 RLLRRRLLLL 2 RL 8 RRRRLLLL 10 RRLRRRLLLL 10 RLRRLRLRLL 10 RRLLRRLRLL 1 L 4 RLRL 4 RLRL
output:
Bob Bob Bob Bob Bob Alice Bob Alice Bob Bob Alice Alice Bob Bob Bob Bob Bob Alice Bob Bob
result:
ok 20 lines
Test #6:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
20 10 RRLLRLRRLL 4 RLRL 10 RRLLRLRLRL 1 L 2 LR 3 LLR 10 RLRRLRRLLL 10 RRLLRRLLRL 3 RRL 10 RRLRLLRRLL 1 L 10 RRRLLRLLRL 8 RLRLRRLL 10 RRLRLRLRLL 8 RRLLRRLL 3 RLL 4 RLRL 2 LR 10 RRRLLLRLRL 10 RRLRRRLLLL
output:
Bob Bob Bob Alice Alice Alice Bob Bob Alice Bob Alice Bob Bob Bob Bob Alice Bob Alice Bob Bob
result:
ok 20 lines
Test #7:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
20 1 L 4 RRLL 10 RLRRRRLLLL 10 RRLLRRRLLL 4 RLRL 3 LRR 3 RRR 1 R 4 RRLL 10 RLRLRLRLRL 10 RRRLLRRLLL 8 RRRLLRLL 10 RLRLRRLRLL 8 RRLLRLRL 4 RRLL 10 RRLLRRRLLL 1 L 8 RLRRLRLL 8 RRLLRRLL 6 RLRRLL
output:
Alice Bob Bob Bob Bob Alice Alice Alice Bob Bob Bob Bob Bob Bob Bob Bob Alice Bob Bob Bob
result:
ok 20 lines
Test #8:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
20 8 RRRLLLRL 4 RLRL 4 RLRL 10 RRRLLRLRLL 10 RLRLRLRLRL 4 RRLL 8 RRRRLLLL 6 RRLRLL 8 RRRLRLLL 10 RRRRLRLLLL 6 RLRRLL 6 RRLRLL 10 RRRLRRLLLL 8 RLRRLLRL 6 RRRLLL 4 RLRL 4 RLRL 6 RRLLRL 4 RLRL 1 L
output:
Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Alice
result:
ok 20 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
20 10 RRRRRLLLLL 1 L 8 RRRRLLLL 3 LRR 4 RLLL 10 RRLRRLLRLL 10 RRRRLLLRLL 1 R 2 LL 6 RRRLLL 3 RRR 10 RRRRRLLLLL 1 R 10 RRRLRRLLLL 8 RRRRLLLL 4 RRLL 10 RRRRRLLLLL 4 RRLL 8 RRRRLLLL 10 RRRRRLLLLL
output:
Bob Alice Bob Alice Alice Bob Bob Alice Alice Bob Alice Bob Alice Bob Bob Bob Bob Bob Bob Bob
result:
ok 20 lines
Test #10:
score: 0
Accepted
time: 0ms
memory: 3452kb
input:
20 6 RLRLRL 2 RL 10 RLRLRLRLRL 10 RLRLRLRLRL 4 RLRL 8 RLRLRLRL 1 L 8 RLLRLLRR 6 RRLRLL 8 RLRRLLRL 10 RLRLRRLLRL 10 RLRLRLRLRL 10 RLRLRLRRLL 6 RLRLRL 8 RLRLRRLL 6 RLRLRL 6 RLRLRL 8 RLRLRLRL 10 RRRLRLLRLL 2 RL
output:
Bob Bob Bob Bob Bob Bob Alice Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob
result:
ok 20 lines
Test #11:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
20 3 LRR 1 R 8 RRLLRLRL 10 LLLRRRLRLR 4 RLRL 1 L 10 RRLLRLRLRL 4 RLRL 3 LLL 10 RRLRLRLRLL 6 RRLLRL 2 LL 4 RLRL 10 RLRLRLRLRL 8 RLRLRLRL 6 RLRLRL 10 RLRRLLRLRL 10 RRRRLLRLLL 10 RLRLRLRLRL 8 RLRLRLRL
output:
Alice Alice Bob Alice Bob Alice Bob Bob Alice Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob
result:
ok 20 lines
Test #12:
score: -100
Wrong Answer
time: 0ms
memory: 3648kb
input:
1 478 RLRLRLRRLRLLRRLLRLRRLLRRRLLLRLRLRRLLRRRRLLLLRRRLLRLLRRLRLLRRLLRLRLRRLLRLRRLRLLRLRLRRLLRLRLRRLLRLRRRRLLLLRLRLRRLLRLRRRLLLRRRRLLLLRLRLRLRLRRRLLLRLRLRLRRRRLLLLRRLRLRLLRLRLLRRRRRLLLLRLRLRLRLRRLLRRRRLLLLRRLLRLRLRLRLRLRLRLRLRLRLRRLLRLRLRRRLLLRLRRRLLRLLRLRLRRLRLLRRRLRLLLRLRRLLRLRLRRLRLLRLRLRLRLRLRLRL...
output:
Bob
result:
wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'