hdu3667

Transportation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2464    Accepted Submission(s): 1052

Problem Description

There are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very careful. The more goods you carry, the more dangerous it is. To be more specific, for each road i, there is a coefficient a_i. If you want to carry x units of goods along this road, you should pay a_i * x² dollars to hire guards to protect your goods. And what’s worse, for each road i, there is an upper bound C_i, which means that you cannot transport more than C_i units of goods along this road. Please note you can only carry integral unit of goods along each road.
You should find out the minimum cost to transport all the goods safely.

 

Input

There are several test cases. The first line of each case contains three integers, N, M and K. (1 <= N <= 100, 1 <= M <= 5000, 0 <= K <= 100). Then M lines followed, each contains four integers (u_i, v_i, a_i, C_i), indicating there is a directed road from city u_i to v_i, whose coefficient is a_i and upper bound is C_i. (1 <= u_i, v_i <= N, 0 < a_i <= 100, C_i <= 5)

 

Output

Output one line for each test case, indicating the minimum cost. If it is impossible to transport all the K units of goods, output -1.

 

Sample Input

2 1 2 1 2 1 2 2 1 2 1 2 1 1 2 2 2 1 2 1 2 1 2 2 2

 

Sample Output

4 -1 3

 

Source

2010 Asia Regional Harbin

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  3661 3664 3665 3666 3669

本题的题一很简单，就是一个人需要运送k单位的货物，但是沿途的道路，过每个道路都需要花钱，cost的系数为a，每运送x单位的货物需要华为a*x*x的价格，我们可以在建立边的时候将其拆开

比如5单位的货物，话费需要a*5*5，但是我们可以将它一个一个单位的分开，就是1,4-1,9-4,16-9等等，每个边的容量都为1，除此之外在建立一个超级原点和一个超级汇点，直接跑最小费用最大流的模板就可以了

下面附上代码，由于第一次边的大小没有掌握好，结果超了内纯一次，

下次可得小心了

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
//最小费用最大流，求最大费用只需要取相反数，结果取相反数即可。
//点的总数为 N，点的编号 0~N-1
const int MAXN = 1005;
const int MAXM = 20005;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int to,next,cap,flow,cost;
} edge[MAXM*4];
int head[MAXN],tol;
int pre[MAXN],dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = n;
    tol = 0;
    memset(head,-1,sizeof (head));
}
void addedge (int u,int v,int cap,int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s,int t)
{
    queue<int>q;
    for(int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i !=  -1; i = edge[i]. next)
        {
            int v = edge[i]. to;
            if(edge[i].cap > edge[i].flow &&
                    dis[v] > dis[u] + edge[i]. cost )
            {
                dis[v] = dis[u] + edge[i]. cost;
                pre[v] = i;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if(pre[t] == -1)return false;
    else return true;
}
//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s,int t,int &cost)
{
    int flow = 0;
    cost = 0;
    while(spfa(s,t))
    {
        int Min = INF;
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            if(Min > edge[i].cap - edge[i]. flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += edge[i]. cost * Min;
        }
        flow += Min;
    }
    return flow;
}
int main(){
   int n,m,sta;
   while(scanf("%d%d%d",&n,&m,&sta)!=EOF){
       memset(pre,0,sizeof(pre));
       memset(dis,0,sizeof(dis));
       memset(vis,false,sizeof(vis));
       memset(edge,0,sizeof(edge));
      init(n+2);
      int u,v,a,c;
      for(int i=0;i<m;i++){
          scanf("%d%d%d%d",&u,&v,&a,&c);
          for(int j=0;j<c;j++)
          addedge(u,v,1,a*(2*j+1));

      }
      int ans1=0;
      addedge(0,1,sta,0);
      addedge(n,n+1,sta,0);
      int temp=minCostMaxflow(0,n+1,ans1);
      if(temp!=sta)
      puts("-1");
      else
      printf("%d
",ans1);

   }
}

 

14745869

2015-09-07 20:51:51

Accepted

3667

998MS

3148K

2986 B

G++