QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#601865	#8512. Harmonic Operations	Forever_Young^#	WA	1ms	6000kb	C++23	1.5kb	2024-09-30 14:54:01	2024-09-30 14:54:01

Judging History

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

[2024-09-30 14:54:01]
评测

测评结果：WA
用时：1ms
内存：6000kb

查看

[2024-09-30 14:54:01]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=int(2e5)+10;
int nxt[N],pos=-1;
void kmp(int n,char*a,int m,char*b){
	int i,j;
	for(nxt[0]=j=(-1),i=1;i<n;nxt[i++]=j){
		while(~j&&a[j+1]!=a[i])j=nxt[j];
		if(a[j+1]==a[i])j++; 
	}
	for(j=-1,i=0;i<m;i++){ 
		while(~j&&a[j+1]!=b[i])j=nxt[j]; 
		if(a[j+1]==b[i])j++;
		if(j==n-1)
        {
            pos=i;
            break;
        }
	} 
}
char s[N],t[N<<1];
int cnt[2][N],n,len,k;
int main()
{
    scanf("%s",s);
    n=strlen(s);
    for(int i=0;i<n;i++)t[i]=s[n-i-1];
    for(int i=n;i<2*n;i++)t[i]=t[i-n];
    kmp(n,s,2*n,t);
    if(n%(n-(nxt[n-1]+1))==0)len=n-(nxt[n-1]+1);else len=n;
    if(pos!=-1)pos=pos-n+1,pos%=len;
    scanf("%d",&k);
    cnt[0][0]++;
    int nowi=0,now=0;
    LL ans=0;
    rep(i,k)
    {
        scanf("%s",s);
        if(s[0]=='L'||s[0]=='R')
        {
            int x;scanf("%d",&x);
            if(s[0]=='R')x=n-x;
            if(nowi)x=n-x;
            now=(now+x)%len;
        }
        else nowi=!nowi;
        ans+=cnt[nowi][now];
        if(pos!=-1)
        {
            int aim=pos;
            if(!nowi)pos=len-pos;
            aim=(now-aim+len)%len;
            ans+=cnt[!nowi][aim];
        }
        cnt[nowi][now]++;
    }
    printf("%lld\n",ans);
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3928kb

input:

pda
2
R 2
L 2

output:

result:

ok 1 number(s): "1"

Test #2:

score: 0

Accepted

time: 1ms

memory: 5820kb

input:

aaa
4
R 1
I
I
R 1

output:

result:

ok 1 number(s): "10"

Test #3:

score: 0

Accepted

time: 0ms

memory: 3960kb

input:

caso
6
L 1
I
I
R 1
I
I

output:

result:

ok 1 number(s): "4"

Test #4:

score: 0

Accepted

time: 0ms

memory: 3796kb

input:

qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq
100
L 12
I
R 47
L 54
I
I
R 80
L 86
L 19
R 5
L 53
L 40
R 20
L 11
R 40
I
I
R 66
R 6
L 76
L 93
R 39
I
I
L 24
R 59
R 99
L 52
I
I
R 77
L 11
R 60
L 16
I
L 40
I
R 35
L 64
R 11
L 34
I
R 35
I
L 87
I
I
L 42
L ...

output:

result:

ok 1 number(s): "5050"

Test #5:

score: 0

Accepted

time: 1ms

memory: 6000kb

input:

wewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewewe
100
R 83
R 34
I
I
R 87
R 74
L 98
I
L 77
L 8
R 23
L 94
I
I
L 79
L 87
L 47
L 85
L 49
L 7
I
I
R 97
R 15
I
R 66
L 8
R 62
R 68
I
I
R 32
R 24
R 36
L 60
R 75
R 77
I
L 42
I
L 61
I
I
R 78
R 51
L 98
I
L 77
I
I...

output:

result:

ok 1 number(s): "2556"

Test #6:

score: 0

Accepted

time: 0ms

memory: 3820kb

input:

rtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtrtr
100
R 27
R 68
I
L 29
L 51
L 19
L 12
L 10
L 52
L 38
L 17
R 30
L 29
L 51
L 17
R 29
I
R 96
R 50
R 56
I
I
I
L 73
L 15
I
R 1
R 81
L 94
R 27
R 52
R 57
R 44
I
I
L 53
I
R 87
L 39
L 25
I
I
R 25
I
I
I
L 88
L ...

output:

result:

ok 1 number(s): "116"

Test #7:

score: 0

Accepted

time: 1ms

memory: 5996kb

input:

tcldtcldtcldtcldtcldtcldtcldtcldtcld
100
L 20
I
I
I
L 20
R 13
L 16
L 19
R 10
I
I
I
L 11
R 30
R 30
I
L 35
I
L 28
R 23
R 24
L 20
R 15
I
I
L 13
I
R 1
I
R 6
I
I
L 22
I
L 22
R 22
L 30
L 30
I
I
I
R 35
I
R 3
L 1
R 4
I
R 11
R 2
R 21
R 15
I
R 5
L 2
L 4
L 7
L 19
L 29
R 8
I
L 24
I
I
I
L 29
I
R 35
R 32
I
R 14
L...

output:

result:

ok 1 number(s): "703"

Test #8:

score: 0

Accepted

time: 0ms

memory: 3924kb

input:

wflbkhwflbkhwflbkhwflbkhwflbkhwflbkh
100
I
R 28
R 13
R 7
R 29
I
I
I
R 25
R 10
R 23
I
R 26
I
I
L 18
I
R 18
L 6
I
I
R 8
R 8
I
R 6
L 16
I
R 2
R 17
L 31
R 31
L 22
R 26
L 21
L 20
R 10
L 13
R 33
R 13
R 35
R 22
L 2
L 4
R 19
L 32
L 25
I
L 31
R 10
R 17
R 15
L 6
L 9
R 31
R 20
I
I
R 4
I
L 30
L 30
L 2
R 18
R 35...

output:

result:

ok 1 number(s): "442"

Test #9:

score: 0

Accepted

time: 0ms

memory: 3908kb

input:

mzgaokjwpmzgaokjwpmzgaokjwpmzgaokjwp
100
R 10
I
L 24
L 8
I
L 19
L 25
I
I
R 27
R 24
I
I
L 16
I
I
L 35
R 14
I
L 23
R 17
R 16
R 4
R 4
L 29
I
R 11
R 9
R 15
I
L 18
I
I
L 25
R 13
L 24
I
I
L 8
I
I
I
I
L 24
I
I
L 19
L 23
I
L 20
R 35
L 31
I
I
R 27
I
I
I
L 35
R 16
L 10
R 28
R 14
I
I
R 30
R 18
L 16
L 6
L 12
R ...

output:

result:

ok 1 number(s): "280"

Test #10:

score: 0

Accepted

time: 0ms

memory: 3912kb

input:

gtvcymjngzntgtvcymjngzntgtvcymjngznt
100
L 33
L 5
R 31
R 18
I
R 14
R 9
L 1
I
R 1
R 15
L 15
I
I
I
L 13
R 7
I
I
L 2
I
L 3
I
L 19
L 22
L 2
R 32
I
L 1
R 24
R 23
I
R 25
L 11
R 34
R 25
I
L 25
R 22
R 34
I
I
L 2
R 13
L 3
I
L 30
I
R 7
R 20
I
R 24
L 34
R 23
I
L 26
R 22
I
I
I
R 17
I
I
L 14
R 27
R 35
I
L 34
L 3...

output:

result:

ok 1 number(s): "206"

Test #11:

score: 0

Accepted

time: 1ms

memory: 5852kb

input:

dvaauyemcqhrmduoumdvaauyemcqhrmduoum
100
L 21
R 12
R 30
L 13
I
I
L 1
L 31
R 4
L 20
I
L 6
I
L 29
R 19
L 12
R 25
R 25
I
R 21
I
L 12
L 25
R 35
L 8
R 7
R 29
I
R 4
L 24
R 29
I
I
I
L 12
L 24
R 19
L 33
L 4
I
R 35
I
R 16
I
R 10
I
R 18
R 7
L 33
I
I
R 22
L 16
L 7
L 20
R 32
I
I
R 27
I
L 9
R 16
I
I
R 32
I
R 1
L...

output:

result:

ok 1 number(s): "180"

Test #12:

score: -100

Wrong Answer

time: 1ms

memory: 5964kb

input:

pkmsckbnjeeojagpdtfxlmlgofbrygcuqiahynrwooxgdruurdgxoowrnyhaiqucgyrbfoglmlxftdpgajoeejnbkcsmkplhxxhl
100
L 14
R 54
L 88
L 66
L 38
R 91
I
I
I
I
R 56
L 4
L 76
R 12
L 86
I
I
I
I
R 52
L 98
L 98
L 39
R 60
L 14
R 23
R 92
R 99
L 71
I
I
I
I
L 1
R 33
I
R 65
L 72
I
I
I
R 20
R 48
L 81
L 7
I
R 72
R 14
I
I
R 10
...

output:

result:

wrong answer 1st numbers differ - expected: '75', found: '70'