牛客小白月赛11 Rinne Loves Edges

题库链接：https://ac.nowcoder.com/acm/contest/370/F

code:

#include
using namespace std;
int n,m,s;
struct edge
{
    int to;int cost;
};
vector e[110005];
bool vis[100005];
int mem[100005];
long long dp(int i,int pre)
{
    if(e[i].size()==1&&i!=s)
    {
        return e[i][0].cost;
    }
    if(mem[i]!=-1)return mem[i];
    vis[i]=1;
    long long res=0;
    int nxt;int co;
    edge tmp;
    for(int j=0;j