HDU 5294 Tricks Device（2015多校第一场 最短路 + 最小割）

一个拼模版的题目

Tricks Device

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 211    Accepted Submission(s): 54

Problem Description

Innocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers, the total number is N. And there are M channels connecting the chambers. Innocent Wu wants to catch up Dumb Zhang to find out the answers of some questions, however, it’s Dumb Zhang’s intention to keep Innocent Wu in the dark, to do which he has to stop Innocent Wu from getting him. Only via the original shortest ways from the entrance to the end of the tomb costs the minimum time, and that’s the only chance Innocent Wu can catch Dumb Zhang.
Unfortunately, Dumb Zhang masters the art of becoming invisible(奇门遁甲) and tricks devices of this tomb, he can cut off the connections between chambers by using them. Dumb Zhang wanders how many channels at least he has to cut to stop Innocent Wu. And Innocent Wu wants to know after how many channels at most Dumb Zhang cut off Innocent Wu still has the chance to catch Dumb Zhang.

 

Input

There are multiple test cases. Please process till EOF.
For each case,the first line must includes two integers, N(<=2000), M(<=60000). N is the total number of the chambers, M is the total number of the channels.
In the following M lines, every line must includes three numbers, and use ai、bi、li as channel i connecting chamber ai and bi(1<=ai,bi<=n), it costs li(0<li<=100) minute to pass channel i.
The entrance of the tomb is at the chamber one, the end of tomb is at the chamber N.

 

Output

Output two numbers to stand for the answers of Dumb Zhang and Innocent Wu’s questions.

 

Sample Input

  
  

   
   8 9
1 2 2
2 3 2
2 4 1
3 5 3
4 5 4
5 8 1
1 6 2
6 7 5
7 8 1
  
  

 

Sample Output

  
  

   
   2 6
  
  

 

Source

2015 Multi-University Training Contest 1

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define LL long long
using namespace std;

const int MAXN = 2000 + 10;//点数的最大值
const int MAXM = 120000 + 10;//边数的最大值
const int INF = 0x3f3f3f3f;

struct Node
{
    int from,to,next;
    int cap;
} edge[MAXM];
int tol;
int head[MAXN];
int dep[MAXN];
int gap[MAXN];//gap[x]=y :说明残留网络中dep[i]==x的个数为y
int n, m;//n是总的点的个数，包括源点和汇点
void init()
{
    tol=0;
    memset(head,-1,sizeof(head));
}
void AddEdge(int u,int v,int w)
{
    edge[tol].from=u;
    edge[tol].to=v;
    edge[tol].cap=w;
    edge[tol].next=head[u];
    head[u]=tol++;
    edge[tol].from=v;
    edge[tol].to=u;
    edge[tol].cap=0;
    edge[tol].next=head[v];
    head[v]=tol++;
}
void BFS(int start,int end)
{
    memset(dep,-1,sizeof(dep));
    memset(gap,0,sizeof(gap));
    gap[0]=1;
    int que[MAXN];
    int front,rear;
    front=rear=0;
    dep[end]=0;
    que[rear++]=end;
    while(front!=rear)
    {
        int u=que[front++];
        if(front==MAXN)front=0;
        for(int i=head[u]; i!=-1; i=edge[i].next)
        {
            int v=edge[i].to;
            if(dep[v]!=-1)continue;
            que[rear++]=v;
            if(rear==MAXN)rear=0;
            dep[v]=dep[u]+1;
            ++gap[dep[v]];
        }
    }
}
int SAP(int start,int end)
{
    int res=0;
    BFS(start,end);
    int cur[MAXN];
    int S[MAXN];
    int top=0;
    memcpy(cur,head,sizeof(head));
    int u=start;
    int i;
    while(dep[start]<n)
    {
        if(u==end)
        {
            int temp=INF;
            int inser;
            for(i=0; i<top; i++)
                if(temp>edge[S[i]].cap)
                {
                    temp=edge[S[i]].cap;
                    inser=i;
                }
            for(i=0; i<top; i++)
            {
                edge[S[i]].cap-=temp;
                edge[S[i]^1].cap+=temp;
            }
            res+=temp;
            top=inser;
            u=edge[S[top]].from;
        }
        if(u!=end&&gap[dep[u]-1]==0)//出现断层，无增广路
            break;
        for(i=cur[u]; i!=-1; i=edge[i].next)
            if(edge[i].cap!=0&&dep[u]==dep[edge[i].to]+1)
                break;
        if(i!=-1)
        {
            cur[u]=i;
            S[top++]=i;
            u=edge[i].to;
        }
        else
        {
            int min=n;
            for(i=head[u]; i!=-1; i=edge[i].next)
            {
                if(edge[i].cap==0)continue;
                if(min>dep[edge[i].to])
                {
                    min=dep[edge[i].to];
                    cur[u]=i;
                }
            }
            --gap[dep[u]];
            dep[u]=min+1;
            ++gap[dep[u]];
            if(u!=start)u=edge[S[--top]].from;
        }
    }
    return res;
}
struct Edge
{
    int v, w;
    Edge(int v, int w) : v(v), w(w) {};
};
vector<Edge>G[MAXN];
int dis[MAXN], g[MAXN];
int vis[MAXN];
void SPFA(int s)
{
    priority_queue<pair<int,int> >Q;
    for(int i = 1; i <= n; i++)
        dis[i] = (i == 1 ? 0 : INF);
    memset(vis, 0, sizeof(vis));
    memset(g, 0, sizeof(g));
    Q.push(make_pair(dis[1], 1));
    while(!Q.empty())
    {
        int u = Q.top().second;Q.pop();
        if(vis[u]) continue ;
        vis[u] = 1;
        for(int i = 0; i < G[u].size(); i++)
        {
            Edge& e = G[u][i];
            if(dis[u] + e.w < dis[e.v] || (dis[u] + e.w == dis[e.v] && g[u] + 1 < g[e.v]))
            {
                dis[e.v] = dis[u] + e.w;
                g[e.v] = g[u] + 1;
                Q.push(make_pair(-dis[e.v],e.v)); // 默认大的元素优先级高，所以要取最小就加负号
            }
        }
    }
}

int main()
{
    while(scanf("%d%d", &n, &m)!=EOF)
    {
        int u, v , w;
        for(int i=1; i<=n; i++) G[i].clear();
        for(int i=1; i<=m; i++)
        {
            scanf("%d%d%d", &u, &v, &w);
            G[u].push_back(Edge(v, w));
            G[v].push_back(Edge(u, w));
        }
        SPFA(1);
        init();
        for(int i=1; i<=n; i++)
        {
            for(int j=0; j<G[i].size(); j++)
            {
                int u = i, v = G[i][j].v, w = G[i][j].w;
                if(dis[v] == dis[u] + w)
                    AddEdge(u, v, 1);
            }
        }
        printf("%d %d\n", SAP(1, n), m - g[n]);
    }
    return 0;
}
/*
8 9
1 2 2
2 3 2
2 4 1
3 5 3
4 5 4
5 8 1
1 6 2
6 7 5
7 8 1
*/