Uva 10881 - Piotr's Ants

原创 2015年07月09日 10:15:14

"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

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

BNU19299 UVA10881 Piotr's Ants

Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVA. Original ID: 108...

UVA10881 Piotr's Ants

题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category...

UVA 10881 Piotr's Ants

很好的一道想法题 首先是从宏观上来看 每个蚂蚁相撞后返回等同于对穿而过 并且 每个蚂蚁的相对位置不变 看穿这两点后 代码还是很好编的 #include #include #include #inclu...

UVA - 10881 Piotr's Ants(思维)

点击打开题目链接 Piotr’s AntsDescriptionPiotr likes playing with ants. He has n of them on a horizontal pol...

UVa 10881 - Piotr's Ants - 水题

题目描述:lrj后白书第一章第五道例题 题目分析:1)从宏观上看,蚂蚁碰撞并没有影响它们的爬行; 2) 蚂蚁的相对位置是不会变的。所以只需要处理初始状态和最后的状态即可。 下面是代码: #inc...

UVA - 10881 Piotr's Ants

题目大意:长 L 的绳子上有 n 只蚂蚁,给出它们的初始位置和方向,移动 T 秒,两只蚂蚁相碰后会掉头,问经过 T 秒后每只蚂蚁的位置和方向,掉下绳子输出 Fell off,如果有两只在同一个位置时输...

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...

UVA-10881 - Piotr's Ants

Piotr's Ants Time Limit: 2 seconds "One thing is for certain: there is no stopping them;...

UVA 10881 Piotr's Ants (思维)

Problem D Piotr's Ants Time Limit: 2 seconds "One thing is for certain: there is no stopping them; ...

Uva 10881 - Piotr's Ants( 转换思维 )

题目链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=20&page=show_pro...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)