Codeforces Round #578 (Div

E. Compress Words

- 给定若干个词, 求这些词拼接(中间重复的部分不要)后的字符串

>> face <<

• 前置技能
• kmp

建立答案串等于第一个词, 每次有都会从新词的某个部分接上来, 所以每次我们取答案串的最后新串长度的串作为母串和新串比较, 用kmp找到具体的位置, 然后一个一个接上去

Attention:函数中传字符串变量一定要用引用不然会出锅

#include <bits/stdc++.h>
using namespace std;

#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 1e6 + 10;
vector<string> q;
string ans, tmp;
int nxtt[maxn], n;
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
void getnxt(string &s)
{
	int j = 0;
	_for(i, 1, s.size())
	{
		while (j && s[i] != s[j])
			j = nxtt[j];
		nxtt[i + 1] = s[i] == s[j] ? ++j : 0;
	}
}
int kmp(string &bigmom, string &son, int pos)
{
	getnxt(son);
	string mom = bigmom.substr(pos, son.size());
	int j = 0;
	_for(i, 0, mom.size())
	{
		while (j && mom[i] != son[j])
			j = nxtt[j];
		if (mom[i] == son[j])
			j++;
	}
	return j;
}
void add(string fresh)
{
	int pos = kmp(ans, fresh, max(0, (int)(ans.size() - fresh.size())));
	_for(i, pos, fresh.size()) ans += fresh[i];
}
int main()
{
	n = nxt();
	_rep(i, 1, n)
	{
		cin >> tmp;
		q.emplace_back(tmp);
	}
	ans = q[0];
	_for(i, 1, n) add(q[i]);
	cout << ans;
}