QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #402819 | #8287. Caught in the Middle | willy109 | WA | 0ms | 3648kb | C++20 | 1.6kb | 2024-05-01 15:55:32 | 2024-05-01 15:55:33 |
Judging History
answer
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second
#define ld long double
#define all(a) a.begin(),a.end()
#define int long long
#define pii pair <int,int>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
const int maxn = 4e5 + 10 , maxq = 32, inf = 1e9+10 , lg = 19 ,sq = 707 ,mod = 998244353 ;
int b[maxn] , sm[maxn] , a[maxn] , z[maxn] ,p[maxn] , sm2[maxn] ;
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T ;
cin >> T ;
while(T--){
int n;cin >> n ;
string s;
cin >> s;
s= " " + s ;
bool ok =0 ;
if(s[1] == 'L' || s[n] == 'R'){
ok = 1;
}
vector <int >vec ;
int t =1 ;
rep(i , 2 , n){
if(s[i] == s[i-1]){
t ++ ;
}else{
vec.pb(t) ;
t = 1;
}
}
vec.pb(t);
int mx =0 ;
rep(i , 0 ,sz(vec)-1){
if(vec[i] > mx && i%2==1){
ok = 1;
}
mx =max(mx ,vec[i]) ;
}
mx = 0;
per(i , sz(vec)-1 , 0){
if(vec[i] > mx && (sz(vec)-1-i)%2==1){
ok = 1;
}
mx = max(mx , vec[i]) ;
}
if(ok == 1){
cout << "Alice\n";
}else{
cout << "Bob\n";
}
}
return 0 ;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
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: 0ms
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: -100
Wrong Answer
time: 0ms
memory: 3620kb
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 Alice Alice Alice Alice
result:
wrong answer 17th lines differ - expected: 'Bob', found: 'Alice'