POJ 1083

Moving Tables

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 3763		Accepted: 1344

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

Source

Taejon 2001

____________________________________________________________________________________

难度： 1  代码量： 1   分类：贪心

分析：

保证开始比结束小，将所有的移动排序（开始，结束），然后贪心选择最前面的保证不冲突的移动，计算这样选择的趟数，趟数*10即为所求。注意房子是相对的，所以2，3和4，5是冲突的。

 代码：

 

#include  < stdio.h >
#include  < stdlib.h >
#include  < memory.h >
typedef  struct  _node 
... {
    int start;
    int end;
    int tag;
} Node;

Node move[ 200 ];

int  cmp( const   void   *  a, const   void   *  b)
... {
    if(((Node *)a)->start==((Node *)b)->start)
    ...{
        return (((Node *)a)->end-((Node *)b)->end);
    }
    return ((Node *)a)->start-((Node *)b)->start;
}

int  main()
... {
    int n;
    int m,i,j;
    int tmp[2],last,count;
    scanf("%d",&n);
    while(n--)
    ...{
        scanf("%d",&m);
        memset(move,0,sizeof(Node)*200);
        for(i=0;i<m;i++)
        ...{
            scanf("%d%d",tmp,tmp+1);
            if(tmp[0]>tmp[1])
            ...{
                j=tmp[0];
                tmp[0]=tmp[1];
                tmp[1]=j;
            }
            move[i].start=tmp[0];
            move[i].end=tmp[1];        
        }
        qsort(move,m,sizeof(Node),cmp);
        j=m;count=0;
        while(j)...{
            last=-1;
            for(i=0;i<m;i++)
            ...{
                if(!move[i].tag&&last<(move[i].start-1)/2)
                ...{
                    last=(move[i].end-1)/2;
                    move[i].tag=1;
                    j--;                
                }        
            }
            count++;
        }
        printf("%d ",count*10);
    }
    return 0;
}