Cod sursa(job #3159830)

Utilizator DenisONIcBanu Denis Andrei DenisONIc Data 22 octombrie 2023 12:08:04
Problema Potrivirea sirurilor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.86 kb
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define NMAX 2000005
const long double PI = acos(-1);

int pr[NMAX];
string A, B;

int main(){
  ios::sync_with_stdio(false);
  
  freopen("strmatch.in", "r", stdin);
  freopen("strmatch.out", "w", stdout);

  cin >> A;
  cin >> B;

  A.push_back('#');

  int k = 0;
  for (int i=1;i<A.size();i++) {
    while (k != 0 && A[k] != A[i])
      k = pr[k-1];
    if (A[k] == A[i])
      k++;
    pr[i] = k;
  }

  vector<int> ans;

  k = 0;
  for (int i=0;i<B.size();i++) {
    while (k != 0 && A[k] != B[i])
      k = pr[k-1];
    if (A[k] == B[i])
      k++;
    if (k >= A.size() - 1) {
      ans.push_back(i - (A.size() - 1) + 1);
    }
  }

  cout << ans.size() << '\n';

  for (int i=0;i<min(1000, (int)ans.size());i++) {
    cout << ans[i] << ' ';
  }
  cout << '\n';

  return 0;
}