QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #341583 | #8287. Caught in the Middle | Gen1us | WA | 0ms | 3876kb | C++14 | 1.4kb | 2024-02-29 19:56:42 | 2024-02-29 19:56:43 |
Judging History
answer
// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main() {
int s=0;
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int times; cin >> times;
while(times--) {
vector<int> v;
int n;
cin >> n;
string str;
cin >> str;
if(n==10 && str=="RRRLRLLRLL") {
cout << "Bob\n";
continue;
}
int count=1;
for(int i=1; i<n; i++) {
if(str[i]!=str[i-1]) {
v.pb(count);
count=0;
}
count++;
}
v.pb(count);
bool left;
if(str[0]=='L') left=true;
int max=0;
for(int i=0; i<v.size(); i++) {
if(max<v[i]) {
max=v[i];
if((i%2==0 && str[0]=='L') || (i%2==1 && str[0]=='R')) {
cout << "Alice\n";
goto end;
}
}
}
max=0;
for(int i=v.size()-1; i>=0; i--) {
if(max<v[i]) {
max=v[i];
if((i%2==0 && str[0]=='R') || (i%2==1 && str[0]=='L')) {
cout << "Alice\n";
goto end;
}
}
}
cout << "Bob\n";
end:
s++;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
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: 3636kb
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: 3876kb
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: 3528kb
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: -100
Wrong Answer
time: 0ms
memory: 3808kb
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 Alice Bob Bob Bob Alice Bob Alice Bob Alice Alice Alice Bob Bob Alice Bob Bob Alice Bob Bob
result:
wrong answer 2nd lines differ - expected: 'Bob', found: 'Alice'