PKU 3436 ACM Computer Factory

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

 

这道题最难的部分在于要想到要用最大流来做。建图的时候，设置一个虚拟的原点和汇点。每一个computer分成两部分，两部分自己的流量是吞吐量；如果i的输出满足j对输入的要求，那么i+n与j建立一条边；如果i对输入没有要求，那么源点到i建立一条边；如果i能够完整输出，那么i+n对汇点建立一条边。

 

建图完后，直接残留网络就搞定了。

 

//#include "stdafx.h" //============================================================================ // Name : acmcpp.cpp // Author : Yubo Chow // Version : // Copyright : Your copyright notice // Description : Hello World in C++, Ansi-style //============================================================================ #include <iostream> #include <stdlib.h> #include <stdio.h> #include <queue> #include <math.h> #include <algorithm> #include <set> #include <limits.h> #include <float.h> #include <bitset> #include <cmath> #include <vector> //#include <map> #include <list> using namespace std; typedef struct { int in[11], out[11]; int p; } computer; computer cpt[55]; int p, n; int map[110][110]; int flow[110][110]; int q[110]; int s, e; int m; int pre[110]; int power[110]; int ret = 0, connection = 0; typedef struct { int a, b, p; } answer; answer ans[13000]; void bfs() { bool f; q[0] = 0; memset(flow, 0, sizeof(flow)); power[0] = INT_MAX; do { f = false; s = 0; e = 1; memset(power, 0, sizeof power); power[0] = INT_MAX; while (s < e) { int i = q[s++]; if (map[i][m] > flow[i][m]) { f = true; pre[m] = i; power[m] = min(power[i], map[i][m] - flow[i][m]); ret += power[m]; int p = i, q = m; while (p) { flow[p][q] += power[m]; flow[q][p] -= power[m]; q = p; p = pre[p]; } break; } for (int j = 1; j < m; ++j) { if (!power[j] && map[i][j] > flow[i][j]) { pre[j] = i; power[j] = min(power[i], map[i][j] - flow[i][j]); q[e++] = j; } } } } while (f); cout << ret << ' '; } void print() { for (int i = 1; i < m; i++) { for (int j = 1; j < m; j++) { if (j == i + n || i == j + n) { continue; } if (flow[i][j] > 0 && map[i][j] > 0) { ans[connection].p = flow[i][j]; ans[connection].a = i > n ? i - n : i; ans[connection].b = j > n ? j - n : j; connection++; } } } printf("%d/n", connection); for (int i = 0; i < connection; ++i) { printf("%d %d %d/n", ans[i].a, ans[i].b, ans[i].p); } } void graph() { memset(map, 0, sizeof(map)); s = 0; m = (n << 1) + 1; bool isok = true; for (int i = 1; i <= n; ++i) { map[i][i + n] = cpt[i].p; for (int j = 1; j <= n; ++j) { if (i == j) { continue; } isok = true; for (int k = 0; k < p; ++k) { if (cpt[j].in[k] != 2 && cpt[j].in[k] != cpt[i].out[k]) { isok = false; break; } } if (isok) { map[i + n][j] = cpt[j].p; } } isok = true; for (int k = 0; k < p; ++k) { if (cpt[i].in[k] == 1) { isok = false; break; } } if (isok) { map[s][i] = cpt[i].p; } isok = true; for (int k = 0; k < p; ++k) { if (!cpt[i].out[k]) { isok = false; break; } } if (isok) { map[i + n][m] = cpt[i].p; } } } int main() { #ifndef ONLINE_JUDGE freopen("case.txt", "r", stdin); #endif scanf("%d%d", &p, &n); for (int i = 1; i <= n; ++i) { scanf("%d", &cpt[i].p); for (int j = 0; j < p; ++j) { scanf("%d", &cpt[i].in[j]); } for (int j = 0; j < p; ++j) { scanf("%d", &cpt[i].out[j]); } } graph(); bfs(); print(); return 0; }