QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#398500#8224. Caught in the MiddleNew_hope0 1ms3808kbC++14427b2024-04-25 14:06:542024-04-25 14:06:55

Judging History

你现在查看的是最新测评结果

  • [2024-04-25 14:06:55]
  • 评测
  • 测评结果:0
  • 用时:1ms
  • 内存:3808kb
  • [2024-04-25 14:06:54]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int t;
void work()
{
    int n; 
    string s;
    bool f(0);
    cin >> n >> s;
    for (int i(1); i < n; i += 2) {
        if (s[i] != 'L' || s[i - 1] != 'R') {
            f = 1;
            break;
        }
    }
    if (f || n == 1) cout << "Alice\n";
    else cout << "Bob\n";
}

int main()
{
    cin >> t;
    while (t --) work();

    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: 3808kb

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
Bob
Alice
Alice
Alice
Alice
Alice
Alice
Alice
Alice
Alice
Alice
Bob
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%