BZOJ5091 摘苹果（概率期望）

　　大胆猜想每一步都相当于是第一步。稍微验证一下发现是对的。就做完了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 100010
#define P 1000000007
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}
int gcd(int n,int m){return m==?n:gcd(m,n%m);}
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
int n,m,k,a[N],degree[N],inv,ans;
int ksm(int a,int k)
{
    int s=;
    for (;k;k>>=,a=1ll*a*a%P) if (k&) s=1ll*s*a%P;
    return s;
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("bzoj5091.in","r",stdin);
    freopen("bzoj5091.out","w",stdout);
    const char LL[]="%I64d\n";
#else
    const char LL[]="%lld\n";
#endif
    n=read(),m=read(),k=read();
    for (int i=;i<=n;i++) a[i]=read();
    for (int i=;i<=m;i++)
    {
        int x=read(),y=read();
        degree[x]++,degree[y]++;
    }
    inv=ksm(*m,P-);
    for (int i=;i<=n;i++) ans=(ans+1ll*a[i]*k%P*degree[i]%P*inv)%P;
    cout<<ans;
    return ;
}