UVALive 4654 (最小路径覆盖)

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define maxn 211
#define maxm maxn*maxn*2

bool mp[maxn][maxn];
int n, m;
int a[maxn];

struct node {
int u, v, next;
}edge[maxm];
int head[maxn], cnt;

void add_edge (int u, int v) {
edge[cnt].u = u, edge[cnt].v = v, edge[cnt].next = head[u], head[u] = cnt++;
}

int pre[maxn];
bool vis[maxn];

bool dfs (int u) {
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].v;
if (!vis[v]) {
vis[v] = 1;
if (pre[v] == -1 || dfs (pre[v])) {
pre[v] = u;
return 1;
}
}
}
return 0;
}

int hungry () {
int ans = 0;
memset (pre, -1, sizeof pre);
for (int i = 1; i <= m; i++) {
memset (vis, 0, sizeof vis);
if (dfs (i))
ans++;
}
return m-ans;
}

void solve () {
int Max = 0;
for (int i = 1; i <= m; i++) {
if (mp[1][a[i]])
Max++;
}
for (int i = 1; i <= m; i++) {
for (int j = i+1; j <= m; j++) {
if (mp[a[i]][a[j]])
add_edge (i, j);
}
}
printf ("%d %d\n", hungry (), Max);
}

int main () {
while (cin >> n >> m && n+m) {
memset (head, -1, sizeof head);
cnt = 0;
memset (mp, 0, sizeof mp);
for (int i = 1; i <= n; i++) {
int c;
scanf ("%d", &c);
while (c--) {
int u;
scanf ("%d", &u);
mp[i][u] = 1;
}
}
for (int i = 1; i <= m; i++) {
scanf ("%d", &a[i]);
}
solve ();
}
return 0;
}