Pagini recente » Cod sursa (job #2045791) | Cod sursa (job #3206031) | Cod sursa (job #711344) | Cod sursa (job #1783340) | Cod sursa (job #2757047)
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
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
const long double PI = acos(-1);
class KMP
{
const string pattern;
vector<int> p;
void build(const string& pattern)
{
p[0] = 0;
for (int i = 1, len = 0; i < pattern.size(); p[i] = len, i++)
{
while (len != 0 && pattern[i] != pattern[len]) len = p[len - 1];
if (pattern[i] == pattern[len]) len++;
}
}
public:
KMP(const string& pattern) : p(pattern.size()), pattern(pattern)
{
build(pattern);
}
vector<int> run(const string& text) const
{
vector<int> idxs;
for (int i = 0, j = 0; i < text.size(); i++)
{
while (j != 0 && text[i] != pattern[j]) j = p[j - 1];
if (text[i] == pattern[j]) j++;
if (j == pattern.size()) idxs.push_back(i - j + 1), j = p[j - 1];
}
return idxs;
}
};
int main()
{
ios::sync_with_stdio(false);
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
string s, t;
cin >> s >> t;
KMP k(s);
vector<int> v = k.run(t);
cout << v.size() << '\n';
for (auto i : v)
{
cout<<i<<" ";
}
return 0;
}