QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#793463 | #464. 前缀函数 / KMP | Sin_Watt | WA | 0ms | 3688kb | C++14 | 814b | 2024-11-29 20:08:37 | 2024-11-29 20:08:43 |
Judging History
answer
#include <bits/stdc++.h>
typedef long long lnt;
using namespace std;
const int N = 1e5 + 7;
int n;
char s[N];
int ne[N];
void INIT() { }
void WORK() {
cin >> (s + 1);
n = strlen(s + 1);
for (int i = 2, j = 0; i <= n; ++ i) {
while (j && s[j + 1] != s[i]) j = ne[j];
if (s[j + 1] == s[i]) ++ j;
ne[i] = j;
}
for (int i = 1; i <= n; ++ i) {
cout << ne[i] << ' ';
}
cout << '\n';
}
//#define filename ""
int main() {
#ifdef filename
freopen(filename ".in", "r", stdin);
freopen(filename ".out", "w", stdout);
#endif
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(0);
int Turn = 1;
cin >> Turn;
INIT();
while (Turn -- ) {
WORK();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3688kb
input:
mencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimencimencimencimencimenciyvdfitnmencimencimencimen...
output:
result:
wrong answer Answer contains longer sequence [length = 100000], but output contains 0 elements