POJ-3041-建图/二分图匹配/网络流

Asteroids

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 26351		Accepted: 14254

Description

Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid. 

Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot.This weapon is quite expensive, so she wishes to use it sparingly.Given the location of all the asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids.

Input

* Line 1: Two integers N and K, separated by a single space. 
* Lines 2..K+1: Each line contains two space-separated integers R and C (1 <= R, C <= N) denoting the row and column coordinates of an asteroid, respectively.

Output

* Line 1: The integer representing the minimum number of times Bessie must shoot.

Sample Input

3 4
1 1
1 3
2 2
3 2

Sample Output

2

Hint

INPUT DETAILS: 
The following diagram represents the data, where "X" is an asteroid and "." is empty space: 
X.X 
.X. 
.X. 

OUTPUT DETAILS: 
Bessie may fire across row 1 to destroy the asteroids at (1,1) and (1,3), and then she may fire down column 2 to destroy the asteroids at (2,2) and (3,2).

Source

 

　　给出一个N*N的地图，和数个障碍物的位置(i,j) 每次操作可以将某一行或者某一列的障碍物都清楚，问最少的操作次数。

　　每一行/列缩一个点，对于每个(i,j)，就把行i点和列j点连一条边，这样每一条边就对应着一个障碍物，操作转化为选取一个点之后，与这个点相连的边对应的障碍物都将被清除，问最少选出几个点能覆盖所有的边，又二分图中最小点覆盖=最大匹配数，所以就是求一个最大匹配。

　　这个题网络流也能解，按理说复杂度比匈牙利低，建图思路一样，行向列建边容量为1，源点向行点建边，列点向汇点建边跑最大流。

　　按理说树dp也可以求最小点覆盖但是一直WA不知为何= =

　　匈牙利:

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<vector>
 5 using namespace std;
 6 int match[510],N;
 7 bool vis[510];
 8 vector<int>g[510];
 9 int dfs(int u){
10     for(int i=0;i<g[u].size();++i){
11         if(!vis[g[u][i]]){
12             vis[g[u][i]]=1;
13             if(match[g[u][i]]==-1||dfs(match[g[u][i]])){
14                 match[g[u][i]]=u;
15                 return 1;
16             }
17         }
18     }
19     return 0;
20 }
21 int main() {
22     int t,n,m,i,j;
23         scanf("%d%d",&n,&m);
24         for(i=1;i<=n;++i)g[i].clear();
25         N=n;
26         while(m--){
27             scanf("%d%d",&i,&j);
28             g[i].push_back(j);
29         }
30     memset(match,-1,sizeof(match));
31     int ans=0;
32     for(i=1;i<=n;++i){
33         memset(vis,0,sizeof(vis));
34         ans+=dfs(i);
35     }
36     cout<<ans<<endl;
37     return 0;
38 }                

 

 

dinic:

　　

 1        
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<cstring>
 5 #include<queue>
 6 #include<vector>
 7 #include<cstdlib>
 8 using namespace std;
 9 #define inf 0x3f3f3f3f
10 struct Edge{
11     int v,cap,flow,next;
12 }e[50050];
13 int first[1010],tot,N;
14 int d[1010],cur[1010];
15 bool vis[1010];
16 void add(int u,int v,int cap){
17     e[tot].v=v;
18     e[tot].cap=cap;
19     e[tot].flow=0;
20     e[tot].next=first[u];
21     first[u]=tot++;
22 }
23 bool bfs(){
24     memset(vis,0,sizeof(vis));
25     queue<int>q;
26     q.push(0);
27     d[0]=0;
28     vis[0]=1;
29     while(!q.empty()){
30         int u=q.front();
31         q.pop();
32         for(int i=first[u];~i;i=e[i].next){
33             if(!vis[e[i].v] && e[i].cap>e[i].flow){
34                 vis[e[i].v]=1;
35                 d[e[i].v]=d[u]+1;
36                 q.push(e[i].v);
37             }
38         }
39     }
40     return vis[N*2+1];
41 }
42 int dfs(int x,int a){
43     if(x==N*2+1 || a==0) return a;
44     int flow=0,f;
45     for(int &i=cur[x];~i;i=e[i].next){
46         if(d[x]+1==d[e[i].v] && (f=dfs(e[i].v,min(a,e[i].cap-e[i].flow)))>0){
47             e[i].flow+=f;
48             e[i^1].flow-=f;
49             flow+=f;
50             a-=f;
51             if(a==0) break;
52         }
53     }
54     return flow;
55 }
56 int solve(){
57     int ans=0;
58     while(bfs()){
59         for(int i=0;i<=N*2+1;++i)cur[i]=first[i];
60         ans+=dfs(0,inf);
61     }
62     return ans;
63 }
64 int main(){
65     int m,i,j;
66     while(cin>>N>>m){
67         memset(first,-1,sizeof(first));
68         tot=0;
69         for(i=1;i<=N;++i){
70             add(0,i,1);
71             add(i,0,0);
72             add(i+N,N*2+1,1);
73             add(N*2+1,i+N,0);
74         }
75         while(m--){
76             scanf("%d%d",&i,&j);
77             add(i,j+N,1);
78             add(j+N,i,0);
79         }
80         cout<<solve()<<endl;
81     }
82     return 0;
83 }

 

转载于:https://www.cnblogs.com/zzqc/p/9494426.html