# Uva 10881 - Piotr's Ants

 "One thing is for certain: there is no stopping them; the ants will soon be here. And I, for one, welcome our new insect overlords."
Kent Brockman

Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing either left or right and walks at a constant speed of 1 cm/s. When two ants bump into each other, they both turn around (instantaneously) and start walking in opposite directions. Piotr knows where each of the ants starts and which direction it is facing and wants to calculate where the ants will end up T seconds from now.

Input
The first line of input gives the number of cases, N. N test cases follow. Each one starts with a line containing 3 integers: L , T and n (0 <= n <= 10000). The next n lines give the locations of the n ants (measured in cm from the left end of the pole) and the direction they are facing (L or R).

Output
For each test case, output one line containing "Case #x:" followed by n lines describing the locations and directions of the n ants in the same format and order as in the input. If two or more ants are at the same location, print "Turning" instead of "L" or "R" for their direction. If an ant falls off the pole before Tseconds, print "Fell off" for that ant. Print an empty line after each test case.

 Sample Input Sample Output 2 10 1 4 1 R 5 R 3 L 10 R 10 2 3 4 R 5 L 8 R Case #1: 2 Turning 6 R 2 Turning Fell off Case #2: 3 L 6 R 10 R
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
const int MAXN = 10010;
int L, T, n;
struct node{
int l;
bool fx; //true为右
int id;
}MaYi[MAXN];
bool cmp(node a, node b)
{
return a.l<b.l;
}
int xb[MAXN];//找到现在的下标
map<int,int>shumu;
int main()
{
int t, cs, i, j;
int l;
char c;
scanf("%d",&t);
//freopen("d:\out.txt","w",stdout);
for(cs=1; cs<=t; cs++)
{
scanf("%d%d%d",&L,&T,&n);
for(i=0; i<n; i++)
{
scanf("%d %c",&l,&c);
MaYi[i].l=l;
if(c=='R')
MaYi[i].fx = true;
else
MaYi[i].fx = false;
MaYi[i].id = i;
}
sort(MaYi,MaYi+n,cmp);
shumu.clear();
//确定原来位置,以及统计现在相对位置 ,再移动蚂蚁 统计每个点的蚂蚁数目
int s = 0;
for(i=0; i<n; i++)
{
xb[MaYi[i].id] = i;
//向右
if(MaYi[i].fx)
{
MaYi[i].l += T;
}else{
MaYi[i].l -= T;
}
shumu[MaYi[i].l]++;
}
sort(MaYi,MaYi+n,cmp);

printf("Case #%d:\n",cs);
for(i=0; i<n; i++)
{
int a = xb[i];

int d = MaYi[a].l;
if(MaYi[a].fx)
{
if(d>=0 && d<=L)
{
if(shumu[d]==1)
{
printf("%d R\n",d);
}else{
printf("%d Turning\n",d);
}
}else{
printf("Fell off\n");
}
}else{
if(d>=0 && d<=L)
{
if(shumu[d]==1)
{
printf("%d L\n",d);
}else{
printf("%d Turning\n",d);
}
}else{
printf("Fell off\n");
}
}

} printf("\n");
}
return 0;
}

Problemsetter: Igor Naverniouk
Alternate solutions: Frank Pok Man Chu and Yury Kholondyrev

• 本文已收录于以下专栏：

## UVA10881----Piotr's Ants

/* 考虑蚂蚁的相遇时，蚂蚁可以理解为互相穿过，最后用a里的蚂蚁的顺序， 在b里面找对应的蚂蚁。 */ #include #include #include using namespa...
• hy1405430407
• 2016年01月21日 16:13
• 222

## UVa 10881 - Piotr's Ants - 水题

• mr_zys
• 2013年12月18日 22:13
• 618

## UVA 10881 - Piotr's Ants(思维题)

Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing e...
• faithdongdong
• 2014年02月03日 22:45
• 964

## Uva-10881-Piotr's Ants

• z309241990
• 2013年03月15日 17:11
• 1056

## UVA 10881 Piotr's Ants -

• qq_34446253
• 2016年10月10日 10:01
• 107

## UVa 10881 Piotr's Ants

• code_pang
• 2013年11月01日 14:02
• 1412

## Piotr's Ants(Uva 10881)

“One thing is for certain: there is no stopping them; the ants will soon be here. And I, for one, we...
• u013225150
• 2015年10月14日 20:14
• 316

## uva 10881 - Piotr's Ants

• cgl1079743846
• 2013年03月12日 18:43
• 928

## Uva 10881 - Piotr's Ants

• u012659423
• 2014年03月07日 19:09
• 645

## UVA 10881 Piotr's Ants

• Dinivity123
• 2013年06月22日 21:11
• 982

举报原因： 您举报文章：Uva 10881 - Piotr's Ants 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)