QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#368309#8287. Caught in the MiddleBUET_POTATOES#WA 1ms3764kbC++171.4kb2024-03-26 23:25:142024-03-26 23:25:14

Judging History

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

  • [2024-03-26 23:25:14]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3764kb
  • [2024-03-26 23:25:14]
  • 提交

answer

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int tc;
    cin>>tc;

    for(int cs = 1; cs <= tc; cs++){
        int n;
        cin>>n;

        string s;
        cin>>s;

        if(s.front() == 'L' || s.back() == 'R') {
            cout<<"Alice\n";
            continue;
        }

        vector<int> v;

        for(int i = 0; i<s.size(); i++){
            int j = i;
            while(j+1 < s.size() && s[j+1] == s[i]) {
                j++;
            }

            v.push_back(j-i+1);
            i = j;
        }

        int l = 0, r = int (v.size()) - 1;

        bool winning = true;
        while(true){
            if((r - l + 1) % 2 == 1){
                break;
            }

            if(v[l] < v[r]){
                int x = v[l];
                while(l <= r && v[l] <= x){
                    l++;
                }
            }
            else{
                int x = v[r];
                while(l <= r && v[r] <= x){
                    r--;
                }
            }

            if(l > r){
                winning = false;
                break;
            }
        }

        if(winning){
            cout<<"Alice\n";
        }
        else{
            cout<<"Bob\n";
        }
    }

    return 0;
}

/*
3
5
LRLLR
6
RLRLRL
1
L

1
6
RLRLRL
*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3488kb

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

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

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'