题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3644
题意:给一张n个点m条有向边的图,每个点有个分数p[i],起始点在1点,每经过一点时分数变为之前分数与这个分数的lcm,且不能出现lcm不变的情况,问走到n点分数为k的方案数
思路:因为要求lcm不能不变,所以不用担心走环的情况,因为若成环,则无法在环内不断走下去,dp[u][z]即可代表走到u点时分数为z的方案数,易知当z不是k的因子时便不需要再进行转移
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <utility>
#include <functional>
#include <string>
#include <set>
#include <map>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 2010;
const int mod = 1e9 + 7;
typedef long long ll;
int dp[maxn][500];
vector <int> g[maxn];
int n, m, k;
int p[maxn];
vector <int> fact;
int id[1000010];
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
void init()
{
memset(dp, -1, sizeof(dp));
for (int i = 0; i < maxn; i++)
g[i].clear();
}
ll dfs(int u, int fi)
{
int z = fact[id[fi]];
if (dp[u][z] != -1) return dp[u][z];
int ans = 0;
for (int i = 0; i < g[u].size(); i++)
{
int v = g[u][i];
ll lc = lcm(fi, p[v]);
if (k % lc != 0 || lc == fi) continue;
ans = (ans + dfs(v, lc)) % mod;
}
return dp[u][z] = ans;
}
int main()
{
while (~scanf("%d%d%d", &n, &m, &k))
{
init();
while (m--)
{
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v);
}
for (int i = 1; i <= n; i++)
scanf("%d", &p[i]);
if (k % p[n])
{
puts("0");
continue;
}
fact.clear();
for (int i = 1; i <= k; i++)
{
if (k % i == 0)
{
fact.push_back(i);
id[i] = fact.size() - 1;
}
else
id[i] = -1;
}
dp[n][fact[id[k]]] = 1;
int ans = dfs(1, p[1]);
printf("%d\n", ans);
}
return 0;
}