2016-2017 ACM-ICPC CHINA-Final F（后缀自动机）

• 求第一个字符串的子串在其他所有字符串中都没有出现过的最短子串
• sam+bfs 贪心即可

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1ll<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 5e5 + 10;
int n, m , k;
string  s;
struct node {
	int len, fa;
	int son[26];
} tr[N * 2];
int cnt = 1;
int last = 1;
int f[N * 2];
void extend (int c,int flag) {
	int p = last, np = last = ++cnt;
	f[cnt] = flag;
	tr[np].len = tr[p].len + 1;
	for(; p && !tr[p].son[c];  p = tr[p].fa) tr[p].son[c] = np;
	if(!p) tr[np].fa = 1;
	else {
		int q = tr[p].son[c];
		if(tr[q].len == tr[p].len + 1)tr[np].fa = q;
		else {
			int nq = ++cnt;
			tr[nq] = tr[q];
			tr[nq].len = tr[p].len + 1;
			tr[q].fa = tr[np].fa = nq;
			for(; p && tr[p].son[c] == q; p = tr[p].fa) tr[p].son[c] = nq;
		}
	}
}

vi g[N];
void dfs(int u) {
	for(auto v:g[u]) {
		dfs(v);
		f[u]|=f[v];
	}
}
int vis[N];
int pre[N];
char ans[N];
void dfs1(int pos) {
	if(pos==1)return ;
	dfs1(pre[pos]);
	cout<<ans[pos];
}
int id;
void sol() {
	queue<int>q;
	q.push(1);
	int pos=0;
	for(int i=1; i<=cnt; i++)vis[i]=0;
	while(!q.empty()) {
		int u=q.front();
		q.pop();
		//	de_bug(u);
		if(!f[u]) {
			pos=u;
			break;
		}
		for(int i=0; i<=25; i++) {
			//	de_bug(i);
			int v=tr[u].son[i];
			if(!v||vis[v])continue;
			vis[v]=1;
			ans[v]='a'+i;
			pre[v]=u;
			q.push(v);
		}

	}
//	de_bug(pos);
	cout<<"Case #"<<++id<<": ";
	if(!pos)cout<<"Impossible"<<endl;
	else {
		dfs1(pos);
		cout<<endl;
	}

}

void solve() {
	cin >> n;
	cin>>s;
	last=cnt=1;
	for(auto ch:s) {
		extend(ch-'a',0);
	}
	fer(i,2,n) {
		cin>>s;
		last=1;
		for(auto ch:s) {
			extend(ch-'a',1);
		}
	}
	for(int i=2; i<=cnt; i++) {
		g[tr[i].fa].push_back(i);
	}
	dfs(1);
	sol();
	fer(i,1,cnt) {
		g[i].clear();
		//	memset(tr[i],0,sizeof tr[i]);
		f[i]=0;
	}
	memset(tr,0,sizeof(tr));

}
int  main() {
	IOS;
	int _ ;
	cin>>_;
	while( _-- )
		solve();
}

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1ll<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 5e5 + 10;
int n, m , k;
string  s;
struct node {
	int len, fa;
	int son[26];
} tr[N * 2];
int cnt = 1;
int last = 1;
int f[N * 2];
void extend (int c,int flag) {
	if(tr[last].son[c]) {
		int p = last;
		int q = tr[last].son[c];
		if(tr[p].len + 1 == tr[q].len)last = q;
		else {
			int nq = last = ++cnt;
			tr[nq] = tr[q];
			tr[nq].len = tr[p].len + 1;
			tr[q].fa  = nq;
			for(; p && tr[p].son[c] == q; p = tr[p].fa) tr[p].son[c] = nq;

		}
	} else {
		int p = last, np = last = ++cnt;
		//f[cnt] = flag;
		tr[np].len = tr[p].len + 1;
		for(; p && !tr[p].son[c];  p = tr[p].fa) tr[p].son[c] = np;
		if(!p) tr[np].fa = 1;
		else {
			int q = tr[p].son[c];
			if(tr[q].len == tr[p].len + 1)tr[np].fa = q;
			else {
				int nq = ++cnt;
				tr[nq] = tr[q];
				tr[nq].len = tr[p].len + 1;
				tr[q].fa = tr[np].fa = nq;
				for(; p && tr[p].son[c] == q; p = tr[p].fa) tr[p].son[c] = nq;
			}
		}
	}
	f[last]=flag;

}
vi g[N];
void dfs(int u) {
	for(auto v:g[u]) {
		dfs(v);
		f[u]|=f[v];
	}
}
int vis[N];
int pre[N];
char ans[N];
void dfs1(int pos) {
	if(pos==1)return ;
	dfs1(pre[pos]);
	cout<<ans[pos];
}
int id;
void sol() {
	queue<int>q;
	q.push(1);
	int pos=0;
	for(int i=1; i<=cnt; i++)vis[i]=0;
	while(!q.empty()) {
		int u=q.front();
		q.pop();
		//	de_bug(u);
		if(!f[u]) {
			pos=u;
			break;
		}
		for(int i=0; i<=25; i++) {
			//	de_bug(i);
			int v=tr[u].son[i];
			if(!v||vis[v])continue;
			vis[v]=1;
			ans[v]='a'+i;
			pre[v]=u;
			q.push(v);
		}

	}
//	de_bug(pos);
	cout<<"Case #"<<++id<<": ";
	if(!pos)cout<<"Impossible"<<endl;
	else {
		dfs1(pos);
		cout<<endl;
	}

}

void solve() {
	cin >> n;
	cin>>s;
	last=cnt=1;
	for(auto ch:s) {
		extend(ch-'a',0);
	}
	fer(i,2,n) {
		cin>>s;
		last=1;
		for(auto ch:s) {
			extend(ch-'a',1);
		}
	}
	for(int i=2; i<=cnt; i++) {
		g[tr[i].fa].push_back(i);
	}
	dfs(1);
	sol();
	fer(i,1,cnt) {
		g[i].clear();
		//	memset(tr[i],0,sizeof tr[i]);
		f[i]=0;
	}
	memset(tr,0,sizeof(tr));

}
int  main() {
	IOS;
	int _ ;
	cin>>_;
	while( _-- )
		solve();
}