hdu 1498 50 years, 50 colors

 1 #include <cstring>
 2 #include <cstdio>
 3 
 4 short G[101][101];
 5 bool vis[101];
 6 short match[101];
 7 short n;
 8 
 9 bool dfs(short x, short c)
10 {
11     int i;
12 
13     for(i=0;i<n;i++)
14     {
15         if(G[x][i] == c && !vis[i]){
16             vis[i] = true;
17             if(match[i] == -1 || dfs(match[i],c)){
18                 match[i] = x;
19                 return true;
20             }
21         }
22     }
23     return false;
24 }
25 
26 int main()
27 {
28     short i, j, k, l, p;
29     short ans[51];
30 
31     while(scanf("%d %d",&n,&k),n+k){
32         for(i=0;i<n;i++)
33             for(j=0;j<n;j++)
34                 scanf("%d",&G[i][j]);
35         l = 0;
36         for(i=1;i<51;i++)
37         {
38             p = 0;
39             memset(match,-1,sizeof(match));
40             for(j=0;j<n;j++)
41             {
42                 memset(vis,0,sizeof(vis));
43                 p += dfs(j, i);
44             }
45             if(p>k)
46                 ans[l++] = i;
47         }
48         if(!l)
49             printf("-1\n");
50         else {
51             for(i=0;i<l;i++)
52                 printf("%d%c",ans[i],i==l-1?‘\n‘:‘ ‘);
53         }
54     }
55     return 0;
56 }