QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #434306 | #464. 前缀函数 / KMP | ChenWenxin2009 | WA | 5ms | 4308kb | C++14 | 277b | 2024-06-08 15:34:35 | 2024-06-08 15:34:36 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
char s[100002];
int n,p[100001],j;
int main(){
scanf("%s",s+1),n=strlen(s+1),printf("0 ");
for(int i=1;i<=n;++i){
while(j&&s[j+1]!=s[i])j=p[j];
if(s[j+1]==s[i])++j;
printf("%d ",p[i]=j);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 5ms
memory: 4308kb
input:
mencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimen...
output:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 10...
result:
wrong answer 2nd numbers differ - expected: '0', found: '1'