Linear world
Time Limit: 3000MS   Memory Limit: 65536K
Total Submissions: 4426   Accepted: 1006

Description

The Disc, being flat, has no real horizon. Any adventurous sailors who get funny ideas from staring at eggs and oranges for too long and set out for the antipodes soon learned that the reason why distant ships sometimes looked as though they were disappearing over the edge of the world was that they were disappearing over the edge of the world. (Terry Pratchett -Colour of Magic) 
Not so long time ago people used to believe that they live on 2-D world and if they will travel long enough in one direction, they will fall down over the edge. Even when it was proved that the Earth is rounded some of them were still afraid to travel to the southern hemisphere. 
Try to imagine one 1-D (linear) world. On such world there are only two possible directions (left and right). All inhabitants of such world were created exactly at the same time and suddenly all of them start to move (all with same constant velocity) in one or the other direction. If two inhabitants encounter each other, they politely exchange greetings and then they turn around and start to move in an opposite direction. When an inhabitant reaches the end of the world he falls away and disappears. 
Your task is to determine, for a given scenario of creation, which inhabitant and when (counting from the moment of creation) will be the last one to fall away. You can assume that the time required to exchange greetings and turn around is 0.

Input

The input consists of multiple descriptions (data sets) of the creation moment. File structure is as follows: 

LV 
DIR POS NAME 
... 
The first line defines the number of inhabitants (N<32000). Data set starting with value N=0 represents the end of the input file. The second line contains length of the world L(float) and velocity of inhabitants V(float). Both values are always positive. In next N lines the data about inhabitants are given in an order of increasing POS (positive direction): 
DIR – initial direction ('p' or 'P' for positive and 'n' or 'N' for negative) 
POS – position in the time of creation (0<=POS<=L) 
NAME – name of inhabitant (string up to 250 characters) 
Input values within one line are separated with at least one space and there will be no empty lines in input. You may assume that input is always correct and that each data set has only one unique solution.

Output

The output consists of one line per each input data set. The first value should be the time when the last inhabitant will fall of the linear world counting from the moment of creation. Value should be printed truncated to two decimal places in a field 13 characters wide. The second value should be the name of the inhabitant. Values should be separated with single space character.

Sample Input

1
13.5 2
p 3.5 Smarty
4
10 1
p 1 Helga
n 3 Joanna
p 5 Venus
n 7 Clever
0

Sample Output

         5.00 Smarty
9.00 Venus

Source

 
题意:在一个线性世界,有n个居民,每个人都在自己的初始位置pos上,运动方向分别为P(正方向)和N(负方向)。 线性世界长度为L,所有居民移动速度都为v。居民们相遇时,就会自动掉头。从初始时刻开始运动,问最后一个掉下去的运动了多长时间,且输出姓名。
 
题解:运动速度一致,且掉头不花费时间。典型的弹性碰撞模型。我们可以忽略碰撞掉头的影响,将碰撞掉头看成两个居民交换姓名,擦肩而过。 所以最长时间即是离端点最远的居民的运动时间。  哪么谁是最后一个掉下的去的呢?这个要看运动时间最长的居民和哪些居民交换了姓名,最后一个交换的就是最后一个掉下去的。 怎么找到这个人呢?居民们速度一致,所有在前进路上只会与方向相反的居民碰撞。统计出前进路上方向不一致的人数就行了。
  1. 两人碰面后方向相反速度不变,可以认为两人只是交换了名字,
  2. 仍旧按原来的方向行走。那么只需找出距离端点最远的人,再
  3. 找出走到端点时此人的名字即可。怎么找出对应的名字呢,
  4. 只需找出此人走到尽头前遇到的方向相反的人数即可。
  5. 例如-> <- <- -> <-
  6. 1  2  3  4  5
  7. 假设第一个人是最远的,因为2,3,5与之方向相反,因此
  8. 他的名字将变化三次(5的方向和速度给4,5带着4的速度和方向
  9. 走到尽头,最后1依次与2,3,4交换)。可以看出1,5之间有
  10. 方向向右的并不影响(即使有多个也是一样的),1最终只交换
  11. 三次速度,因为有三人跟他方向相反。而且1最后用的名字一定是
  12. name[1+3],因为五个人的相对位置是不会变的,也就是说1只可能
  13. 与2相交换,变成2,而不可能直接与3交换,以此类推,因此最后
  14. 的名字一定是name[1+3].
 #include<cstdio>
#include<algorithm>
#include<iostream>
#include<math.h>
using namespace std;
struct node
{
char d[];
double dec;
char name[];
} c[];
bool cmp(const node& a,const node& b)
{
return a.dec<b.dec;
}
int main()
{
int n,i,j;
double L,V;
while(~scanf("%d",&n))
{
if(!n)break;
scanf("%lf%lf",&L,&V);
for(i=; i<=n; i++)
{
scanf("%s %lf %s",&c[i].d,&c[i].dec,&c[i].name);
}
sort(c+,c+n+,cmp);
int id;
double maL=;
for(i=; i<=n; i++)
{
double R;
if(c[i].d[]=='p'||c[i].d[]=='P')
R=L-c[i].dec;
else R=c[i].dec;
if(R>maL)
{
maL=R;
id=i;
}
}
int ans=;
if(c[id].d[]=='p'||c[id].d[]=='P')
{
for(j=id+; j<=n; j++)
if(c[j].d[]=='n'||c[j].d[]=='N')
ans++;
ans=id+ans;
}
else
{
for(j=id-; j>=; j--)
if(c[j].d[]=='p'||c[j].d[]=='P')
ans++;
ans=id-ans;
}
maL=maL/V;
printf("%13.2lf %s\n",floor(maL*)/100.00,c[ans].name);
}
return ;
}

思路:

很久之前做的一道思路题目了。 这个题比较坑把 记录一下。

两只蚂蚁碰面后相当于不回头一直往前走。

那么我们可以记录下来每只蚂蚁假如不碰面掉落的时间,取个最大值就是最后一只蚂蚁掉落的时间,在把那个时间对应的每只蚂蚁位置记录下来,还在线上的就是最后一只蚂蚁。

 #include <iostream>
#include <cstdio>
using namespace std; const int N = ;
char name[N][]; int main()
{
int n;
double l, v; while (cin >> n && n)
{
cin >> l >> v;
int pnum = ;
double pmaxt = -, nmaxt = -;
char dir[];
double pos;
for (int i = ; i < n; i++)
{
scanf("%s%lf%s", dir, &pos, name[i]);
if (dir[] == 'p' || dir[] == 'P')
{
pnum++;
if (pmaxt < )//第一个人(最大的pmax)
pmaxt = (l - pos) / v;
}
else
{
nmaxt = pos / v;//最后一个人(最大的nmax)
}
}
//结果小数点2位之后的数是直接截断的,并不是四舍五入,因此不可以直接打印,要先处理再打印
if (pmaxt > nmaxt)
printf("%13.2lf %s\n", (int)(pmaxt * ) / 100.0, name[n - pnum]);
else
printf("%13.2lf %s\n", (int)(nmaxt * ) / 100.0, name[n - pnum - ]);
}
return ;
}

POJ 2674 Linear world(弹性碰撞)的更多相关文章

  1. POJ 2674 Linear world

    POJ 2674 Linear world 题目大意: 一条线上N只蚂蚁,每只蚂蚁速度固定,方向和坐标不同,碰头后掉头,求最后掉下去那只蚂蚁的时间和名字. 注意两点: 相撞可视为擦肩而过,蚂蚁们不管掉 ...

  2. poj 2674 线性世界 弹性碰撞

    弹性碰撞的题目一般都是指碰到就会掉转方向的一类题目,这里我们可以忽略掉头,仅仅看成擦肩而过,交换名字等等 题意:一条线上N只蚂蚁,每只蚂蚁速度固定,方向和坐标不同,碰头后掉头,求最后掉下去那只蚂蚁的名 ...

  3. Greedy:Linear world(POJ 2674)

      Linear world 题目大意:一些人生活在线性世界中,到达线性世界两端就会消失,两个人的前进方向有两个,相遇会改变各自相遇方向,求最后一个人掉下的人的名字和时间. 其实这一题就是弹性碰撞的模 ...

  4. POJ 2674

    Linear world Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 2448   Accepted: 564 Descr ...

  5. poj 3684 Physics Experiment 弹性碰撞

    Physics Experiment Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1489   Accepted: 509 ...

  6. POJ:3684-Physics Experiment(弹性碰撞)

    Physics Experiment Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3392 Accepted: 1177 Sp ...

  7. ProgrammingContestChallengeBook

    POJ 1852 Ants POJ 2386 Lake Counting POJ 1979 Red and Black AOJ 0118 Property Distribution AOJ 0333 ...

  8. POJ 3684 Physics Experiment(弹性碰撞)

    Physics Experiment Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2936   Accepted: 104 ...

  9. Greedy:Physics Experiment(弹性碰撞模型)(POJ 3848)

    物理实验 题目大意:有一个与地面垂直的管子,管口与地面相距H,管子里面有很多弹性球,从t=0时,第一个球从管口求开始下落,然后每1s就会又有球从球当前位置开始下落,球碰到地面原速返回,球与球之间相碰会 ...

随机推荐

  1. Spring整合hibernate:3、使用XML进行声明式的事务管理

    配置applicationContext.xml文件 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2 ...

  2. about system (pause) in cpp

    Which is best way to pause the console in C++ programs? using cin.get() or using system("pause& ...

  3. Java集合体系总结

    一.集合框架 集合是容纳数据的容器,java常用的集合体系图如下.以集合中是否运行重复元素来分,主要有List和Set接口,List集合中可以有重复元素,Set集合集合中的元素不可重复,Iterato ...

  4. LXC、LXD、Docker的区别与联系(by quqi99)

    版权声明:可以任意转载,转载时请务必以超链接形式标明文章原始出处和作者信息及本版权声明 ( http://blog.csdn.net/quqi99 ) 容器 namespace技术用来进行做进程间的隔 ...

  5. Ubuntu网络代理问题

    问题描述 新开机的电脑,不开lantern就上不了网.很气. 解决过程 首先当然是寻求解决方案了.未果 然后就是妥协,每次先开一次lantern.(其实也不是很麻烦是吧,哎,是的是的) 今天早晨友人来 ...

  6. BZOJ4552 Tjoi2016&Heoi2016排序 【二分+线段树】*

    Description 在2016年,佳媛姐姐喜欢上了数字序列.因而他经常研究关于序列的一些奇奇怪怪的问题,现在他在研究一个难题,需要你来帮助他.这个难题是这样子的:给出一个1到n的全排列,现在对这个 ...

  7. BZOJ4557 JLoi2016 侦察守卫 【树形DP】*

    BZOJ4557 JLoi2016 侦察守卫 Description 小R和B神正在玩一款游戏.这款游戏的地图由N个点和N-1条无向边组成,每条无向边连接两个点,且地图是连通的.换句话说,游戏的地图是 ...

  8. windows中查看端口被什么应用程序占用并删除

    windows中查看端口的命令是netstat,具体用法如下: 查看端口信息时可以使用如下命令: netstat -ano 运行结果如下: 当前我的本地13067端口被占用,使用命令如下: c:\&g ...

  9. 《selenium2 python 自动化测试实战》(13)——上传文件

    看代码: # coding: utf-8 from selenium import webdriver from time import sleep driver = webdriver.Firefo ...

  10. 使用npm link 创建本地模块

    1. npm link 介绍 创建一个全局的符号链接,优点是方便我们进行本地node模块的开发调用,和后期发布私服,或者npm 仓库调用是一致的 以下为官方的说明: First, npm link i ...