forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path218.cpp
More file actions
66 lines (60 loc) · 1.48 KB
/
218.cpp
File metadata and controls
66 lines (60 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//ac
#include <iostream>
#include <cstdio>
#include <string>
#define MAXN 500
#define inf 1000000000
#define _clr(x) memset(x,0xff,sizeof(int)*n)
int hungary(int m,int n,int mat[][MAXN],int* match1,int* match2){
int s[MAXN],t[MAXN],p,q,ret=0,i,j,k;
if (m>n) return 0;
for (_clr(match1),_clr(match2),i=0;i<m&&ret==i;ret+=(match1[i++]>=0))
for (_clr(t),s[p=q=0]=i;p<=q&&match1[i]<0;p++)
for (k=s[p],j=0;j<n&&match1[i]<0;j++)
if (mat[k][j]&&t[j]<0){
s[++q]=match2[j],t[j]=k;
if (s[q]<0)
for (p=j;p>=0;j=p)
match2[j]=k=t[j],p=match1[k],match1[k]=j;
}
return ret==m;
};
int n;
int mat[MAXN][MAXN];
int mm[MAXN][MAXN];
int match1[MAXN], match2[MAXN];
int main() {
scanf("%d", &n);
int left = inf, right = -inf;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%d", &mat[i][j]);
if (mat[i][j] < left) left = mat[i][j];
if (mat[i][j] > right) right = mat[i][j];
}
}
while (left <= right) {
int mid = (left + right) / 2;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (mat[i][j] <= mid) mm[i][j] = 1;
else mm[i][j] = 0;
}
}
int ret = hungary(n, n, mm, match1, match2);
if (ret == 1) right = mid - 1;
else left = mid + 1;
}
printf("%d\n", left);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (mat[i][j] <= left) mm[i][j] = 1;
else mm[i][j] = 0;
}
}
hungary(n, n, mm, match1, match2);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", i + 1, match1[i] + 1);
}
return 0;
}