UVa 10881 Piotr’s Ants-白红宇

UVa 10881 Piotr’s Ants

阅读量：6146 次

发布时间：2019-06-21

本文共 2081 字，大约阅读时间需要 6 分钟。

Piotr's Ants

Time Limit: 2 seconds

"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 poleL 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 upT 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 nextn lines give the locations of then 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 byn lines describing the locations and directions of then 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 polebefore T seconds, print "Fell off" for that ant. Print an empty line after each test case.

Sample Input	Sample Output
210 1 41 R5 R3 L10 R10 2 34 R5 L8 R	Case #1:2 Turning6 R2 TurningFell offCase #2:3 L6 R10 R

蚂蚁相对位置不会改变

1 #include 
      
        2 #include 
       
         3 #include 
         4 #include 
         
           5 using namespace std; 6 map 
          
            v; 7 struct Node 8 { 9     int loc;10     char direc;11     int num;12 }a[10005];13 bool cmp(Node x,Node y)14 {15     return x.loc
           
            l)64 printf("Fell off\n");65 else66 {67 if(v[a[i].loc]>1)68 printf("%d Turning\n",a[i].loc);69 else70 printf("%d %c\n",a[i].loc,a[i].direc);71 }72 }73 printf("\n");74 /*for(i=1;i<=n;i++)75 printf("%d ",a[i].num);76 printf("&&*\n");*/77 }78 return 0;79 }

View Code

转载于:https://www.cnblogs.com/cyd308/p/4669812.html

你可能感兴趣的文章