奔小康赚大钱 HDU - 2255 题目链接
题意
村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。
现在这个问题就是村领导怎样分配房子才能使收入最大.
DFS O(n^4)写法
#include <bits/stdc++.h>
using namespace std;
const int N = 407;
const int INF = 0x3f3f3f3f;
int g[N][N];
int visx[N],visy[N];
int match[N],slack[N];
int lx[N],ly[N];
int n;
bool Find(int x)
{
visx[x] = 1;
for (int y = 1; y <= n; y++){
if (visy[y]) continue;
int delta = lx[x] + ly[y] - g[x][y];
if (delta) slack[y] = min(slack[y],delta);
else {
visy[y] = 1;
if (match[y] == -1 || Find(match[y])){
match[y] = x;
return true;
}
}
}
return false;
}
void dfs(int s)
{
memset(slack,0x3f,sizeof(slack));
while(true){
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if (Find(s)) break;
else {
int delta = INF;
for (int y = 1; y <= n; y++){
if (!visy[y]){
delta = min(delta,slack[y]);
}
}
for (int i = 1; i <= n; i++){
if (visx[i]) {
lx[i] -= delta;
}
if (visy[i]){
ly[i] += delta;
}
else {
slack[i] -= delta;
}
}
}
}
}
void solve()
{
for (int i = 1; i <= n; i++){
lx[i] = -INF;
ly[i] = 0;
for (int j = 1; j <= n; j++){
lx[i] = max(g[i][j],lx[i]);
}
}
memset(match,-1,sizeof(match));
for (int i = 1; i <= n; i++){
dfs(i);
}
}
int main()
{
while(scanf("%d",&n) == 1){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
scanf("%d",&g[i][j]);
}
}
solve();
int ans = 0;
for (int i = 1; i <= n; i++){
if (match[i] != -1){
ans += g[match[i]][i];
}
}
cout << ans << endl;
}
return 0;
}
BFS O(n^3) 写法
思路
设置左边为lx,右边为ly,lx置为所连接边权的最大值,ly置为0
扫描右边的点(在这里计作v),找到与之匹配的 lx[i] + ly[v] == g[i][v] ,设置fl[i] = v,fr[v] = i;
没有找到就改变顶标,继续寻找,如果还没有找到,而且符合 lx[i] + ly[v] == g[i][v] 的边已经配对成功,则将已配对的点v进行重新匹配,改变对应的fl[i],fr[v]
依次进行以上步骤,直到没有可加入的边
#include <bits/stdc++.h>
using namespace std;
const int N = 407;
const int INF = 0x3f3f3f3f;
int g[N][N];
int lx[N],ly[N],slack[N];
int fl[N],fr[N]; /// 存放对应的连接点
int visx[N],visy[N];
int pre[N],q[N];
int n,l,r;
bool check(int x)
{
visx[x] = 1;
if (fl[x] != -1){
q[r++] = fl[x];
visy[fl[x]] = 1;
return true;
}
while (x != -1){
fl[x] = pre[x];
swap(x,fr[pre[x]]);
}
return false;
}
void bfs(int s)
{
memset(slack,0x3f,sizeof(slack));
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
l = 0;
r = 1;
q[0] = s;
visy[s] = 1;;
while (true){
int delta;
while (l < r){
int v = q[l++];
for (int i = 1; i <= n; ++i){
if (!visx[i] && slack[i] >= (delta = lx[i] + ly[v] - g[i][v])){
pre[i] = v;
if (delta){
slack[i] = delta;
}
else if (!check(i))
return;
}
}
}
delta = INF;
for (int i = 1; i <= n; ++i){
if (!visx[i] && delta > slack[i]){
delta = slack[i];
}
}
for (int i = 1; i <= n; i++){
if (visx[i])
lx[i] += delta;
else
slack[i] -= delta;
if (visy[i])
ly[i] -= delta;
}
for (int i = 1; i <= n; ++i){
if (!visx[i] && !slack[i] && !check(i))
return;
}
}
}
void solve()
{
memset(fl,-1,sizeof(fl));
memset(fr,-1,sizeof(fr));
for (int i = 1; i <= n; ++i){
lx[i] = -INF;
ly[i] = 0;
for (int j = 1; j <= n; j++){
lx[i] = max(g[i][j],lx[i]);
}
}
for (int i = 1; i <= n; i++){
bfs(i);
}
}
int main()
{
while(scanf("%d",&n) == 1){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
scanf("%d",&g[i][j]);
}
}
solve();
int ans = 0;
for (int i = 0; i <= n; i++){
ans += g[i][fl[i]];
}
cout << ans << endl;
}
return 0;
}
Tour HDU - 3488 题目链接
题意
有N个城市,M条街道,每条街道是单向的,现在要你设计多条路线覆盖所有的点,每条路线都是一个环,并且每个点仅能被一条路线覆盖且只经过一次(终始点除外)
思路
入度和出度就能代表二分图的两边
题目求最小权,全部权值取反求最大权即可
(这道题有重边)
#include <bits/stdc++.h>
using namespace std;
const int N = 407;
const int INF = 0x3f3f3f3f;
int g[N][N];
int visx[N],visy[N];
int match[N],slack[N];
int lx[N],ly[N];
int n;
bool Find(int x)
{
visx[x] = 1;
for (int y = 1; y <= n; y++){
if (visy[y]) continue;
int delta = lx[x] + ly[y] - g[x][y];
if (delta) slack[y] = min(slack[y],delta);
else {
visy[y] = 1;
if (match[y] == -1 || Find(match[y])){
match[y] = x;
return true;
}
}
}
return false;
}
void dfs(int x)
{
memset(slack,0x3f,sizeof(slack));
while(true){
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if (Find(x)) break;
else {
int delta = INF;
for (int i = 1; i <= n; i++){
if (!visy[i]){
delta = min(delta,slack[i]);
}
}
for (int i = 1; i <= n; i++){
if (visx[i]){
lx[i] -= delta;
}
if (visy[i]){
ly[i] += delta;
}
else {
slack[i] -= delta;
}
}
}
}
}
void solve()
{
for (int i = 1; i <= n; i++){
lx[i] = -INF;
ly[i] = 0;
for (int j = 1; j <= n; j++){
lx[i] = max(g[i][j],lx[i]);
}
}
memset(match,-1,sizeof(match));
for (int i = 1; i <= n; i++){
dfs(i);
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
int m;
scanf("%d %d",&n,&m);
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
g[i][j] = -INF;
}
}
for (int i = 0; i < m; i++){
int u,v,w;
scanf("%d %d %d",&u,&v,&w);
g[u][v] = max(g[u][v],-w);
}
solve();
int ans = 0;
for (int i = 1; i <= n; i++){
ans += g[match[i]][i];
}
cout << -ans << endl;
}
return 0;
}
HDU 2426 题目链接
题意
n个学生,m个房间,给定一些学生想住房的喜欢度,找一个最优方案使得每个学生分配一个房间,并且使得喜欢度最大,注意这题有个坑,就是学生不会住喜欢度为负的房间
疑问
没有 if (w >= 0) 这个判断就会WA
#include <bits/stdc++.h>
using namespace std;
const int N = 555;
const int INF = 0x3f3f3f3f;
int g[N][N];
int visx[N],visy[N],slack[N];
int lx[N],ly[N];
int link[N];
int n;
bool dfs(int x)
{
visx[x] = 1;
for (int i = 1; i <= n; i++){
if (visy[i]) continue;
int delta = lx[x] + ly[i] - g[x][i];
if (delta) slack[i] = min(slack[i],delta);
else {
visy[i] = 1;
if (link[i] == -1 || dfs(link[i])){
link[i] = x;
return true;
}
}
}
return false;
}
void km(int x)
{
memset(slack,0x3f,sizeof(slack));
while(true){
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if (dfs(x)) break;
else {
int delta = INF;
for (int i = 1; i <= n; i++){
if (visy[i]) continue;
delta = min(delta,slack[i]);
}
for (int i = 1; i <= n; i++){
if (visx[i]){
lx[i] -= delta;
}
if (visy[i]){
ly[i] += delta;
}
else slack[i] -= delta;
}
}
}
}
int solve(int nx)
{
for (int i = 1; i <= n; i++){
lx[i] = -INF;
ly[i] = 0;
for (int j = 1; j <= n; j++){
lx[i] = max(lx[i],g[i][j]);
}
}
memset(link,-1,sizeof(link));
for (int i = 1; i <= n; i++){
km(i);
}
int ans = 0;
for (int i = 1; i <= n; i++){
if (link[i] <= nx){
ans += g[link[i]][i];
}
}
return ans;
}
int main()
{
int nx,ny,m;
int Case = 1;
while(scanf("%d %d %d",&nx,&ny,&m) == 3){
n = max(nx,ny);
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
g[i][j] = -INF;
}
}
for (int i = 0; i < m; i++){
int u,v,w;
scanf("%d %d %d",&u,&v,&w);
u++;
v++;
if (w >= 0) g[u][v] = max(g[u][v],w);
}
if (nx > ny || !m){
printf("Case %d: -1\n",Case++);
continue;
}
printf("Case %d: %d\n",Case++,solve(nx));
}
return 0;
}
Assignment HDU 2853 题目链接
题意:
给定一个二分图,N个点对应M个点,两两之间存在一组关系,每组关系一个权值。题目中了给定了一个匹配方案,现在要求满足这组关系中的最大的匹配权值在原方案上增长了多少?并且还要求出在原匹配方案上改变(最少)多少条边才能够得到这个最大匹配?
思路(别人的想法,非常巧妙)
将原计划边和非计划边区分开来
原计划边: 乘上K倍加一
其他边:乘上K倍
满足条件(K>= N + 1)
这样就能保证极端情况下结果仍然正确:
假设
最优方案 : sum1
次优方案:sum2
sum1 - sum2 == 1
最优方案中一条计划边都没有
次优方案选择全部的 计划边
此时最优方案为:sum1 * K
次优方案:sum2 * K + N
要保证sum1 * K > sum2 * K + N
解得:K > N
结果:
ans % K 即 选择计划边的数目
ans / K - pre / K 即 增加的权值
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int INF = 0x3f3f3f3f;
int g[N][N];
int visx[N],visy[N];
int match[N],slack[N];
int lx[N],ly[N];
int n,nx,ny;
bool Find(int x)
{
visx[x] = 1;
for (int y = 1; y <= ny; y++){
if (visy[y]) continue;
int delta = lx[x] + ly[y] - g[x][y];
if (delta) slack[y] = min(slack[y],delta);
else {
visy[y] = 1;
if (match[y] == -1 || Find(match[y])){
match[y] = x;
return true;
}
}
}
return false;
}
void dfs(int s)
{
memset(slack,0x3f,sizeof(slack));
while(true){
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if (Find(s)) break;
else {
int delta = INF;
for (int y = 1; y <= ny; y++){
if (!visy[y]){
delta = min(delta,slack[y]);
}
}
for (int i = 1; i <= nx; i++){
if (visx[i]) lx[i] -= delta;
}
for (int i = 1; i <= ny; i++){
if (visy[i]){
ly[i] += delta;
}
else {
slack[i] -= delta;
}
}
}
}
}
void solve()
{
memset(lx,0,sizeof(lx));
memset(ly,0,sizeof(ly));
memset(match,-1,sizeof(match));
for (int i = 1; i <= nx; i++){
for (int j = 1; j <= ny; j++){
lx[i] = max(g[i][j],lx[i]);
}
}
for (int i = 1; i <= nx; i++){
dfs(i);
}
}
int main()
{
while(scanf("%d %d",&nx,&ny) == 2){
for (int i = 1; i <= nx; i++){
for (int j = 1; j <= ny; j++){
scanf("%d",&g[i][j]);
g[i][j] *= 111;
}
}
int pre = 0;
for (int i = 1; i <= nx; i++){
int x;
scanf("%d",&x);
pre += g[i][x];
g[i][x]++;
}
solve();
int ans = 0;
for (int i = 1; i <= ny; i++){
if (match[i] != -1){
ans += g[match[i]][i];
}
}
cout << nx - ans % 111 << " " << ans / 111 - pre / 111 << endl;
}
return 0;
}
Similarity HDU 3718 题目链接
题意
有两串字符串,他们都是分类的结果.第一行是正确结果,第二行是需要你判断的.
现在给你很多字符串,要你输出最大相似率.
思路
每一对字母映射就在相应的边权加一,如何求最大权匹配即可
(我用O(n4)超时,可能是我的O(n4)有点垃圾)
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int INF = 0x3f3f3f3f;
int g[N][N];
int lx[N],ly[N],slack[N];
int fl[N],fr[N]; /// 存放对应的连接点
int visx[N],visy[N];
int pre[N],q[N];
int n,l,r;
map<char,int> mp1,mp2;
char str1[11111];
bool check(int x)
{
visx[x] = 1;
if (fl[x] != -1){
q[r++] = fl[x];
visy[fl[x]] = 1;
return true;
}
while (x != -1){
fl[x] = pre[x];
swap(x,fr[pre[x]]);
}
return false;
}
void bfs(int s)
{
memset(slack,0x3f,sizeof(slack));
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
l = 0;
r = 1;
q[0] = s;
visy[s] = 1;;
while (true){
int delta;
while (l < r){
int v = q[l++];
for (int i = 1; i <= n; ++i){
if (!visx[i] && slack[i] >= (delta = lx[i] + ly[v] - g[i][v])){
pre[i] = v;
if (delta){
slack[i] = delta;
}
else if (!check(i))
return;
}
}
}
delta = INF;
for (int i = 1; i <= n; ++i){
if (!visx[i] && delta > slack[i]){
delta = slack[i];
}
}
for (int i = 1; i <= n; i++){
if (visx[i])
lx[i] += delta;
else
slack[i] -= delta;
if (visy[i])
ly[i] -= delta;
}
for (int i = 1; i <= n; ++i){
if (!visx[i] && !slack[i] && !check(i))
return;
}
}
}
void solve()
{
memset(fl,-1,sizeof(fl));
memset(fr,-1,sizeof(fr));
for (int i = 1; i <= n; ++i){
lx[i] = -INF;
ly[i] = 0;
for (int j = 1; j <= n; j++){
lx[i] = max(g[i][j],lx[i]);
}
}
for (int i = 1; i <= n; i++){
bfs(i);
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
int n1,m,k;
scanf("%d %d %d",&n1,&k,&m);
mp1.clear();
int nx = 0;
for (int i = 0; i < n1; i++){
char ch;
scanf(" %c",&ch);
str1[i] = ch;
if (!mp1[ch]) mp1[ch] = ++nx;
}
for (int i = 0; i < m; i++){
int ny = 0;
mp2.clear();
memset(g,0,sizeof(g));
for (int i = 0; i < n1; i++){
char ch;
scanf(" %c",&ch);
if (!mp2[ch]) mp2[ch] = ++ny;
int x = mp1[str1[i]];
g[x][mp2[ch]]++;
}
n = max(nx,ny);
solve();
int ans = 0;
for (int i = 1; i <= nx; i++){
if (fl[i] != -1){
ans += g[i][fl[i]];
}
}
printf("%.4f\n",(double)ans / n1);
}
}
return 0;
}
HDU 3523 题目链接
题意
有m个数列Q1、Q2、Qm,每个数列有n个数(1-n排列),让你找到一个数列T使得题意中的公式取得的值最小
思路
遍历每一列中的1-n,求得这n个数对应的权值,然后建图,就是n-n的二分图最小权匹配了
#include <bits/stdc++.h>
using namespace std;
const int N = 111;
const int INF = 0x3f3f3f3f;
int g[N][N];
int n;
int match[N];
int visx[N],visy[N];
int lx[N],ly[N];
int slack[N];
int a[N][N];
bool Find(int x)
{
visx[x] = 1;
for (int i = 1; i <= n; i++){
if (visy[i]) continue;
int delta = lx[x] + ly[i] - g[x][i];
if (delta) slack[i] = min(slack[i],delta);
else {
visy[i] = 1;
if (match[i] == -1 || Find(match[i])){
match[i] = x;
return true;
}
}
}
return false;
}
void dfs(int x)
{
memset(slack,0x3f,sizeof(slack));
while(true){
memset(visx,0,sizeof(visx));
memset(visy,0,sizeof(visy));
if (Find(x)) break;
else {
int delta = INF;
for (int i = 1; i <= n; i++){
if (!visy[i]) delta = min(delta,slack[i]);
}
for (int i = 1; i <= n; i++){
if (visx[i]){
lx[i] -= delta;
}
if (visy[i]){
ly[i] += delta;
}
else slack[i] -= delta;
}
}
}
}
void solve()
{
memset(ly,0,sizeof(ly));
for (int i = 1; i <= n; i++){
lx[i] = -INF;
for (int j = 1; j <= n; j++){
lx[i] = max(lx[i],g[i][j]);
}
}
memset(match,-1,sizeof(match));
for (int i = 1; i <= n; i++){
dfs(i);
}
}
int main()
{
int t,Case = 1;
scanf("%d",&t);
while(t--){
int m;
scanf("%d %d",&n,&m);
for (int i = 1; i <= m; i++){
for (int j = 1; j <= n; j++){
scanf("%d",&a[i][j]);
}
}
memset(g,0,sizeof(g));
for (int k = 1; k <= n; k++){
for (int i = 1; i <= m; i++){
for (int j = 1; j <= n; j++){
g[j][k] -= abs(k - a[i][j]);
}
}
}
solve();
int ans = 0;
for (int i = 1; i <= n; i++){
if (match[i] != -1){
ans += g[match[i]][i];
}
}
printf("Case #%d: %d\n",Case++,-ans);
}
return 0;
}