分析:从复杂度来看,一定不可能是枚举
i
和
我是这么想的,对于三个点,假设1->2有a种走法,2->3有b种走法。那么1->3应该有a*b种走法,所以图中父亲节点一定是可以通过儿子节点的权值递推得到的。有了这个想法,那么
O(N)
完成这道题应该就不是梦想了。
我开了val数组,
val[j]
表示从
j
点出发的
代码:
/*****************************************************/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define offcin ios::sync_with_stdio(false)
#define sigma_size 26
#define lson l,m,v<<1
#define rson m+1,r,v<<1|1
#define slch v<<1
#define srch v<<1|1
#define sgetmid int m = (l+r)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define pb push_back
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const LL INFF = 1e18;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-9;
const LL mod = 1e9+7;
const int maxmat = 10;
const ull BASE = 31;
/*****************************************************/
const int maxn = 1e5 + 5;
std::vector<int> G[maxn];
int a[maxn], b[maxn];
int val[maxn];
bool vis[maxn];
LL ans;
void dfs(int u) {
vis[u] = true;
val[u] = b[u];
for (int i = 0; i < G[u].size(); i ++) {
int v = G[u][i];
if (!vis[v]) dfs(v);
val[u] = (val[v] + val[u]) % mod;
ans = (ans + (LL)a[u] * val[v] % mod) % mod;
}
}
int main(int argc, char const *argv[]) {
int N, M;
while (~scanf("%d%d", &N, &M)) {
ans = 0;
for (int i = 0; i <= N; i ++) G[i].clear();
mem(val, 0); mem(vis, false); mem(a, 0); mem(b, 0);
for (int i = 1; i <= N; i ++) scanf("%d%d", a + i, b + i);
for (int i = 0; i < M; i ++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].pb(v);
}
for (int i = 1; i <= N; i ++)
if (!vis[i]) dfs(i);
cout<<ans<<endl;
}
return 0;
}