Cod sursa(job #2115448)

Utilizator AlexandruRudiAlexandru Rudi AlexandruRudi Data 26 ianuarie 2018 19:33:41
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.29 kb
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005
#define x1 xdddddddddddddddddd
#define y1 ydddddddddddddddddd

string a,b;

int p[2000005];

vector <int> sol;

int main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("strmatch.in");
    ofstream cout("strmatch.out");
    cin >> a >> b;
    int j=0;
    for(int i=1;i<a.sz;i++){
        while(j>0 && a[j]!=a[i]) j=p[j];
        if(a[j]==a[i]) j++;
        p[i]=j;
    }
    j=0;
    for(int i=0;i<b.sz;i++){
        while(j>0 && b[i]!=a[j]) j=p[j-1];
        if(b[i]==a[j]) j++;
        if(j==a.sz) sol.push_back(i-a.sz+1);
    }
    cout << sol.sz << '\n';
    for(int i=0;i<min(1000,(int)sol.sz);i++){
        cout << sol[i] << ' ';
    }
}