zoukankan      html  css  js  c++  java
  • 2016青岛网络赛 Barricade

    Barricade

    Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

    Problem Description
    The empire is under attack again. The general of empire is planning to defend his castle. The land can be seen as N towns and M roads, and each road has the same length and connects two towns. The town numbered 1 is where general's castle is located, and the town numbered N is where the enemies are staying. The general supposes that the enemies would choose a shortest path. He knows his army is not ready to fight and he needs more time. Consequently he decides to put some barricades on some roads to slow down his enemies. Now, he asks you to find a way to set these barricades to make sure the enemies would meet at least one of them. Moreover, the barricade on the i-th road requires wi units of wood. Because of lacking resources, you need to use as less wood as possible.
     
    Input
    The first line of input contains an integer t, then t test cases follow.
    For each test case, in the first line there are two integers N(N1000) and M(M10000).
    The i-the line of the next M lines describes the i-th edge with three integers u,v and w where 0w1000 denoting an edge between u and v of barricade cost w.
     
    Output
    For each test cases, output the minimum wood cost.
     
    Sample Input
    1 4 4 1 2 1 2 4 2 3 1 3 4 3 4
     
    Sample Output
    4
    分析:对最短路求最小割最大流即可;
    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cmath>
    #include <algorithm>
    #include <climits>
    #include <cstring>
    #include <string>
    #include <set>
    #include <map>
    #include <queue>
    #include <stack>
    #include <vector>
    #include <list>
    #define rep(i,m,n) for(i=m;i<=n;i++)
    #define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
    #define mod 1000000007
    #define inf 0x3f3f3f3f
    #define vi vector<int>
    #define pb push_back
    #define mp make_pair
    #define fi first
    #define se second
    #define ll long long
    #define pi acos(-1.0)
    #define pii pair<int,int>
    #define Lson L, mid, rt<<1
    #define Rson mid+1, R, rt<<1|1
    const int maxn=1e3+10;
    using namespace std;
    ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
    ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
    int n,m,k,t,h[maxn],tot,vis[maxn],s,cur[maxn],f[maxn],d[maxn],g[maxn];
    vi edge[maxn];
    struct Node
    {
        int x,y,z;
        Node(){}
        Node(int _x,int _y,int _z):x(_x),y(_y),z(_z){}
    }op[10010];
    struct node
    {
        int to,nxt,cap,flow;
    }e[10010<<1];
    void add(int x,int y,int z)
    {
        e[tot].to=y;
        e[tot].nxt=h[x];
        e[tot].cap=z;
        e[tot].flow=0;
        h[x]=tot++;
        e[tot].to=x;
        e[tot].nxt=h[y];
        e[tot].flow=0;
        h[y]=tot++;
    }
    bool bfs()
    {
        memset(vis,0,sizeof vis);
        queue<int>p;
        p.push(s);
        vis[s]=1;
        while(!p.empty())
        {
            int x=p.front();p.pop();
            for(int i=h[x];i!=-1;i=e[i].nxt)
            {
                int to=e[i].to,cap=e[i].cap,flow=e[i].flow;
                if(!vis[to]&&cap>flow)
                {
                    vis[to]=vis[x]+1;
                    p.push(to);
                }
            }
        }
        return vis[t];
    }
    void pr_bfs(int s)
    {
        int i;
        memset(d,inf,sizeof d);
        memset(vis,0,sizeof vis);
        queue<int>p;p.push(s);vis[s]=1;d[s]=0;
        while(!p.empty())
        {
            int q=p.front();p.pop();vis[q]=0;
            for(int x:edge[q])
            {
                if(d[x]>d[q]+1)
                {
                    d[x]=d[q]+1;
                    if(!vis[x])p.push(x),vis[x]=1;
                }
            }
        }
        if(s==n)rep(i,1,n)f[i]=d[i];
        else rep(i,1,n)g[i]=d[i];
        return;
    }
    int dfs(int x,int a)
    {
        if(x==t||a==0)return a;
        int ans=0,j;
        for(int&i=cur[x];i!=-1;i=e[i].nxt)
        {
            int to=e[i].to,cap=e[i].cap,flow=e[i].flow;
            if(vis[to]==vis[x]+1&&(j=dfs(to,min(a,cap-flow)))>0)
            {
                e[i].flow+=j;
                e[i^1].flow-=j;
                ans+=j;
                a-=j;
                if(a==0)break;
            }
        }
        return ans;
    }
    int max_flow(int s,int t)
    {
        int flow=0,i;
        while(bfs())
        {
            memcpy(cur,h,sizeof cur);
            flow+=dfs(s,inf);
        }
        return flow;
    }
    int main()
    {
        int i,j,test;
        scanf("%d",&test);
        while(test--)
        {
            tot=0;
            memset(h,-1,sizeof h);
            scanf("%d%d",&n,&m);
            rep(i,1,n)edge[i].clear();
            rep(i,0,m-1)
            {
                int a,b,c;
                scanf("%d%d%d",&a,&b,&c);
                op[i]=Node(a,b,c);
                edge[a].pb(b),edge[b].pb(a);
            }
            pr_bfs(n);
            pr_bfs(1);
            rep(i,0,m-1)
            {
                int a=op[i].x,b=op[i].y,c=op[i].z;
                if(f[a]+g[b]+1==f[1])add(a,b,c);
                if(f[b]+g[a]+1==f[1])add(b,a,c);
            }
            s=n,t=1;
            printf("%d
    ",max_flow(s,t));
        }
        //system("Pause");
        return 0;
    }
     
  • 相关阅读:
    EF CodeFirst EntityTypeConfiguration 自关联映射配置
    DDD 领域驱动设计-看我如何应对业务需求变化,领域模型调整?
    DDD 领域驱动设计-看我如何应对业务需求变化,愚蠢的应对?
    【记录】ASP.NET XSS 脚本注入攻击
    【记录】JS 获取图片原始尺寸-防止图片溢出
    让 ASP.NET vNext 在 Mac OS 中飞呀飞。。。
    Building Modern Web Apps-构建现代的 Web 应用程序(一些感想)
    【记录】ASP.NET MVC RegisterBundles
    【记录】JS 生成 URL 二维码
    关于有默认值的字段在用EF做插入操作时的思考(续)
  • 原文地址:https://www.cnblogs.com/dyzll/p/5886751.html
Copyright © 2011-2022 走看看