8.25正睿十连测DAY1T2（基环内向树，贪心）

很显然的可以发现，物品之间的关系构成基环内向树
怎么求答案呢？
首先我们把所有优秀的物品取到1肯定不影响后面的做法
我们先这么做

然后树的情况我们也显然可以把所有优秀的物品取完

考虑环的情况
我们会舍弃一条环边
我们把每个环的边的权值减去树边权值，取最小的不取即可

我的代码较繁琐。其实只要跑dfs就行了

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define mp make_pair
#define file(k) memset(k,0,sizeof(k))
#define ll long long
const int INF = 1e9;
namespace fastIO{
    #define BUF_SIZE 100000
    #define OUT_SIZE 100000
    bool IOerror = 0;
    inline char nc(){
        static char buf[BUF_SIZE],*p1 = buf+BUF_SIZE, *pend = buf+BUF_SIZE;
        if(p1 == pend){
            p1 = buf; pend = buf+fread(buf, 1, BUF_SIZE, stdin);
            if(pend == p1){ IOerror = 1; return -1;}
        }
        return *p1++;
    }
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline void read(int &x){
        bool sign = 0; char ch = nc(); x = 0;
        for(; blank(ch); ch = nc());
        if(IOerror)return;
        if(ch == '-') sign = 1, ch = nc();
        for(; ch >= '0' && ch <= '9'; ch = nc()) x = x*10+ch-'0';
        if(sign) x = -x;
    }
    inline void read(ll &x){
        bool sign = 0; char ch = nc(); x = 0;
        for(; blank(ch); ch = nc());
        if(IOerror) return;
        if(ch == '-') sign = 1, ch = nc();
        for(; ch >= '0' && ch <= '9'; ch = nc()) x = x*10+ch-'0';
        if(sign) x = -x;
    }
    #undef OUT_SIZE
    #undef BUF_SIZE
};
using namespace fastIO;
int n , f[100100] , c[100100] , d[100100] , a[100100];
int v[100100] , mx[100100] , tru[100100] , ru[100100];
int tmp[100100];
bool vis[100100];
ll ans;
bool inq[100100];
queue<int>q;
void toppre()
{
    rep(i,1,n) if(!ru[i]) q.push(i),inq[i] = true;
    rep(i,1,n) tmp[i] = ru[i];
    while(!q.empty())
    {
        int x = q.front();q.pop();
        mx[f[x]] = max(mx[f[x]],d[f[x]]-c[x]);
        tmp[f[x]]--;
        if(tmp[f[x]] == 0) q.push(f[x]),inq[f[x]] = true;
    }
    rep(i,1,n) if(!inq[i]) vis[i] = true;
    rep(i,1,n) 
        if(vis[i] && f[i] == i)
        {
            if(v[i] > 0)ans += v[i];
            vis[i] = false;
        }
    rep(i,1,n) 
        if(vis[i] && (mx[f[i]] >= d[f[i]] - c[i] || v[f[i]] <= 0))
        {
            tmp[f[i]]--;ru[f[i]]--;
            if(!tmp[f[i]]) vis[f[i]] = false;
            f[i] = 0;
        }
    rep(i,1,n) tmp[i] = ru[i],vis[i] = false,inq[i] = false;
    rep(i,1,n) if(!tmp[i]) q.push(i) , inq[i] = true;
    while(!q.empty())
    {
        int x = q.front();q.pop();
        if(v[x] > 0) ans += v[x];
        mx[f[x]] = max(mx[f[x]],d[f[x]]-c[x]);
        tmp[f[x]]--;
        if(tmp[f[x]] == 0) q.push(f[x]) , inq[f[x]] = true;
    }
    rep(i,1,n) if(!inq[i] && f[i] != i) vis[i] = true;
}
void init()
{
    read(n);
    rep(i,1,n) read(f[i]) , read(c[i]) , read(d[i]) , read(a[i]);
    rep(i,1,n) v[f[i]] = max(v[f[i]],d[f[i]] - c[i]) , ru[f[i]]++;
    rep(i,1,n) if(v[i] > 0) ans += 1ll*(a[i]-1) * v[i];
    toppre();
}
void work(int x)
{
    vis[x] = false;
    int Min = v[x],k = x,now = f[x];
    while(now != x)
    {
        vis[now] = false;
        if(v[now] < Min) Min = v[now] , k = now;
        now = f[now];
    }
    now = x;
    while(1) 
    {
        now = f[now];
        if(now != k) ans += v[now] + mx[now];
        else ans += mx[now];
        if(now == x) break;
    }
}
int main()
{
    init();
    rep(i,1,n)
        if(vis[i])
            v[i] -= mx[i]; 
    rep(i,1,n)
        if(vis[i]) work(i);
    printf("%lld\n",ans);
    return 0;
}