█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 2274

Problema 0x43 - Encontrar el borde más largo de una string

  • Autor: Osvaldo
  • Fecha: 2020-12-07 21:47:32 UTC (Hace más de 3 años)
Caso # Resultado Tiempo Memoria
#1
Correcto
0.005 s 1 KBi
#2
Correcto
0.005 s 2 KBi
#3
Correcto
0.005 s 2 KBi
#4
Correcto
0.007 s 1 KBi
#5
Correcto
0.005 s 1 KBi
#6
Correcto
0.005 s 1 KBi
#7
Correcto
0.01 s 2 KBi
#8
Correcto
0.009 s 2 KBi
#9
Correcto
0.009 s 1 KBi
#10
Correcto
0.012 s 2 KBi
#11
Correcto
0.01 s 2 KBi
#12
Correcto
0.01 s 2 KBi
#13
Correcto
0.014 s 2 KBi
#14
Correcto
0.011 s 1 KBi
#15
Correcto
0.009 s 1 KBi
#16
Correcto
0.009 s 2 KBi
#17
Correcto
0.009 s 2 KBi
#18
Correcto
0.009 s 2 KBi
#19
Correcto
0.011 s 2 KBi
#20
Correcto
0.011 s 2 KBi
#21
Correcto
0.008 s 2 KBi
#22
Correcto
0.009 s 2 KBi
Puntos totales: 100 / 100

Código

#include <bits/stdc++.h>
#define ii              pair<int,int>
#define F               first
#define S               second
#define pb              push_back
#define all(x)          (x).begin(),(x).end()
#define rall(x)         (x).rbegin(),(x).rend()
#define fore(i, a, b)   for(int i = a; i < b; i += 1)
#define forr(i, a)      for(int i = a; i >= 0; i--)
#define sz(s)           int(s.size())
#define cls(a,car)      memset(a,car,sizeof (a))
#define db(x)           cout << #x << " is " << x << '\n'
#define angle(x)        double(x * acos(-1) / 180.0)
using namespace std;
void debug(){cout << endl;}
template<typename T, typename... Args>
void debug(T a, Args... args){cout << a << " "; debug(args...);}
typedef long long   ll;
typedef vector<int> vi;
typedef vector<ii>  vii;
const int N = 5e5 + 5;
const ll mod = 1e9 + 7;
const double E = 1e-7;
const int oo = 1e9;
vector<int> get_phi(string &p){
    int n = p.size();
    vector<int> phi(n);
    phi[0] = 0;
    for(int i = 1, j = 0; i < n; i++){
        while(j > 0 && p[i] != p[j])
            j = phi[j - 1];
        if(p[i] == p[j])
            j++;
        phi[i] = j;
    }
    return phi;
}
void solve(){
    string str;
    cin >> str;
    vector<int> phi = get_phi(str);
    cout <<  phi[sz(str) - 1] << '\n';
}
int main(){
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
       ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif

    int t = 1;
    //cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
    }

    #ifdef LOCAL
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
    return 0;
}