Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.009 s | 2 KBi |
#8 |
Correcto
|
0.01 s | 2 KBi |
#9 |
Correcto
|
0.011 s | 2 KBi |
#10 |
Correcto
|
0.012 s | 2 KBi |
#11 |
Correcto
|
0.011 s | 2 KBi |
#12 |
Correcto
|
0.011 s | 2 KBi |
#13 |
Correcto
|
0.012 s | 2 KBi |
#14 |
Correcto
|
0.013 s | 2 KBi |
#15 |
Correcto
|
0.012 s | 2 KBi |
#16 |
Correcto
|
0.013 s | 2 KBi |
#17 |
Correcto
|
0.012 s | 2 KBi |
#18 |
Correcto
|
0.01 s | 2 KBi |
#19 |
Correcto
|
0.01 s | 2 KBi |
#20 |
Correcto
|
0.011 s | 2 KBi |
#21 |
Correcto
|
0.011 s | 2 KBi |
#22 |
Correcto
|
0.011 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int left = 0; int right = s.size(); vector<int> prefixSuffixTable(right, 0); for (int i = 1; i < right; i++) { while(left > 0 and s[left] != s[i]) { left = prefixSuffixTable[left-1]; } if (s[left] == s[i]){ left++; } prefixSuffixTable[i] = left; } cout << prefixSuffixTable[right-1] << endl; }