poj2536 Gopher II

最新推荐文章于 2019-08-10 21:11:00 发布

冬天的一缕阳光

最新推荐文章于 2019-08-10 21:11:00 发布

阅读量711

点赞数

分类专栏：搜索（DFS）文章标签： poj2536 Gopher II The gopher family having averted the c must face a new pred

本文链接：https://blog.csdn.net/tangsl388/article/details/22820639

版权

搜索（DFS）专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Gopher II

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 6168		Accepted: 2547

Description

The gopher family, having averted the canine threat, must face a new predator.

The are n gophers and m gopher holes, each at distinct (x, y) coordinates. A hawk arrives and if a gopher does not reach a hole in s seconds it is vulnerable to being eaten. A hole can save at most one gopher. All the gophers run at the same velocity v. The gopher family needs an escape strategy that minimizes the number of vulnerable gophers.

Input

The input contains several cases. The first line of each case contains four positive integers less than 100: n, m, s, and v. The next n lines give the coordinates of the gophers; the following m lines give the coordinates of the gopher holes. All distances are in metres; all times are in seconds; all velocities are in metres per second.

Output

Output consists of a single line for each case, giving the number of vulnerable gophers.

Sample Input

2 2 5 10
1.0 1.0
2.0 2.0
100.0 100.0
20.0 20.0

Sample Output

题意：就是有n个老鼠和m个洞，现在老鹰要抓老鼠，老鼠要逃到洞中。如果时间大于s则会被老鼠抓住，求老鹰抓的最少数的老鼠。

本题就一个简单的二分图，把洞离老鼠的距离小与s*v的当作一条边，即把老鼠看作一个集合，洞看作一个集合，现在就找边

代码：

#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<sstream>
#include<cassert>
using namespace std;
#define LL __int64
#define maxn 1500
#define eps 1e-6
struct point {
    double x,y;
};
point a[1500];
point b[1500];
double dis(point c,point d) {
    double ans=sqrt((c.x-d.x)*(c.x-d.x)+(c.y-d.y)*(c.y-d.y));
    return ans;
}

int n,m,s,v;
bool g[maxn][maxn];
int x[maxn],y[maxn];
bool chk[maxn];
bool searchpath(int u) {
    int v;
    for(v=1; v<=m+n; v++) {
        if(g[u][v]&&!chk[v]) {
            chk[v]=true;
            if(y[v]==-1||searchpath(y[v])) {
                y[v]=u;
                x[u]=v;
                return true;
            }
        }
    }
    return false;
}

int fun() {
    int u,res=0;
    memset(x,-1,sizeof(x));
    memset(y,-1,sizeof(y));
    for(u=1; u<=n; u++) {
        if(x[u]==-1) {
            memset(chk,false,sizeof(chk));
        }
        if(searchpath(u)) res++;
    }
    return res;
}


int main() {

    while(cin>>n>>m>>s>>v) {
        for(int i=1; i<=n; i++) {
            cin>>a[i].x>>a[i].y;
        }
        for(int i=1; i<=m; i++) {
            cin>>b[i].x>>b[i].y;
        }
        double di=(double)s*v;
        memset(g,false,sizeof(g));
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=m; j++) {
                if(dis(a[i],b[j])<=di+eps) {
                    g[i][j]=true;
                }
            }
        }
        int aa=n-fun();
        cout<<aa<<endl;
    }
    return 0;
}
/*

2 2 5 10
1.0 1.0
2.0 2.0
100.0 100.0
20.0 20.0

*/