QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#369678 | #8224. Caught in the Middle | -Ofast | 0 | 1ms | 3580kb | C++14 | 906b | 2024-03-28 16:17:24 | 2024-03-28 16:17:32 |
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;
bool check(string s){
int L=0,R=n+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){
return false;
}else return true;
}
void solve(){
cin>>n>>s;s=" "+s;
for(int i=1;i<=n;i++){
string t;
if(s[i]=='L'){
for(int j=1;j<i;j++)
t.push_back(s[j]);
if(check(t)){
cout<<"Alice\n";
return;
}
}else{
for(int j=i+1;j<=n;j++)
t.push_back(s[j]);
if(check(t)){
cout<<"Alice\n";
return;
}
}
}
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: 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:
Bob Bob Bob Bob Alice Bob Bob Alice Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob Bob
result:
wrong answer 1st 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%