poj-3436.ACM Computer Factory(最大流 + 多源多汇 + 结点容量 + 路径打印 + 流量统计)

ACM Computer Factory

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10940		Accepted: 4098		Special Judge

Description

As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the same factory.

Every ACM computer consists of P parts. When all these parts are present, the computer is ready and can be shipped to one of the numerous ACM contests.

Computer manufacturing is fully automated by using N various machines. Each machine removes some parts from a half-finished computer and adds some new parts (removing of parts is sometimes necessary as the parts cannot be added to a computer in arbitrary order). Each machine is described by its performance (measured in computers per hour), input and output specification.

Input specification describes which parts must be present in a half-finished computer for the machine to be able to operate on it. The specification is a set of P numbers 0, 1 or 2 (one number for each part), where 0 means that corresponding part must not be present, 1 — the part is required, 2 — presence of the part doesn't matter.

Output specification describes the result of the operation, and is a set of P numbers 0 or 1, where 0 means that the part is absent, 1 — the part is present.

The machines are connected by very fast production lines so that delivery time is negligibly small compared to production time.

After many years of operation the overall performance of the ACM Computer Factory became insufficient for satisfying the growing contest needs. That is why ACM directorate decided to upgrade the factory.

As different machines were installed in different time periods, they were often not optimally connected to the existing factory machines. It was noted that the easiest way to upgrade the factory is to rearrange production lines. ACM directorate decided to entrust you with solving this problem.

Input

Input file contains integers P N, then N descriptions of the machines. The description of ith machine is represented as by 2 P + 1 integers Q_i S_i,1 Si_,2...S_i,P D_i,1 D_i,2...D_i,P, where Q_i specifies performance, S_i,j — input specification for part j, D_i,k — output specification for part k.

Constraints

1 ≤ P ≤ 10, 1 ≤ N ≤ 50, 1 ≤ Q_i ≤ 10000

Output

Output the maximum possible overall performance, then M — number of connections that must be made, then M descriptions of the connections. Each connection between machines A and B must be described by three positive numbers A B W, where W is the number of computers delivered from A to B per hour.

If several solutions exist, output any of them.

Sample Input

Sample input 1
3 4
15  0 0 0  0 1 0
10  0 0 0  0 1 1
30  0 1 2  1 1 1
3   0 2 1  1 1 1
Sample input 2
3 5
5   0 0 0  0 1 0
100 0 1 0  1 0 1
3   0 1 0  1 1 0
1   1 0 1  1 1 0
300 1 1 2  1 1 1
Sample input 3
2 2
100  0 0  1 0
200  0 1  1 1

Sample Output

Sample output 1
25 2
1 3 15
2 3 10
Sample output 2
4 5
1 3 3
3 5 3
1 2 1
2 4 1
4 5 1
Sample output 3
0 0

Hint

Bold texts appearing in the sample sections are informative and do not form part of the actual data.

Source

Northeastern Europe 2005, Far-Eastern Subregion

 

一发AC。。。都在题解里了。

 /*
     本题还是比较入门级别的水题吧，思路很好想，选出所有的源点和所有的汇点，还有所有的可行边(如果一台电脑能够接受上一台电脑输出之后的结果，就说明可以从他们之间建立一条边)，
     接着按照多源多汇和结点容量最大流建边，跑一波最大流就ok啦，还有就是记录路径和结点容量值，嘤嘤嘤。
     如果需要打印路径和统计流量，就将图备份一次，并且在存图的时候存入边的起点就ok了，跑完最大流检查一遍哪些边被用过了就ok。
 */
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 using namespace std;

 const int maxn =  + , maxm =  *  + , maxp =  + , inf = 0x3f3f3f3f;
 int p, n, ps[maxn << ][], pe[maxn << ][], q[maxn << ], s1[maxn << ], e1[maxn << ];
 int sizes, sizet, tot, tot1, cnt, head[maxn << ], que[maxn << ], dep[maxn << ], cur[maxn << ], sta[maxn << ];
 struct Edge {
     int to, next, cap, flow, from;
 } edge[maxm << ], edges[maxm << ];
 struct node {
     int u, v, w;
 } ans[maxm << ];

 void init() {
     memset(head, -, sizeof head);
     tot = tot1 = ;
     sizes = sizet = cnt = ;
 }

 void addedge(int u, int v, int w, int rw = ) {
     edge[tot].to = v; edge[tot].cap = w; edge[tot].flow = ; edge[tot].from = u;
     edge[tot].next = head[u]; head[u] = tot ++;
     edge[tot].to = u; edge[tot].cap = rw; edge[tot].flow = ; edge[tot].from = v;
     edge[tot].next = head[v]; head[v] = tot ++;

     edges[tot1].to = v; edges[tot1].cap = w; edges[tot1].flow = ; edges[tot1].from = u;
     edges[tot1].next = head[u]; head[u] = tot1 ++;
     edges[tot1].to = u; edges[tot1].cap = rw; edges[tot1].flow = ; edges[tot1].from = v;
     edges[tot1].next = head[v]; head[v] = tot1 ++;
 }

 bool bfs(int s, int t, int n) {
     int front = , tail = ;
     memset(dep, -, sizeof dep[] * (n + ));
     dep[s] = ;
     que[tail ++] = s;
     while(front < tail) {
         int u = que[front ++];
         for(int i = head[u]; ~i; i = edge[i].next) {
             int v = edge[i].to;
             if(edge[i].cap > edge[i].flow && dep[v] == -) {
                 dep[v] = dep[u] + ;
                 if(v == t) return true;
                 que[tail ++] = v;
             }
         }
     }
     return false;
 }

 int dinic(int s,int t, int n) {
     int maxflow = ;
     while(bfs(s, t, n)) {
         for(int i = ; i < n; i ++) cur[i] = head[i];
         int u = s, tail = ;
         while(cur[s] != -) {
             if(u == t) {
                 int tp = inf;
                 for(int i = tail - ; i >= ; i --)
                     tp = min(tp, edge[sta[i]].cap - edge[sta[i]].flow);
                 maxflow += tp;
                 for(int i = tail - ; i >= ; i --) {
                     edge[sta[i]].flow += tp;
                     edge[sta[i] ^ ].flow -= tp;
                     if(edge[sta[i]].cap - edge[sta[i]].flow == ) tail = i;
                 }
                 u = edge[sta[tail] ^ ].to;
             }
             else if(cur[u] != - && edge[cur[u]].cap > edge[cur[u]].flow && dep[u] +  == dep[edge[cur[u]].to]) {
                 sta[tail ++] = cur[u];
                 u = edge[cur[u]].to;
             }
             else {
                 while(u != s && cur[u] == -)
                     u = edge[sta[-- tail] ^ ].to;
                 cur[u] = edge[cur[u]].next;
             }
         }
     }
     return maxflow;
 }

 int main() {
     while(~scanf("%d %d", &p, &n)) {
         init();
         int s =  * n + , t = s + ;
         for(int i = ; i <= n; i ++) {
             scanf("%d", &q[i]);//读入某一台机器的工作效率
             for(int j = ; j <= p; j ++) scanf("%d", &ps[i][j]);//读入初始状态
             for(int j = ; j <= p; j ++) scanf("%d", &pe[i][j]);//读入输出状态
         }
         bool flag = true;
         for(int i = ; i <= n; i ++) {
             for(int j = ; j <= n; j ++) {
                 if(i ^ j) {//如果i != j
                     flag = true;
                     for(int k = ; k <= p; k ++) {//判断机器j是否可以接受机器i加工之后的状态
                         if(pe[i][k] + ps[j][k] == ) {
                             flag = false;
                             break;
                         }
                     }
                     if(flag) addedge(i + n, j, inf);
                 }
             }
             flag = true;
             for(int k = ; k <= p; k ++) {//判断机器i是否为源点
                 if(ps[i][k] %  == ) {
                     flag = false;
                     break;
                 }
             }
             if(flag) s1[sizes ++] = i;
             flag = true;
             for(int k = ; k <= p; k ++) {//判断机器i是否为汇点
                 if(pe[i][k] == ) {
                     flag = false;
                     break;
                 }
             }
             if(flag) e1[sizet ++] = i;
         }
         for(int i = ; i < sizes; i ++) addedge(s, s1[i], inf);
         for(int i = ; i < sizet; i ++) addedge(n + e1[i], t, inf);
         for(int i = ; i <= n; i ++) addedge(i, n + i, q[i]);
         int maxflow = dinic(s, t,  * n + );
         for(int i = ; i <= tot; i += ) {
             if(edge[i].flow >  && edge[i].from != s && edge[i].to != t && abs(edge[i].from - edge[i].to) != n) {
                 ans[++ cnt].u = edge[i].from > n ? edge[i].from - n: edge[i].from;
                 ans[cnt].v = edge[i].to > n ? edge[i].to - n : edge[i].to;
                 ans[cnt].w = edges[i].cap - edge[i].cap;
                 // ans[++ cnt] = (node){edge[i].from, edge[i].to, edge[i].flow};
                 ans[cnt].w = edge[i].flow;
             }
         }
         if(maxflow == ) cnt = ;
         printf("%d %d\n", maxflow, cnt);
         for(int i = ; i <= cnt; i ++) {
             printf("%d %d %d\n", ans[i].u, ans[i].v, ans[i].w);
         }
     }
     return ;
 }