【ACM】CCF-201403-4 无线网络 图论的应用

#include <stdio.h>
#include <string.h>
#define LOCAL
typedef long long LL;
struct point {
    int x,y;
};
int n,m,kk,r;
int edge[205][205];//count from 1
point p[205];
int cnt[205][205];
void print() {
    printf("edge:\n");
    for(int i=1; i<=n+m; i++) {
        for(int j=1; j<=n+m; j++) {
            printf("%d ",edge[i][j]);
        }
        printf("\n");
    }
    printf("cnt:\n");
    for(int i=1; i<=n+m; i++) {
        for(int j=1; j<=n+m; j++) {
            printf("%d ",cnt[i][j]);
        }
        printf("\n");
    }
}
int main() {
#ifdef LOCAL
    freopen("data.in","r",stdin);
//    freopen("data.out","w+",stdout);
#endif
    while(scanf("%d%d%d%d",&n,&m,&kk,&r)!=EOF) {//编号大于n的是可添加路由器
        memset(edge,-1,sizeof(edge));
        memset(cnt,0,sizeof(cnt));
        for(int i=0; i<n+m; i++) {
            scanf("%d%d",&p[i].x,&p[i].y);
        }
        for(int i=0; i<n+m-1; i++) {
            for(int j=i+1; j<n+m; j++) {
                if(LL(p[i].x-p[j].x)*(p[i].x-p[j].x)+LL(p[i].y-p[j].y)*(p[i].y-p[j].y)<=LL(r)*r)
                    edge[i+1][j+1]=edge[j+1][i+1]=1;
            }
        }
        for(int i=1; i<=n+m; i++) edge[i][i]=0;
        for(int i=n+1; i<=n+m; i++) cnt[i][i]=1;
        for(int k=1; k<=n+m; k++) {
            for(int i=1; i<=n+m; i++) {
                for(int j=1; j<=n+m; j++) {
                    //printf("k:%d i:%d j:%d\n",k,i,j);
                    if(edge[i][k]==-1||edge[k][j]==-1) {
                        continue;
                    }
                    if(edge[i][j]==-1||edge[i][k]+edge[k][j]<edge[i][j]) {
                        if(k>n) {
                            if(cnt[i][k]+cnt[k][j]-1<=kk) {
                                edge[i][j]=edge[i][k]+edge[k][j];
                                cnt[i][j]=cnt[i][k]+cnt[k][j]-1;
                            }
                        } else {
                            if(cnt[i][k]+cnt[k][j]<=kk) {
                                edge[i][j]=edge[i][k]+edge[k][j];
                                cnt[i][j]=cnt[i][k]+cnt[k][j];
                            }

                        }
                    }
                }
            }
        }
        printf("%d\n",edge[1][2]-1);
    }
    return 0;
}