QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #668030 | #464. 前缀函数 / KMP | include_c | WA | 5ms | 4328kb | C++14 | 463b | 2024-10-23 10:47:24 | 2024-10-23 10:47:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=1e5+5;
int n;string s;
int pi[N];
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>s;
rep(i,1,(int)s.size()-1){
int j=pi[i-1];
while(j>0&&s[j]!=s[i])j=pi[j-1];
if(s[j]==s[i])j++;
pi[i]=j;printf("%d ",pi[i]);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 5ms
memory: 4328kb
input:
mencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimen...
output:
0 0 0 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 0 0 0 0 0 0 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...
result:
wrong answer 5th numbers differ - expected: '0', found: '1'