Pagini recente » Cod sursa (job #2842107) | Cod sursa (job #148282) | Cod sursa (job #1850323) | Cod sursa (job #2321212) | Cod sursa (job #3291859)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char s[2000009], t[2000009];
int lps[2000009];
int ans[2000009];
int main ()
{
int cnt=0;
f.getline (s+1, sizeof(s));
f.getline (t+1, sizeof(t));
int l1=strlen (s+1);
for (int i=2; i<=l1; i++)
{
int x=lps[i-1];
while (x>0 && s[i]!=s[x+1])
x=lps[x];
if (s[i]==s[x]) x++;
lps[i]=x;
//if (s[i]==s[x+1]) lps[i]=x+1;
}
int j=0, i=1;
int l2=strlen(t+1);
while (i<=l2)
{
while (j<l1 && s[j+1]==t[i])
i++, j++;
if (j==l1)
{
int poz=i-l1-1;
ans[++cnt]=poz;
j=0;
i=i-l1+1;
continue;
}
if (s[j+1]!=t[i])
{
if (j)
j=lps[j];
else
i++;
}
}
g << cnt<< '\n';
for (int i=1; i<=min (cnt, 1000); i++)
g << ans[i] << ' ';
}