here slack

HDU_2813 To avoid time-out when reading data, hash can be used for processing, and then non-Repeated names can be taken out for a vertex, then use the KM algorithm to find the optimal matching for the bipartite graph. #include#include#include#define MAXD 210#define MAXM 40010#define INF 1000000000#define HASH 10007int headL[HASH], nextL[MAXM], headC[HASH], nextC[MAXM];int N, M, K, G[MAXD][MAXD], yM[MAXD], MAX;int A[MAXD], B[MAXD], slack[MAXD];int vis

HDU_1533 The shortest distance between people and houses is the distance between Manhattan. After creating the image, apply the KM algorithm to obtain the optimal matching of the Bipartite Graph. #include#include#include#define MAXD 110#define MAX 10010#define INF 1000000000int N, hx[MAXD], hy[MAXD], px[MAXD], py[MAXD];int a[MAXD][MAXD], G[MAXD][MAXD], yM[MAXD];int A[MAXD], B[MAXD], slack, visx[MAXD], visy[MAXD];char b[MAXD];int init(){int i, j, k, n

], slack;int visx[MAXD], visy[MAXD];void init (){int i, j;for(i = 0; i for(j = 0; j { scanf("%d", G[i][j]); G[i][j] *= 10; } sum = 0;for(i = 0; i { scanf("%d", j); j --; sum += G[i][j] / 10; G[i][j] ++; }}int searchpath(int u){int v, temp; visx[u] = 1;for(v = 0; v if(!visy[v]) { temp = A[u] + B[v] - G[u][v];if(temp == 0) { visy[v]

HDU_3772 We can split a string into two vertices to represent the inbound and outbound degrees, and then use the KM algorithm to perform Optimal Matching for the bipartite graph. #include#include#define MAXD 210#define INF 1000000000char b[MAXD][1010];int G[MAXD][MAXD] , yM[MAXD], N;int A[MAXD], B[MAXD], slack;int visx[MAXD], visy[MAXD];int check(char *str1, char *str2){int i, j, num = 0; i =strlen(str1) - 1;for(j = 0; str1[i] == str2[j] i >= 0

Uva_000046 This topic can be done with the minimum cost and the maximum flow. In order to review the optimal matching of the bipartite graph, we wrote a KM program. At first, because I had not processed the double KM before, I was going to multiply the decimal number by a certain power of 10 into an integer, but I found that WA was always there, and then I simply wrote it using double, and then the AC. #include#include#include#define MAXD 30#define INF 1000000000int N, M, xM[MAXD], yM[MAXD] ,vis

; - inttmp=lx[x]+ly[y]-G[x][y]; + if(tmp==0){ Avisy[y]=true; at if(linker[y]==-1||DFS (Linker[y])) { -linker[y]=x; - return true; - } -}Else if(slack[y]>tmp) { -slack[y]=tmp; in } - } to return false; + } - intKM () { thememset (linker,-1,sizeof(linker)); *memset (Ly,0,sizeof(ly)); $ for(intI=0; i){Panax Notoginsenglx[i]=-INF; -

students as X-sets, M-rooms as the Y-set, and then call the KM algorithm to be able. 1#include 2#include 3#include 4#include 5#include 6#include 7 #defineINF 0x7fffffff8 using namespacestd;9 Const intmaxn= -+Ten;Ten One intn,m; A intLX[MAXN],LY[MAXN],VISX[MAXN],VISY[MAXN]; - intLINK[MAXN],SLACK[MAXN],W[MAXN][MAXN]; - the intDfsintx) - { -visx[x]=1; - for(inty=1; yif(w[x][y]!=-1) + { - if(Visy[y])Continue; + intt=lx[x]+ly[y]