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.

  Table moving Reason
Possible ( room 30 to room 50) and (room 60 to room 90) no part of corridor is shared
(room 11 to room 12) and (room 14 to room 13) no part of corridor is shared
Impossible (room 20 to room 40) and (room 31 to room 80) corridor in front of room 31 to room 40 is shared
(room 1 to room 4) and (room 3 to room 6)  corridor in front of room 3 is shared 
(room 2 to room 8) and (room 7 to room 10)  corridor in front of room 7 is shared 

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 

, 1<=
N
<=
200 , that represents the number of tables to move. Each of the following 

lines contains two positive integers 

and 
t, 
representing that a table is to move from room number 

to room number 

(each room number appears at most once in the 

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

题意:要搬东西。每个东西要搬10分钟,几个东西可以同时搬,但是走廊很窄,相同的走廊只能搬一个东西。要求出最快要多久可以搬完。

思路:问题可以转换为,找出要占用同一个走廊的最大值即可,一开始看刘汝佳的最大不相交区间,以为是那样写,写得挺麻烦的结果还是过了。不过有一个不明白的地方,就是改了个排序方式才过的。

代码:

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std; int t, n, vis[405], Max;
struct R {
int start;
int end;
} r[205]; int main() {
scanf("%d", &t);
while (t --) {
Max = 0;
memset(vis, 0, sizeof(vis));
scanf("%d", &n);
for (int i = 0; i < n; i ++) {
scanf("%d%d", &r[i].start, &r[i].end);
if (r[i].start > r[i].end)
swap(r[i].start, r[i].end);
for (int j = r[i].start; j <= r[i].end; j ++) {
vis[j] ++;
if (Max < vis[j])
Max = vis[j];
}
if (r[i].start % 2 == 0)//注意由于走廊是对称的,要考虑这种特殊情况
vis[r[i].start - 1] ++;
if (Max < vis[r[i].start - 1])
Max = vis[r[i].start - 1];
if (r[i].end % 2)
vis[r[i].end + 1] ++;
if (Max < vis[r[i].end + 1])
Max = vis[r[i].end + 1];
}
printf("%d\n", Max * 10);
}
return 0;
}

一开始的代码:

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std; int t, n, num, qnum, en;
struct Interval {
int start, end, v;
} q[205]; int cmp (Interval a, Interval b) {
return a.start < b.start;//这里改一下就过了。。
}
int main() {
scanf("%d", &t);
while (t --) {
num = 0; qnum = 0;
memset(q, 0, sizeof(q));
scanf("%d", &n);
for (int i = 0; i < n; i ++) {
scanf("%d%d", &q[i].start, &q[i].end);
if (q[i].start > q[i].end)
swap(q[i].start, q[i].end);
}
sort (q, q + n, cmp);
while (qnum < n) {
for (int i = 0; i < n; i ++) {
if (!q[i].v) {
q[i].v = 1;
qnum ++;
en = q[i].end;
if (en % 2)//由于是对称的,所以要这样讨论。
en ++;
for (int j = 0; j < n; j ++) {
if (q[j].start > en && !q[j].v) {
en = q[j].end;
q[j].v = 1;
qnum ++;
}
}
break;
}
}
num ++;
}
printf("%d\n", num * 10);
}
return 0;
}

UVAlive 2326 Moving Tables(贪心 + 区间问题)的更多相关文章

  1. uvalive 2326 - Moving Tables(区间覆盖问题)

    题目连接:2326 - Moving Tables 题目大意:在一个走廊上有400个教室, 先在有一些桌子要移动, 每次移动需要十分钟, 但是不同房间的桌子可以在同一个十分钟内移动,只要走廊没有被占用 ...

  2. zstu.2512. Moving Tables(贪心)

     Moving Tables Time Limit: 1 Sec  Memory Limit: 64 MB Submit: 1182  Solved: 563 Description The famo ...

  3. Moving Tables(贪心或Dp POJ1083)

    Moving Tables Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28304   Accepted: 9446 De ...

  4. hdu_1050 Moving Tables 贪心

    Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Tot ...

  5. HDU1050(Moving Tables:贪心算法)

    解题思路: 这种做法是基于hdu2037的做法上考虑的,找出所有可以同时搬运的桌子,然后就很方便求出最短总时间. 还有一种更简单的做法是直接遍历一遍找出与别的重复次数最多的那片区域,重复次数*10就可 ...

  6. uva live 2326 - Moving Tables

    把房间号映射在一条坐标上,然后排序,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划,最后找从左到右找一次可行的计划, ............ 次数*1 ...

  7. --hdu 1050 Moving Tables(贪心)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1050 AC code: #include<stdio.h> #include<str ...

  8. hdoj 1050 Moving Tables【贪心区间覆盖】

    Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Tot ...

  9. POJ 1083 &amp;&amp; HDU 1050 Moving Tables (贪心)

    Moving Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

随机推荐

  1. BZOJ 3533: [Sdoi2014]向量集( 线段树 + 三分 )

    答案一定是在凸壳上的(y>0上凸壳, y<0下凸壳). 线段树维护, 至多N次询问, 每次询问影响O(logN)数量级的线段树结点, 每个结点O(logN)暴力建凸壳, 然后O(logN) ...

  2. 动态子类化CComboBox以得到子控件EDIT及LISTBOX

    动态子类化CComboBox以得到子控件EDIT及LISTBOX Joise.LI写于2004-4-6 ComboBox是比较常用的一个控件,有三种样式:CBS_SIMPLE(简单),CBS_DROP ...

  3. AppStore被拒原因及总结

    4.5 - Apps using background location services must provide a reason that clarifies the purpose of th ...

  4. openssl命令行Base64编解码

    openssl对base64编解码的规范支持较差,用它编解码的结果别的语言如php处理很不方便,注意的几点整理如下 1,如果php加密结果做base64编码长度小于64,则需要添加一个换行符opens ...

  5. Android 动画animation 深入分析

    转载请注明出处:http://blog.csdn.net/farmer_cc/article/details/18259117 Android 动画animation 深入分析 前言:本文试图通过分析 ...

  6. bootstrap 智能表单 demo示例

    1.基本配置,支持的元素类型 2.自动布局 3.自定义布局 4.自定义表单 5.数据绑定 6.带验证的表单 7.智能搜索 8.级联下拉 9.图片上传 图片有点大了,屏幕不够大的话可能看的不习惯,没事 ...

  7. objective-C学习笔记(八) 集合类型 Collection Types

    OBJC的集合类型: 1.数组 Array 2.Set 3.键值对 Dictionary 数组:OC中的数组被定义为class,引用类型.索引从0开始,访问越界会抛出运行时异常. NSArray的元素 ...

  8. SQL每个月份的发生额都比101科目多的科目

    请用SQL语句实现:从TestDB数据表中查询出所有月份的发生额都比101科目相应月份的发生额高的科目.请注意:TestDB中有很多科目,都有1-12月份的发生额.                  ...

  9. OA项目总结

    一.自定义拦截器:     继承AbstractInterceptor,覆写intercept方法,实现功能逻辑,最后在Struts.xml文件中配置了自定义拦截器,首先自定义拦截器栈, <!- ...

  10. django1.4.5无法安装MySQLdb1.2.3

    解决办法是: yum install python-devel mysql-devel zlib-devel openssl-devel 然后再build.install