一个有向图,且我们要注意一句话. Each paratrooper lands at an intersection and can visit other intersections following the town streets. 所以我们要先把所有能通向的点都连上边,然后最小点覆盖
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAXN 222
bool gra[MAXN][MAXN], vis[MAXN];
int cx[MAXN], cy[MAXN];
int n;
bool dfs( int u)
{
for(int i = 0; i < n; i++)
{
if(gra[u][i] && !vis[i])
{
vis[i] = 1;
if(cy[i] == -1 || dfs(cy[i]))
{
cy[i] = u;
cx[u] = i;
return true;
}
}
}
return false;
}
void solve( )
{
int ans = 0;
memset(cx, -1, sizeof(cx));
memset(cy, -1, sizeof(cy));
for( int i = 0; i < n; i++)
{
if(cx[i] == -1)
{
memset(vis, 0, sizeof(vis));
if(dfs(i)) ans++;
}
}
printf("%d\n",n - ans);
}
int main()
{
int t, m, u, v;
scanf("%d",&t);
while(t--)
{
scanf("%d %d" ,&n, &m);
memset(gra, 0, sizeof(gra));
for( int i = 0; i < m; i++)
{
scanf("%d %d",&u, &v);
u--, v--;
gra[u][v] = 1;
}
solve();
}
return 0;
}