UVA 10881 [Piotr's Ants]

UVA 10881 [Piotr’s Ants]

index

Description

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

2
10 1 4
1 R
5 R
3 L
10 R
10 2 3
4 R
5 L
8 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 T seconds, print ‘Fell off’ for that ant. Print an empty line after each test case.

Case #1:
2 Turning
6 R
2 Turning
Fell off

Case #2:
3 L
6 R
10 R

code

#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int order[10010];
class Ant
{
public:
    int id;
    int dir;
    int loc;
    Ant(int _id,int _dir,int _loc)
    {
        id=_id;dir=_dir;loc=_loc;
    }
    Ant()
    {
        Ant(0,0,0);
    }
    bool operator<(const Ant &oth)const
    {
        return loc<oth.loc;
    }
};
const char dirNname[][10]={"L","Turning","R"};
int main()
{
    int num,_case=0;
    Ant many[10010];
    cin>>num;
    while(_case<num)
    {
        int L,T,n;
        cin>>L>>T>>n;
        for(int i=0;i<n;i++)
        {
            char form;
            scanf("%d %c",&many[i].loc,&form);
            many[i].dir=(form=='R')?1:-1;
            many[i].id=i;
        }
        sort(many,many+n);
        for(int i=0;i<n;i++)
        {
            order[many[i].id]=i;
            many[i].loc+=T*many[i].dir;
            //printf("%d : %d",i,many[i].loc);
        }
        sort(many,many+n);
        for(int i=0;i<n;i++)
            if(many[i].loc==many[i+1].loc)
                many[i].dir=many[i+1].dir=0;
        cout<<"Case #"<<++_case<<":"<<endl;
        for(int i=0;i<n;i++)
        {
            int ord=order[i];
            if(many[ord].loc<0||many[ord].loc>L)
                printf("Fell off\n");
            else
                printf("%d %s\n",many[ord].loc,dirNname[many[ord].dir+1]);
        }
        printf("\n");//注意presentation
    }
    return 0;
}