HDU 1050 Moving Tables £¨Ì°ÐÄ£©

Moving Tables

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20302 Accepted Submission(s): 6889


Problem 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 corridZ†·Ÿ"http://www.Bkjia.com/kf/ware/vc/" target="_blank" class="keylink">vci4gUmVjZW50bHkgdGhlIENvbXBhbnkgbWFkZSBhIHBsYW4gdG8gcmVmb3JtIGl0cyBzeXN0ZW0uIFRoZSByZWZvcm0gaW5jbHVkZXMgbW92aW5nIGEgbG90IG9mIHRhYmxlcyBiZXR3ZWVuIHJvb21zLiBCZWNhdXNlIHRoZSBjb3JyaWRvciBpcyBuYXJyb3cgYW5kIGFsbCB0aGUgdGFibGVzIGFyZSBiaWcsIG9ubHkKIG9uZSB0YWJsZSBjYW4gcGFzcyB0aHJvdWdoIHRoZSBjb3JyaWRvci4gU29tZSBwbGFuIGlzIG5lZWRlZCB0byBtYWtlIHRoZSBtb3ZpbmcgZWZmaWNpZW50LiBUaGUgbWFuYWdlciBmaWd1cmVkIG91dCB0aGUgZm9sbG93aW5nIHBsYW46IE1vdmluZyBhIHRhYmxlIGZyb20gYSByb29tIHRvIGFub3RoZXIgcm9vbSBjYW4gYmUgZG9uZSB3aXRoaW4gMTAgbWludXRlcy4gV2hlbiBtb3ZpbmcgYSB0YWJsZSBmcm9tIHJvb20gaSB0byByb29tIGosIHRoZQogcGFydCBvZiB0aGUgY29ycmlkb3IgYmV0d2VlbiB0aGUgZnJvbnQgb2Ygcm9vbSBpIGFuZCB0aGUgZnJvbnQgb2Ygcm9vbSBqIGlzIHVzZWQuIFNvLCBkdXJpbmcgZWFjaCAxMCBtaW51dGVzLCBzZXZlcmFsIG1vdmluZyBiZXR3ZWVuIHR3byByb29tcyBub3Qgc2hhcmluZyB0aGUgc2FtZSBwYXJ0IG9mIHRoZSBjb3JyaWRvciB3aWxsIGJlIGRvbmUgc2ltdWx0YW5lb3VzbHkuIFRvIG1ha2UgaXQgY2xlYXIgdGhlIG1hbmFnZXIgaWxsdXN0cmF0ZWQgdGhlCiBwb3NzaWJsZSBjYXNlcyBhbmQgaW1wb3NzaWJsZSBjYXNlcyBvZiBzaW11bHRhbmVvdXMgbW92aW5nLiA8YnI+Cjxicj4KPGNlbnRlcj48aW1nIHNyYz0="http://www.2cto.com/uploadfile/Collfiles/20141115/20141115082856288.gif" alt="\">

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. 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 N+3-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 Asia 2001, Taejon (South Korea)

½âÌâ˼·£ºÌ°ÐÄ£¬¿¼ÂÇÿ´ÎµÄ×îÓŽ⣬Ôò¶ÔÃæµÄÁ½·¿¼ä¹²Í¬ÓµÓÐËüÃÇËù¶ÔÓ¦µÄÇøÓò£¬Ã¿´Î½»´í£¬¶¼»á²úÉúÒ»´Î³åÍ»£¬¾Í´ú±íËûÃDz»ÄÜÔÙͬһ´Î°áÔË£¬¿¼Âǵ½¶à´ÎתÒƵĽ»´íµÄÇøÓò£¬×î´ó½»´íµÄ´ÎÊý¾Í´ú±íÁË×îСµÄ°áÔË´ÎÊý¡£

AC´úÂ룺

#include 
#include 
#include 
#include 
#include 
using namespace std;

int room[205];

int main(){
//    freopen("in.txt", "r", stdin);
    int t, n, x, y;
    scanf("%d", &t);
    while(t--){
        memset(room, 0, sizeof(room));
        scanf("%d", &n);
        for(int i=0; i y) swap(x, y);          //·ÀÖ¹Æðʼ·¿¼ä´óÓÚÖÕÖ¹·¿¼ä
            for(int i=(x+1)/2; i<=(y+1)/2; i++){
                room[i] ++;                //¶ÔÓ¦ÇøÓòµÄ½»´í´ÎÊýÔö¼Ó
            }
        }
        int ans = 0;
        for(int i=1; i<=201; i++){
            if(ans < room[i])  ans = room[i];
        }
        printf("%d\n", ans*10);
    }
    return 0;
}