Cod sursa(job #2566285)

Utilizator viftode4Iftode Vlad viftode4 Data 2 martie 2020 20:17:29
Problema Potrivirea sirurilor Scor 18
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.41 kb
#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
ifstream fin( "strmatch.in" );
ofstream fout( "strmatch.out" );
void fast()
{
    cin.tie( 0 );
    ios_base::sync_with_stdio( 0 );
}
vector<int>sol;
string a, b;
int lps[2000005];
void calc_lps( string x )
{
    int len = 0;
    int n = x.size();

    for( int i = 1; i < n; i++ )
        {
            while( x[i] != x[len] && len )
                len = lps[len - 1];

            if( x[len] == x[i] )
                len++;

            lps[i] = len;
        }
}
int main()
{
    fast();
    fin >> a >> b;
    calc_lps( a );

//    for( int i = 0; i < a.size(); i++ )
//        fout << lps[i] << ' ';
//
//    fout << endl;
    int len = 0;
    int n = b.size();

    for( int i = 0; i < n; i++ )
        {
            while( a[len] != b[i] && len )
                len = lps[len - 1];

            if( a[len] == b[i] )
                len++;

            if( len == a.size() )
                {
                    len = lps[len - 1];

                    if( sol.size() < 1000 )
                        sol.pb( i - len - 1 );
                }
        }

    fout << min( 1000, ( int )( sol.size() ) ) << '\n';

    for( int i = 0; i < min( 1000, ( int )( sol.size() ) ); i++ )
        fout << sol[i] << ' ';

    return 0;
}