QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #369667 | #8224. Caught in the Middle | -Ofast | 0 | 1ms | 3588kb | C++14 | 572b | 2024-03-28 16:08:29 | 2024-03-28 16:08:29 |
answer
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fir first
#define sec second
#define ll long long
using namespace std;
const int N=1e6+10;
int T,n;
string s;
void solve(){
cin>>n>>s;s=" "+s;
int L=-1,R=-1;
for(int i=1;i<=n;i++){
if(s[i]=='L'){
L=i;break;
}
}
for(int i=n;i>=1;i--){
if(s[i]=='R'){
R=i;break;
}
}
if(L!=(n-R+1)||L==1||R==n){
cout<<"Alice\n";
}else cout<<"Bob\n";
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>T;
while(T--)solve();
return 0;
}
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: 3540kb
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: 0ms
memory: 3588kb
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'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
0%