pku 1422 Air Raid 最小路径覆盖图 解题报告

pku 1422 Air Raid 最小路径覆盖图 解题报告

经过队友分析,是最小路径覆盖图。于是自己仔细分析一下,果然是这样,马上写,就a了。

仍然懒得只贴代码:

 

#include <stdio.h>

#include <string.h>

#define M 125

 

int n, m, ans;

int map[M][M], link[M];

bool visit[M];

 

bool find(int a)

{

       for (int i = 1; i <= n; i++)

       {

              if (map[a][i] == 1 && !visit[i])

              {

                     visit[i] = true;

                     if (link[i] == 0 || find(link[i]))

                     {

                            link[i] = a;

                            return true;;

                     }

              }

       }

       return false;

}

 

int main()

{

//reopen("1.txt", "r", stdin);

       int i, j, x, y, test;

       scanf("%d", &test);

       while (test--)

       {

              scanf("%d%d", &n, &m);

              for (i = 0; i <= n; i++)

              {

                     link[i] = 0;

                     for (j = 0; j <= n; j++)

                     {

                            map[i][j] = 0;

                     }

              }

              for (i = 1; i <= m; i++)

              {

                     scanf("%d%d", &x, &y);

                     map[x][y] = 1;

              }

              ans = 0;

              for (i = 1; i <= n; i++)

              {

                     memset(visit, 0, sizeof(visit));

                     if (find(i))

                     {

                            ans++;

                     }

              }

              printf("%d/n", n - ans);

       }

       return 0;

}