nyoj 220——推桌子——————【贪心】
推桌子
- 描述
- 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 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. - 输出
- The output should contain the minimum time in minutes to complete the moving, one per line.
- 样例输入
-
3
4
10 20
30 40
50 60
70 80
2
1 3
2 200
3
10 100
20 80
30 50 - 样例输出
-
10
20
30 题目大意:让你搬桌子,但是走廊太窄,某段走廊只能一次移动一个桌子,两个相对的房间对应同一个走廊号。每次搬运花费10分钟,问最少需耗费多少分钟。其实问的就是次数。 解题思路:
方法1:其实就是重叠度的问题。重叠度越高,需要的次数就越多。可以让每次搬运经过的走廊号对应的变量都自加,最后统计所有走廊号对应变量大小,其中最大的就是需要搬运的最少次数。
方法2:按照选择不相交区间的思想来做。但是这个需要按照左端点从小到大排序,然后挑出第一个没选择过的区间的右端点作为比较值,以挑出的那个区间为衡量选出所有不相交的区间,表示需搬运一次。然后重复挑选。最后挑选了几次,表示需要搬运几次。 1://方法1
#include<bits/stdc++.h>
using namespace std;
int corridor[210];
int main(){
int t,n,m,i,j,k,cnt,tmp,a,b;
scanf("%d",&t);
while(t--){
memset(corridor,0,sizeof(corridor));
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&a,&b);
a=(a+1)/2,b=(b+1)/2;
if(a>b){
tmp=a;
a=b;
b=tmp;
}
for(j=a;j<=b;j++){
corridor[j]++;
}
}
cnt=0;
for(i=1;i<=202;i++){
cnt>corridor[i]? :cnt=corridor[i];
}
cout<<cnt*10<<endl;
}
return 0;
}2:
//方法2
#include<bits/stdc++.h>
using namespace std;
struct SEG{
int left,right;
int used;
SEG(){
used=0;
}
}seg[500];
bool cmp(SEG a,SEG b){
if(a.left!=b.left)
return a.left<b.left;
}
int main(){
// freopen("Input.txt","r",stdin);
// freopen("OUT.txt","w",stdout);
int t,n,m,i,j,k,num,cnt,a,b,pos;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&a,&b);
a=(a+1)/2,b=(b+1)/2;
a>b?a=a+b,b=a-b,a=a-b:0;
seg[i].left=a,seg[i].right=b;
}
sort(seg,seg+n,cmp);
num=0,cnt=0;
while(cnt<n){
for(i=0;i<n;i++){
if(seg[i].used==0){
pos=i;
break;
}
}
seg[pos].used=1;
cnt++;
num++;
for(i=1;i<n;i++){
if(!seg[i].used){
if(seg[pos].right<seg[i].left){
pos=i;
seg[i].used=1;
cnt++;
}
}
}
}
cout<<num*10<<endl;
for(i=0;i<500;i++)
seg[i].used=0;
}
return 0;
}
nyoj 220——推桌子——————【贪心】的更多相关文章
- nyist 220 推桌子
题目链接:推桌子 题目意思:给你一些操作,将S出的桌子推到L出,但是这个过道有时会被占用,推一次是10min,不影响的操作可以同时开始,并且只记一次. 思路:贪心,首先按照S从小到大排序,决策:从第一 ...
- nyoj220 推桌子(贪心算法)
这道题太坑了,from 和to有可能写反,还得正过来: 推桌子 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 The famous ACM (Advanced Co ...
- ACM 推桌子
推桌子 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 The famous ACM (Advanced Computer Maker) Company has re ...
- ny220 推桌子
推桌子 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 The famous ACM (Advanced Computer Maker) Company has rent ...
- ACM--移动桌子--贪心--HDOJ 1050--Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Descript ...
- [nyoj]会场安排问题-贪心
会场安排问题 时间限制:3000 ms | 内存限制:65535 KB 难度:4 描述 学校的小礼堂每天都会有许多活动,有时间这些活动的计划时间会发生冲突,需要选择出一些活动进行举办.小刘的工 ...
- NYOJ 203 三国志(Dijkstra+贪心)
三国志 时间限制:3000 ms | 内存限制:65535 KB 难度:5 描写叙述 <三国志>是一款非常经典的经营策略类游戏.我们的小白同学是这款游戏的忠实玩家.如今他把游戏简化一下 ...
- nyoj 16-矩形嵌套(贪心 + 动态规划DP)
16-矩形嵌套 内存限制:64MB 时间限制:3000ms Special Judge: No accepted:13 submit:28 题目描述: 有n个矩形,每个矩形可以用a,b来描述,表示长和 ...
- nyoj 106背包问题(贪心专题)
背包问题 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 现在有很多物品(它们是可以分割的),我们知道它们每个物品的单位重量的价值v和重量w(1<=v,w< ...
随机推荐
- mysql 按照姓氏排序
1.如果是gbk存储 order by name asc 2.非GBK order by convert(name using gbk) asc
- 洛谷P4525 【模板】自适应辛普森法1
题面 传送门 题解 我似乎连积分都不太熟练→_→ 总之就是对于一个原函数,我们找一个二次函数来近似它,那么有 \[ \begin{aligned} \int_a^bf(x)dx &\appro ...
- python自带的排列组合函数
需求: 在你的面前有一个n阶的台阶,你一步只能上1级或者2级,请计算出你可以采用多少种不同的方法爬完这个楼梯?输入一个正整数表示这个台阶的级数,输出一个正整数表示有多少种方法爬完这个楼梯. 分析:提炼 ...
- [转]Resolving Python error: Unable to find vcvarsall.bat
Resolving Python error: Unable to find vcvarsall.bat While installing python package flask-user usin ...
- postgreSQL PL/SQL编程学习笔记(一)
1.Structure of PL/pgSQL The structure of PL/pgSQL is like below: [ <<label>> ] [ DECLARE ...
- eclipse 与my eclipse区别,IDE
ecilpse:是一个平台,通过相关插件可以作为c/c++,java,J2EE,PHP,python,Flex等的IDE IDE:集成开发环境(IDE,Integrated Development E ...
- 让Nginx支持pathinfo
# 典型配置 location ~ \.php$ { root html; fastcgi_pass 127.0.0.1:9000; fastcgi_index index.php; fastcgi_ ...
- 获取url路径的正则
package unit; import java.util.regex.Matcher; import java.util.regex.Pattern; public class Util { // ...
- 【VBA研究】Excel VBA利用ADODB访问数据库使用小结
[转自] http://blog.csdn.net/iamlaosong/article/details/18043433 作者:iamlaosong ▲连接Oracle数据库 Set cnn = C ...
- python 学习笔记一——Python安装和IDLE使用
好吧,一直准备学点啥,前些日子也下好了一些python电子书,但之后又没影了.年龄大了,就是不爱学习了.那就现在开始吧. 安装python 3 Mac OS X会预装python 2,Linux的大多 ...