HDU 1050 moving table
来源:互联网 发布:centos ftp指定目录 编辑:程序博客网 时间:2024/05/21 06:25
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14901 Accepted Submission(s): 5098
Total Submission(s): 14901 Accepted Submission(s): 5098
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 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.
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. 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
102030分析:关键是要理解1和2,3和4是共用一条走廊的。所以做题时要“扩大”他们的范围。代码如下:#include<iostream>using namespace std;const int MAX = 405;int count[MAX];int main(){ int t,n,max,i,j,from,to;cin>>t;while(t--){cin>>n;memset(count,0,sizeof(count));while(n --){cin>>from>>to;if(from > to){int temp = from;from = to ;to = temp;}if(from % 2 == 0)count[from-1]++;if(to % 2 == 1)count[to+1]++;for(j = from;j <= to; j ++)count[j]++;}max = 0;for(i = 0; i< MAX;i++){if(count[i] > max ){max = count[i];}}cout<<max*10<<endl;}return 0;}
- hdu 1050 Moving Table
- HDU 1050 moving table
- hdu moving table.
- 1050 moving table
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- HDU-1050 Moving Tables
- hdu-1050-Moving Tables
- HDU 1050 Moving Tables
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- HDU (1050) Moving Tables
- HDU--1050 -- Moving Tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- android AsyncTask 详细例子
- Myeclipse 性能优化
- android AsyncTask 详细例子(2)
- LAMP--系统、平台、数据库和程序
- 命令行形式下的Qt实现编译连接
- HDU 1050 moving table
- 解决如何让AsyncTask终止操作
- OS开发中使用[[UIApplication sharedApplication] openURL:]加载其它应用
- Android源码中屏幕截图的实现
- Android模仿jquery异步请求
- 数学之美 与 浪潮之巅
- POJ 3352: Road Construction
- load() 方法 ---- 细节
- const与define的异同