hdu1050 活动安排问题(有坑)
来源:互联网 发布:ubuntu root无声音 编辑:程序博客网 时间:2024/05/31 19:13
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
#include <bits/stdc++.h>#define ll long longusing namespace std;pair<int,int> x[205];int main(){int t;cin>>t;while(t--){memset(x,0,sizeof(x));int n;cin>>n;for(int i=1;i<=n;++i){cin>>x[i*2-1].first>>x[i*2].first;if(x[i*2-1].first>x[i*2].first) swap(x[i*2-1].first,x[i*2].first);//坑1if(x[i*2-1].first%2==0) x[i*2-1].first--;//这两行是注意点,既不能if(x[i].a%2==1) x[i].a++;也不能是别的(因为可能操作后尾比头大) if(x[i*2].first%2==1) x[i*2].first++;x[i*2-1].second++;x[i*2].second--;}sort(x+1,x+2*n+1);int maxx=0;for(int i=1;i<=2*n;++i){x[i].second+=x[i-1].second;maxx=max(maxx,x[i].second);}cout<<maxx*10<<endl;}return 0;}
0 0
- hdu1050 活动安排问题(有坑)
- 活动安排问题 (贪心)
- 活动安排问题(贪心算法)
- 活动安排问题(贪心算法)
- 活动安排问题(贪心算法)
- 活动安排问题(贪心版)
- 51nod 活动安排问题 (贪心)
- 活动安排(选择)问题拓展
- 贪婪算法(活动安排问题)
- 51Nod 活动安排问题(贪心)
- 线段重叠(活动安排)问题 贪心
- pzhu 1082: 活动安排问题 (贪心)
- 活动安排问题
- 活动安排问题
- 活动安排问题
- 【贪心】活动安排问题
- 活动安排问题
- 活动的安排问题 .
- 比赛分组(二)——更通用的解法
- How to troubleshoot the "Could not create 'CDO.Message'" error message
- IO流笔记第一发
- Jenkins问题
- Linux统计某文件夹下文件、文件夹的个数
- hdu1050 活动安排问题(有坑)
- c盘下安装的文件访问权限问题
- 欢迎使用CSDN-markdown编辑器
- 由常量池 运行时常量池 String intern方法想到的(一)
- POJ 2236 - Wireless Network
- c# 动态设置控件位置
- 重学备忘
- 文章标题
- An instance of “(null)” is already running. Choose “Stop” to terminate and launch a new instance.