QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#847654#9925. LR StringJ_R_XWA 28ms7828kbC++141.8kb2025-01-08 09:12:052025-01-08 09:12:13

Judging History

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

  • [2025-01-08 09:12:13]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:7828kb
  • [2025-01-08 09:12:05]
  • 提交

answer

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

const int maxn=5e5+5;

char s[maxn], t[maxn];
int s1[maxn], s2[maxn];

void solve() {
    cin>>s+1;
    int n=strlen(s+1);
    int cl=0, cr=0, tot=0;
    for(int i=1;i<=n;i++) {
        if(s[i]=='R') {
            if(!cr) cl++;
            else {
                s1[++tot]=cl, s2[tot]=cr;
                cl=1, cr=0;
            }
        }else cr++;
    }
    s1[++tot]=cl, s2[tot]=cr;
    int q; cin>>q;
    while(q--) {
        cin>>t+1;
        int m=strlen(t+1);
        int cr=0;
        int sum=0, sum2=0, pos=1, flag=0;
        for(int i=1;i<=m;i++) {
            if(t[i]=='R') {
                if(!cr) {
                    if(!sum) {
                        if(pos==tot+1||s1[pos]==0) {
                            flag=1;
                            break;
                        }
                        sum=s1[pos], sum2=s2[pos];
                        ++pos;
                    }
                }else {
                    if(pos==tot+1||s1[pos]==0) {
                        flag=1;
                        break;
                    }
                    sum=s1[pos], sum2=s2[pos];
                    ++pos;
                }
                cr=0;
                sum--;
            }else {
                cr++;
                if(!sum2) {
                    if(pos==tot+1||s2[pos]==0) {
                        flag=1;
                        break;
                    }
                    sum=0, sum2=s2[pos];
                    pos++;
                }
                sum2--;
            }
        }
        if(flag) cout<<"NO\n";
        else cout<<"YES\n";
    }
    return ;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t; cin>>t;
    while(t--) solve();
    return 0;
}

详细

Test #1:

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

input:

2
RRLLRRLL
4
LLLLL
LLR
LRLR
R
RLLLLLL
3
LLLLL
RL
RRL

output:

NO
YES
NO
YES
YES
YES
NO

result:

ok 7 lines

Test #2:

score: -100
Wrong Answer
time: 28ms
memory: 5744kb

input:

100000
RRLLR
4
R
R
R
R
LRLLL
6
R
L
L
L
L
R
RLLRR
1
L
LRLLL
3
R
L
L
RLRRL
2
LRRRR
RRRL
LRLRR
2
L
R
RRLRL
4
RLRLR
RLLL
LR
RLL
RLRLL
8
R
R
R
L
L
L
R
L
RLLRR
7
R
LL
RL
R
L
L
L
LLRLR
2
L
R
RRRRL
1
RLLLR
RRLLL
2
L
L
RLLRL
1
RLLRL
LRLLL
5
RLRLL
RLLLR
RRRRL
LLRRR
RLLRR
LRLLL
3
RRLL
R
RL
LLRRL
3
L
R
LLLRR
RR...

output:

YES
YES
YES
YES
NO
YES
YES
YES
YES
NO
YES
NO
YES
YES
NO
YES
YES
NO
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
NO
NO
YES
YES
YES...

result:

wrong answer 11th lines differ - expected: 'NO', found: 'YES'