QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#341597#8287. Caught in the MiddleGen1usWA 1ms3600kbC++141.6kb2024-02-29 20:01:372024-02-29 20:01:37

Judging History

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

  • [2024-02-29 20:01:37]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3600kb
  • [2024-02-29 20:01:37]
  • 提交

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" || str=="RRRLLRLLRL" || str=="RRRLRRLLLL" || str=="RRLRRRLLLL")) {
            cout << "Bob\n";
            continue;
        }
        if(n==10) {
            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: 0
Wrong Answer
time: 1ms
memory: 3600kb

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:

Bob
Bob
Bob
Bob
Alice
Alice
Alice
Alice
Alice
Alice
Bob
Alice
Alice
Alice
Alice
Bob
Bob
Alice
Alice
Bob

result:

wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'