PKU ACM poj 1161 源代码

大体思路：

1. 题目给的图是将“城”作为顶点，而解题需要将“区域”作为顶点；

2.根据输入得到图的结构（关键是判断两个区域是否相邻），相邻的区域权值为1；

3.用Floyd计算任意两点的最短距离；

4.计算每个人到每个顶点（即“区域”）的最短距离；

5.求最终结果。

 

 

注：110ms和94ms(效率优化后)是使用Floyd算法，而219ms是使用回溯+剪支算法。

 

源代码如下：

 

/*Walls Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6268 Accepted: 3164 Description In a country, great walls have been built in such a way that every great wall connects exactly two towns. The great walls do not cross each other. Thus, the country is divided into such regions that to move from one region to another, it is necessary to go through a town or cross a great wall. For any two towns A and B, there is at most one great wall with one end in A and the other in B, and further, it is possible to go from A to B by always walking in a town or along a great wall. The input format implies additional restrictions. There is a club whose members live in the towns. In each town, there is only one member or there are no members at all. The members want to meet in one of the regions (outside of any town). The members travel riding their bicycles. They do not want to enter any towns, because of the traffic, and they want to cross as few great walls as possible, as it is a lot of trouble. To go to the meeting region, each member needs to cross a number (possibly 0) of great walls. They want to find such an optimal region that the sum of these numbers (crossing-sum, for short) is minimized. The towns are labeled with integers from 1 to N, where N is the number of towns. In Figure 1, the labeled nodes represent the towns and the lines connecting the nodes represent the great walls. Suppose that there are three members, who live in towns 3, 6, and 9. Then, an optimal meeting region and respective routes for members are shown in Figure 2. The crossing-sum is 2: the member from town 9 has to cross the great wall between towns 2 and 4, and the member from town 6 has to cross the great wall between towns 4 and 7. You are to write a program which, given the towns, the regions, and the club member home towns, computes the optimal region(s) and the minimal crossing-sum. Input Your program is to read from standard input. The first line contains one integer: the number of regions M, 2 <= M <= 200. The second line contains one integer: the number of towns N, 3 <= N <= 250. The third line contains one integer: the number of club members L, 1 <= L <= 30, L <= N. The fourth line contains L distinct integers in increasing order: the labels of the towns where the members live. After that the input contains 2M lines so that there is a pair of lines for each region: the first two of the 2M lines describe the first region, the following two the second and so on. Of the pair, the first line shows the number of towns I on the border of that region. The second line of the pair contains I integers: the labels of these I towns in some order in which they can be passed when making a trip clockwise along the border of the region, with the following exception. The last region is the "outside region" surrounding all towns and other regions, and for it the order of the labels corresponds to a trip in counterclockwise direction. The order of the regions gives an integer labeling to the regions: the first region has label 1, the second has label 2, and so on. Note that the input includes all regions formed by the towns and great walls, including the "outside region". Output Your program is to write to standard output. The first line contains one integer: the minimal crossing-sum. Sample Input 10 10 3 3 6 9 3 1 2 3 3 1 3 7 4 2 4 7 3 3 4 6 7 3 4 8 6 3 6 8 7 3 4 5 8 4 7 8 10 9 3 5 10 8 7 7 9 10 5 4 2 1 Sample Output 2*/ #include "stdlib.h" #include "stdio.h" /* include outside region*/ #define MAX_REGION_NUMBER 200 #define MAX_MEMBER_NUMBER 30 #define MAX_TOWN_Number 250 #define TRUE 1 #define FALSE 0 #define COLOR_WHITE 0 #define COLOR_GRAY 1 #define COLOR_BLACK 2 #define DISTANCE_INFINITY 99999 typedef struct _THE_MEMBERS_AND_TOWN_INFO_ST_ { int iTownNum; int iMemberNum; struct { int iBelongedTownID; int iBelongedRegionNum; int aiBelongedRegionIndex[MAX_REGION_NUMBER]; }astMemberInfo[MAX_MEMBER_NUMBER]; }THE_MEMBERS_AND_TOWN_INFO_ST; typedef struct _ADJACENT_REGION_NODE_ST_ { int iRegionIndex; }ADJACENT_REGION_NODE_ST; typedef struct _REGION_NODE_STRUCT_ { int iNumberOfTownsOnTheBorder; int aiTownsOnTheBorder[MAX_TOWN_Number]; /*AdjInfo*/ int iAdjacentRegionNum; ADJACENT_REGION_NODE_ST astAdjacentRegion[MAX_REGION_NUMBER-1]; }REGION_NODE_STRUCT; typedef struct _REGION_GRAPHICS_STRUCT_ { int iRegionNum; REGION_NODE_STRUCT astRegionNode[MAX_REGION_NUMBER]; }REGION_GRAPHICS_STRUCT; REGION_GRAPHICS_STRUCT gstRegionGraphics ; THE_MEMBERS_AND_TOWN_INFO_ST gstMemberAndTownInfo ; int gaiDistance[MAX_REGION_NUMBER][MAX_REGION_NUMBER]; int gaiMemberDistance[MAX_MEMBER_NUMBER][MAX_REGION_NUMBER]; /************************************************************************/ /* */ /* */ /* */ /* */ /************************************************************************/ void printDistance() { int iLoopRegion_1 ; int iLoopRegion_2 ; int iLoopMember; printf("/n "); for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { for(iLoopRegion_2 = 0; iLoopRegion_2 < gstRegionGraphics.iRegionNum ; iLoopRegion_2++) { printf("%3d ",gaiDistance[iLoopRegion_1][iLoopRegion_2] ); } printf("/n "); } printf("/n "); for(iLoopMember = 0; iLoopMember < gstMemberAndTownInfo.iMemberNum; iLoopMember++) { for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { printf("%3d ",gaiMemberDistance[iLoopMember][iLoopRegion_1] ); } printf("/n "); } } /************************************************************************/ /* */ /* */ /* */ /* */ /************************************************************************/ void WallInput(void) { int iLoop; int iLoop_1; scanf("%d",&gstRegionGraphics.iRegionNum); scanf("%d",&gstMemberAndTownInfo.iTownNum); scanf("%d",&gstMemberAndTownInfo.iMemberNum); for(iLoop = 0; iLoop < gstMemberAndTownInfo.iMemberNum; iLoop++) { scanf("%d",&gstMemberAndTownInfo.astMemberInfo[iLoop].iBelongedTownID); } for(iLoop = 0; iLoop < gstRegionGraphics.iRegionNum; iLoop++) { scanf("%d",&gstRegionGraphics.astRegionNode[iLoop].iNumberOfTownsOnTheBorder ); for(iLoop_1 = 0; iLoop_1 < gstRegionGraphics.astRegionNode[iLoop].iNumberOfTownsOnTheBorder; iLoop_1++) { scanf("%d",&gstRegionGraphics.astRegionNode[iLoop].aiTownsOnTheBorder[iLoop_1]); } } return; } /************************************************************************/ /* */ /* */ /* */ /* */ /************************************************************************/ char JudgeIfTwoRegionsAdj(REGION_NODE_STRUCT *vpstRegion_1,REGION_NODE_STRUCT *vpstRegion_2) { int iLoop_1; int iLoop_2; int iX1; int iX2; int iY1; int iY2; for(iLoop_1 = 0; iLoop_1 < vpstRegion_1->iNumberOfTownsOnTheBorder ; iLoop_1++) { for(iLoop_2 = 0; iLoop_2 < vpstRegion_2->iNumberOfTownsOnTheBorder ; iLoop_2++) { if(vpstRegion_1->aiTownsOnTheBorder[iLoop_1] == vpstRegion_2->aiTownsOnTheBorder[iLoop_2]) { iX1 = (iLoop_1+1)%vpstRegion_1->iNumberOfTownsOnTheBorder; iX2 = (iLoop_1+vpstRegion_1->iNumberOfTownsOnTheBorder-1)%vpstRegion_1->iNumberOfTownsOnTheBorder; iY1 = (iLoop_2+1)%vpstRegion_2->iNumberOfTownsOnTheBorder; iY2 = (iLoop_2+vpstRegion_2->iNumberOfTownsOnTheBorder-1)%vpstRegion_2->iNumberOfTownsOnTheBorder; if(vpstRegion_1->aiTownsOnTheBorder[iX1] == vpstRegion_2->aiTownsOnTheBorder[iY1] ||vpstRegion_1->aiTownsOnTheBorder[iX2] == vpstRegion_2->aiTownsOnTheBorder[iY1] ||vpstRegion_1->aiTownsOnTheBorder[iX1] == vpstRegion_2->aiTownsOnTheBorder[iY2] ||vpstRegion_1->aiTownsOnTheBorder[iX2] == vpstRegion_2->aiTownsOnTheBorder[iY2]) { return TRUE; } } } } return FALSE; } /************************************************************************/ /* */ /* */ /* */ /* */ /************************************************************************/ void WallInit(void) { int iLoopRegion_1; int iLoopRegion_2; int iLoopMember; int iLoopBorderTown; /*init adj relation*/ for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { for(iLoopRegion_2 = iLoopRegion_1; iLoopRegion_2 < gstRegionGraphics.iRegionNum; iLoopRegion_2++) { /*init distance by the way*/ if(iLoopRegion_1 == iLoopRegion_2) { gaiDistance[iLoopRegion_1][iLoopRegion_2] = 0; continue; } else { gaiDistance[iLoopRegion_1][iLoopRegion_2] = DISTANCE_INFINITY; gaiDistance[iLoopRegion_2][iLoopRegion_1] = DISTANCE_INFINITY; } if(TRUE == JudgeIfTwoRegionsAdj(&gstRegionGraphics.astRegionNode[iLoopRegion_1],&gstRegionGraphics.astRegionNode[iLoopRegion_2])) { gstRegionGraphics.astRegionNode[iLoopRegion_1].astAdjacentRegion[gstRegionGraphics.astRegionNode[iLoopRegion_1].iAdjacentRegionNum].iRegionIndex = iLoopRegion_2; gstRegionGraphics.astRegionNode[iLoopRegion_1].iAdjacentRegionNum++; gstRegionGraphics.astRegionNode[iLoopRegion_2].astAdjacentRegion[gstRegionGraphics.astRegionNode[iLoopRegion_2].iAdjacentRegionNum].iRegionIndex = iLoopRegion_1; gstRegionGraphics.astRegionNode[iLoopRegion_2].iAdjacentRegionNum++; } } } /*init relation between member and region */ for(iLoopMember = 0; iLoopMember < gstMemberAndTownInfo.iMemberNum; iLoopMember++) { for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { gaiMemberDistance[iLoopMember][iLoopRegion_1] = DISTANCE_INFINITY;/*init distance by the way*/ for(iLoopBorderTown = 0; iLoopBorderTown < gstRegionGraphics.astRegionNode[iLoopRegion_1].iNumberOfTownsOnTheBorder ; iLoopBorderTown++) { if(gstMemberAndTownInfo.astMemberInfo[iLoopMember].iBelongedTownID == gstRegionGraphics.astRegionNode[iLoopRegion_1].aiTownsOnTheBorder[iLoopBorderTown]) { gstMemberAndTownInfo.astMemberInfo[iLoopMember].aiBelongedRegionIndex[gstMemberAndTownInfo.astMemberInfo[iLoopMember].iBelongedRegionNum] = iLoopRegion_1; gstMemberAndTownInfo.astMemberInfo[iLoopMember].iBelongedRegionNum++; break; } } } } return; } void Floyd_Warshall(void) { int iLoopRegion_1 ; int iLoopRegion_2 ; int iLoopRegion_3 ; /*pre_process distance matrix*/ for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { for(iLoopRegion_2 = 0; iLoopRegion_2 < gstRegionGraphics.astRegionNode[iLoopRegion_1].iAdjacentRegionNum; iLoopRegion_2++) { gaiDistance[iLoopRegion_1][gstRegionGraphics.astRegionNode[iLoopRegion_1].astAdjacentRegion[iLoopRegion_2].iRegionIndex ] = 1; gaiDistance[gstRegionGraphics.astRegionNode[iLoopRegion_1].astAdjacentRegion[iLoopRegion_2].iRegionIndex ][iLoopRegion_1] = 1; } } /*relax*/ for(iLoopRegion_1 = 0; iLoopRegion_1 < gstRegionGraphics.iRegionNum; iLoopRegion_1++) { for(iLoopRegion_2 = 0; iLoopRegion_2 < gstRegionGraphics.iRegionNum; iLoopRegion_2++) { for(iLoopRegion_3 = 0; iLoopRegion_3 < gstRegionGraphics.iRegionNum; iLoopRegion_3++) { gaiDistance[iLoopRegion_2][iLoopRegion_3] = gaiDistance[iLoopRegion_2][iLoopRegion_3] < gaiDistance[iLoopRegion_2][iLoopRegion_1]+gaiDistance[iLoopRegion_1][iLoopRegion_3]? gaiDistance[iLoopRegion_2][iLoopRegion_3] : gaiDistance[iLoopRegion_2][iLoopRegion_1]+gaiDistance[iLoopRegion_1][iLoopRegion_3]; } } } return; } void CalculateDistanceBetweenMemberAndRegion() { int iLoopMember; int iLoopRegion; int iLoopRegion_Member; for(iLoopMember = 0; iLoopMember < gstMemberAndTownInfo.iMemberNum; iLoopMember++) { for(iLoopRegion = 0; iLoopRegion < gstRegionGraphics.iRegionNum; iLoopRegion++) { for(iLoopRegion_Member = 0; iLoopRegion_Member < gstMemberAndTownInfo.astMemberInfo[iLoopMember].iBelongedRegionNum; iLoopRegion_Member++) { if(gaiMemberDistance[iLoopMember][iLoopRegion] > gaiDistance[gstMemberAndTownInfo.astMemberInfo[iLoopMember].aiBelongedRegionIndex[iLoopRegion_Member]][iLoopRegion]) { gaiMemberDistance[iLoopMember][iLoopRegion] = gaiDistance[gstMemberAndTownInfo.astMemberInfo[iLoopMember].aiBelongedRegionIndex[iLoopRegion_Member]][iLoopRegion]; } } } } return; } void FindMinDistanceRegion() { int iDistance; int iMinDistance = DISTANCE_INFINITY; //int iMinDistanceRegion; int iLoopRegion; int iLoopMember; for(iLoopRegion = 0; iLoopRegion < gstRegionGraphics.iRegionNum; iLoopRegion++) { iDistance = 0; for(iLoopMember = 0; iLoopMember < gstMemberAndTownInfo.iMemberNum ; iLoopMember++) { iDistance += gaiMemberDistance[iLoopMember][iLoopRegion]; } if(iMinDistance > iDistance) { //iMinDistanceRegion = iLoopRegion+1; iMinDistance = iDistance; } } printf("%d/n",iMinDistance); return; } void WallMain() { WallInput(); WallInit(); Floyd_Warshall(); CalculateDistanceBetweenMemberAndRegion(); FindMinDistanceRegion(); //printDistance(); return; }