QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #322624 | #8224. Caught in the Middle | _ZMF_ | 0 | 1ms | 7760kb | C++11 | 1.3kb | 2024-02-07 12:34:42 | 2024-02-07 12:34:42 |
answer
/*
60 + 0 + 100 + 64 = 224.
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
int sum = 0, nega = 1;
char ch = getchar();
while (ch > '9'||ch < '0')
{
if (ch == '-') nega = -1;
ch = getchar();
}
while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
return sum * nega;
}
const int N = 1e6 + 9, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
char s[N];
int n, T, m, a[N], cn1, b[N];
inline void solve()
{
n = read(); cn1 = 0;
scanf("%s", s + 1);
if(s[1] == 'L' || s[n] == 'R') {puts("Alice"); return ;}
L(i, 1, n) cn1 += (s[i] == 'L');
int nw = 1; m = 0;
L(i, 2, n)
{
if(s[i] != s[i - 1]) a[++m] = nw, nw = 1;
else nw++;
}
a[++m] = nw;
if(cn1 != n / 2 || n % 2 != 0) {puts("Alice"); return ;}
L(i, 1, m / 2) b[i] = a[i * 2 - 1] - a[i * 2];
L(i, 2, m / 2)
if(b[i] > b[i - 1]) {puts("Alice"); return ;}
puts("Bob");
return ;
}
signed main()
{
T = read();
L(i, 1, 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: 5712kb
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: 7760kb
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: 1ms
memory: 5904kb
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: 1ms
memory: 7756kb
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: -23
Wrong Answer
time: 1ms
memory: 5912kb
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 Alice Bob Bob Alice Bob Alice Bob Bob Alice Alice Bob Bob Bob Alice Alice Alice Bob Bob
result:
wrong answer 2nd lines differ - expected: 'Bob', found: 'Alice'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
0%