题意:小明要和女友去约会,一共有n个点,小明在1号点,女友在n号点,小明想要从最短路径到女友的位置,但是奇葩的女友给了小明限制条件:1、小明只能往比当前点编号大的点走,2、女友给出了k条路径,小明走的时候不能过这些路径。
题解:AC自动机+floyd算法,ac自动机来完成状态的转移,在跑floyd的时候要注意只能往编号大的点走
AC自动机照着kuangbin巨巨模板打的,模板提就是爽,然后WA一发,忘记更新end[]数组了,所以千万不要背模板!不要背模板!(最后附上ac自动机模板。。。滑稽.jpg)
代码
#include<cstdio>
#include<queue>
#include<cmath>
#define M 55
#define INF 1e18
using namespace std;
int n, m, b[M];
struct node
{
int x, y;
}a[M];
double dis(node A, node B)
{
return sqrt((double)(1.0 * A.x - 1.0 * B.x) * (1.0 * A.x - 1.0 * B.x) + (double)(1.0 * A.y - 1.0 * B.y) * (1.0 * A.y - 1.0 * B.y));
}
struct ac_auto
{
int next[505][M], fail[505], end[505];
int root, L;
double dp[M][505];
int newnode()
{
for(int i = 1; i <= n; i++)
next[L][i] = -1;
end[L++] = 0;
return L - 1;
}
void init()
{
L = 0;
root = newnode();
}
void insert(int a[], int len)
{
int now = root;
for(int i = 0; i < len; i++)
{
if(next[now][a[i]] == -1)
next[now][a[i]] = newnode();
now = next[now][a[i]];
}
end[now] = 1;
}
void build()
{
queue<int> q;
fail[root] = root;
for(int i = 1; i <= n; i++)
if(next[root][i] == -1)
next[root][i] = root;
else
{
fail[next[root][i]] = root;
q.push(next[root][i]);
}
while(!q.empty())
{
int now = q.front();
q.pop();
if(end[fail[now]])end[now] = 1;
for(int i = 1; i <= n; i++)
if(next[now][i] == -1)
next[now][i] = next[fail[now]][i];
else
{
fail[next[now][i]] = next[fail[now]][i];
q.push(next[now][i]);
}
}
}
void floyd()
{
for(int i = 1; i <= n; i++)
for(int j = 0; j < L; j++)
dp[i][j] = INF;
dp[1][next[root][1]] = 0;
for(int i = 1; i < n; i++)
for(int j = 0; j < L; j++)
{
if(dp[i][j] < INF)
{
for(int k = i + 1; k <= n; k++)
if(!end[next[j][k]])
dp[k][next[j][k]] = min(dp[k][next[j][k]], dp[i][j] + dis(a[i], a[k]));
}
}
double ans = INF;
for(int i = 0; i < L; i++)
ans = min(dp[n][i], ans);
if(ans == INF)printf("Can not be reached!\n");
else printf("%.2f\n", ans);
}
}ac;
int main()
{
while(scanf("%d %d", &n, &m))
{
if(n == 0 && m == 0)break;
for(int i = 1; i <= n; i++)
scanf("%d %d", &a[i].x, &a[i].y);
ac.init();
for(int i = 1; i <= m; i++)
{
int k;
scanf("%d", &k);
for(int j = 0; j < k; j++)
scanf("%d", &b[j]);
ac.insert(b, k);
}
ac.build();
ac.floyd();
}
return 0;
}
ac自动机模板 by kuangbin
#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX=500005;
struct Trie
{
int next[MAX][26],fail[MAX],end[MAX];
int root,L;
int newnode()
{
for (int i=0;i<26;i++)
next[L][i]=-1;
end[L++]=0;
return L-1;
}
void init()
{
L=0;
root=newnode();
}
void insert(char *buf)
{
int len=strlen(buf);
int now=root;
for (int i=0;i<len;i++)
{
if (next[now][buf[i]-'a']==-1)
next[now][buf[i]-'a']=newnode();
now=next[now][buf[i]-'a'];
}
end[now]++;
}
void build ()
{
queue<int >Q;
fail[root]=root;
for (int i=0;i<26;i++)
if (next[root][i]==-1)
next[root][i]=root;
else
{
fail[next[root][i]]=root;
Q.push(next[root][i]);
}
while (!Q.empty())
{
int now=Q.front();
Q.pop();
for (int i=0;i<26;i++)
if (next[now][i]==-1)
next[now][i]=next[fail[now]][i];
else
{
fail[next[now][i]]=next[fail[now]][i];
Q.push(next[now][i]);
}
}
}
int query(char *buf)
{
int len=strlen(buf);
int now=root;
int res=0;
for (int i=0;i<len;i++)
{
now=next[now][buf[i]-'a'];
int temp=now;
while (temp!=root)
{
res+=end[temp];
end[temp]=0;
temp=fail[temp];
}
}
return res;
}
};
char buf[2*MAX];
Trie ac;
int main()
{
int T,n;
cin>>T;
while (T--)
{
scanf("%d",&n);
ac.init();
for (int i=0;i<n;i++)
{
scanf("%s",buf);
ac.insert(buf);
}
ac.build();
scanf("%s",buf);
printf("%d\n",ac.query(buf));
}
return 0;
}