POJ 2536 解题报告

 thestoryofsnow 2536 Accepted 192K 32MS C++ 2788B
/*
ID: thestor1
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

// See http://www.geeksforgeeks.org/maximum-bipartite-matching/ for more detailed explanation

const int MAXN = 200;
const int MAXM = 200;

// A DFS based recursive function that returns true if a
// matching for vertex u is possible
bool DFS(int u, const bool adjMatrix[][MAXM], const int N, const int M, int match[], bool visited[])
{
// Try every job one by one
for (int v = 0; v < M; ++v)
{
// If applicant u is interested in job v and v is
// not visited
{
// Mark v as visited
visited[v] = true;

// If job 'v' is not assigned to an applicant OR
// previously assigned applicant for job v (which is match[v])
// has an alternate job available.
// Since v is marked as visited in the above line, match[v]
// in the following recursive call will not get job 'v' again
if (match[v] < 0 || DFS(match[v], adjMatrix, N, M, match, visited))
{
match[v] = u;
return true;
}
}
}

return false;
}

// Returns maximum number of matching from N to M

// match: An array to keep track of the applicants assigned to jobs.
// The value of match[i] is the applicant number
// assigned to job i, the value -1 indicates nobody is assigned.
int maximumBipartiteMatching(const bool adjMatrix[][MAXM], const int N, const int M, int match[], bool visited[])
{
// Count of jobs assigned to applicants
int mbm = 0;

// Initially all jobs are available
memset(match, -1, M * sizeof(int));

for (int u = 0; u < N; ++u)
{
// Mark all jobs as not seen for next applicant.
memset(visited, false, M * sizeof(bool));

// Find if the applicant 'u' can get a job
if (DFS(u, adjMatrix, N, M, match, visited))
{
mbm++;
}
}
return mbm;
}

int main()
{
int N, M;
int match[MAXM];
bool visited[MAXM];

while (scanf("%d%d", &N, &M) > 0)
{
for (int i = 0; i < N; ++i)
{
for (int j = 0; j < M; ++j)
{
}
}

for (int u = 0; u < N; ++u)
{
int si;
scanf("%d", &si);
for (int j = 0; j < si; ++j)
{
int v;
scanf("%d", &v);
v--;
}
}

// for (int u = 0; u < N; ++u)
// {
// 	printf("%d: ", u);
// 	for (int v = 0; v < M; ++v)
// 	{
// 	}
// 	printf("\n");
// }

int mbm = maximumBipartiteMatching(adjMatrix, N, M, match, visited);
printf("%d\n", mbm);
}

return 0;
}