Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 0 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.005 s | 0 KBi |
#7 |
Correcto
|
0.01 s | 1 KBi |
#8 |
Correcto
|
0.011 s | 1 KBi |
#9 |
Correcto
|
0.011 s | 1 KBi |
#10 |
Correcto
|
0.01 s | 1 KBi |
#11 |
Correcto
|
0.009 s | 1 KBi |
#12 |
Correcto
|
0.013 s | 1 KBi |
#13 |
Correcto
|
0.013 s | 1 KBi |
#14 |
Correcto
|
0.009 s | 1 KBi |
#15 |
Correcto
|
0.009 s | 1 KBi |
#16 |
Correcto
|
0.014 s | 1 KBi |
#17 |
Correcto
|
0.009 s | 1 KBi |
#18 |
Correcto
|
0.01 s | 1 KBi |
#19 |
Correcto
|
0.014 s | 1 KBi |
#20 |
Correcto
|
0.009 s | 1 KBi |
#21 |
Correcto
|
0.008 s | 1 KBi |
#22 |
Correcto
|
0.007 s | 1 KBi |
#include <iostream> #include <string> #include <vector> using namespace std; // Random integer in the range [0, n] size_t randomNumber(size_t n) { if (n <= 1) { return 0; } return rand() % (n+1); } int32_t kmp_lp(const std::string& input) { int32_t n = input.size(); std::vector<int32_t> lp(n, 0); for (int32_t i = 1; i < n; ++i) { int32_t j = lp[i-1]; while(j > 0 && input[i] != input[j]) { j = lp[j-1]; } if (input[i] == input[j]) { j++; } lp[i] = j; } return lp[n-1]; } int main() { std::string input; cin >> input; cout << kmp_lp(input); return 0; }