1449: [JSOI2009]球队收益

1449: [JSOI2009]球队收益

Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 757  Solved: 437
[Submit][Status][Discuss]

Description

Input

Output

一个整数表示联盟里所有球队收益之和的最小值。

Sample Input

3 3
1 0 2 1
1 1 10 1
0 1 3 3
1 2
2 3
3 1

Sample Output

43

HINT

Source

#include<cstdio>
#include<cstring>
#include<iostream>
#define b(x) (x*x)
#define IN inline
using namespace std;
IN int read(){
    register int x=,f=;
    register char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}
const int N=1e5+;
const int M=;
const int inf=1e9;
struct node{
    int v,next,cap,cost;
}e[N*];int tot=;
int n,m,S,T,ans,head[M],dis[M],q[N*];
int win[M],lose[M],C[M],D[M],rem[M];
bool vis[M];
IN void add(int x,int y,int cap,int cost){
    e[++tot].v=y;e[tot].cap=cap;e[tot].cost=cost;e[tot].next=head[x];head[x]=tot;
    e[++tot].v=x;e[tot].cap=;e[tot].cost=-cost;e[tot].next=head[y];head[y]=tot;
}
IN bool spfa(){
    for(int i=S;i<=T;i++) vis[i]=,dis[i]=inf;
    int h=,t=;q[t]=T;dis[T]=;vis[T]=;
    while(h!=t){
        int x=q[++h];vis[x]=;
        for(int i=head[x];i;i=e[i].next){
            int v=e[i].v;
            if(e[i^].cap&&dis[v]>dis[x]+e[i^].cost){
                dis[v]=dis[x]+e[i^].cost;
                if(!vis[v]){
                    vis[v]=;
                    q[++t]=v;
                }
            }
        }
    }
    return dis[S]<inf;
}
int dfs(int x,int f){
    vis[x]=;
    if(x==T) return f;
    int used=,w;
    for(int i=head[x];i;i=e[i].next){
        int v=e[i].v;
        if(!vis[v]&&e[i].cap&&dis[v]+e[i].cost==dis[x]){
            w=dfs(v,min(f-used,e[i].cap));
            e[i].cap-=w;e[i^].cap+=w;
            ans+=w*e[i].cost;
            used+=w;
            if(used==f) return used;
        }
    }
    return used;
}
IN void zkw(){
    while(spfa()){
        vis[T]=;
        while(vis[T]){
            memset(vis,,sizeof vis);
            dfs(S,inf);
        }
    }
}
int main(){
    n=read();m=read();S=;T=n+m+;
    for(int i=;i<=n;i++) win[i]=read(),lose[i]=read(),C[i]=read(),D[i]=read();
    for(int i=,x,y;i<=m;i++){
        x=read();y=read();rem[x]++;rem[y]++;
        add(S,i,,);
        add(i,x+m,,);
        add(i,y+m,,);
    }
    for(int i=;i<=n;i++) lose[i]+=rem[i];
    for(int i=;i<=n;i++) ans+=b(win[i])*C[i]+b(lose[i])*D[i];
    for(int i=;i<=n;i++){
        for(int j=;j<=rem[i];j++){
            add(i+m,T,,*win[i]*C[i]-*lose[i]*D[i]+C[i]+D[i]);
            win[i]++;lose[i]--;
        }
    }
    zkw();
    printf("%d",ans);
    return ;
}