Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.008 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.008 s | 2 KBi |
#8 |
Correcto
|
0.008 s | 2 KBi |
#9 |
Correcto
|
0.01 s | 2 KBi |
#10 |
Correcto
|
0.011 s | 2 KBi |
#11 |
Incorrecto
|
0.01 s | 2 KBi |
#12 |
Correcto
|
0.008 s | 2 KBi |
#13 |
Incorrecto
|
0.01 s | 2 KBi |
#14 |
Correcto
|
0.009 s | 2 KBi |
#15 |
Correcto
|
0.008 s | 2 KBi |
#16 |
Correcto
|
0.01 s | 2 KBi |
#17 |
Correcto
|
0.01 s | 2 KBi |
#18 |
Correcto
|
0.009 s | 2 KBi |
#19 |
Incorrecto
|
0.011 s | 2 KBi |
#20 |
Correcto
|
0.009 s | 2 KBi |
#21 |
Correcto
|
0.008 s | 2 KBi |
#22 |
Correcto
|
0.009 s | 2 KBi |
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <queue> #include <set> #include <map> #include <vector> #include <stack> #include <algorithm> #define forn(a, n) for(int a = 0; a<(int) (n); ++a) #define rforn(a, n) for(int a = (n)-1; a>=0; --a) using namespace std; const int N = 6e5+20; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin>>s; vector <int> v (s.size(), 0); if(s.size() == 0 || s.size() == 1) { cout<<0<<endl; return 0; } int borde = 0; for (int i = 1; i < s.size(); i++) { if(s[i] != s[borde]) borde=0; else borde++; v[i] = borde; } /*for(int i = 0; i < s.size(); i++) cout<<v[i]<<" "; cout<<endl;*/ cout<<v[s.size()-1]<<endl; /*int lleva = 0; for(int i = 0, j = 1; j < s.size(); j++) { if(s[i] == s[j]) { for(int k = i, l = j; k < s.size()-1 && l < s.size(); k++, l++) { if(s[k] != s[l]) {lleva = 0; break;} lleva++; //cout<<lleva<<endl; } //cout<<lleva<<endl; if(lleva != 0) { cout<<lleva<<endl; return 0; } } } cout<<lleva<<endl;*/ return 0; }