要注意细节：如图，当room3占用时，room4是不能同时占用的。
比如，2--> 3 ，4-->5不能同时进行。
/*Moving Tables Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15537 Accepted: 5067 Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving. For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager's problem. Input The input consists of T test cases. The number of test cases ) (T is given in the first line of the input file. Each test case begins with a line containing an integer N , 1 <= N <= 200, that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t each room number appears at most once in the N lines). From the 3 + N -rd line, the remaining test cases are listed in the same manner as above. Output The output should contain the minimum time in minutes to complete the moving, one per line. Sample Input 3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50 Sample Output 10 20 30 */ #include <stdio.h> #include "string.h" #define MAX_MOVE_TABLE_NUM 200 #define MAX_ROOM_NUM 400 typedef struct _TABLE_NEED_MOVE_ST_ { int iSrcRoom; int iTrgRoom; }TABLE_NEED_MOVE_ST; TABLE_NEED_MOVE_ST gastTable[MAX_MOVE_TABLE_NUM+1]; int gaiCorridor[MAX_ROOM_NUM+1] ; int gaiNext[MAX_ROOM_NUM+1] ; int MovingTablesmain(void) { int iLoop; int iLoop1; int iLoopCase; int iLoopTab; int iTestCaseNum; int iMovTabNum; int iTemp; int iTime; int iPreIndex; scanf("%d",&iTestCaseNum); for (iLoopCase = 0; iLoopCase < iTestCaseNum; iLoopCase++) { iTime = 0; memset(gaiCorridor,0,(MAX_ROOM_NUM+1)*sizeof(int)); scanf("%d",&iMovTabNum); for (iLoopTab = 1; iLoopTab <= iMovTabNum; iLoopTab++) { scanf("%d %d",&gastTable[iLoopTab].iSrcRoom,&gastTable[iLoopTab].iTrgRoom); if (gastTable[iLoopTab].iSrcRoom > gastTable[iLoopTab].iTrgRoom) { iTemp = gastTable[iLoopTab].iTrgRoom; gastTable[iLoopTab].iTrgRoom = gastTable[iLoopTab].iSrcRoom; gastTable[iLoopTab].iSrcRoom = iTemp; } gaiCorridor[gastTable[iLoopTab].iSrcRoom] = iLoopTab; } while (iMovTabNum > 0) { iTime++; iLoop = 1; while(iLoop < MAX_ROOM_NUM) { if (0 != gaiCorridor[iLoop]) { iMovTabNum--; iTemp = iLoop; iLoop = gastTable[gaiCorridor[iLoop]].iTrgRoom; if (1 == iLoop%2) { iLoop+=2; } gaiCorridor[iTemp] = 0; } else { iLoop++; } } } printf("%d/n",iTime*10); } return 0; }
