UVA 10881 Piotr's Ants

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

 

---

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

 

题目大意：

　　多只蚂蚁，给定初始位置，初始方向（左或右），然后朝给定的方向走，超过给定的长度L时就会掉下木杆，当两只蚂蚁碰头时，瞬间掉头，让我们计算时间T秒后，各蚂蚁的位置以及方向；

 

解题思路：

　　由于蚂蚁碰头时，是瞬间掉头，于是我们从远处看就像对穿而过，我们就可以处理为对穿而过；

　　另外蚂蚁的相对位置是不变的，所以我们可以存储蚂蚁们的相对位置，也就是说如果蚂蚁1在蚂蚁2之后，则不管出现什么情况蚂蚁1在一直会在蚂蚁2之后；

解题代码：

#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
#define Max 10010

const char dir_name[][10] = {"L", "Turning", "R"};//处理最后的状态 
int order[Max];//记录蚂蚁的相对位置 
struct Ant
{
    int id;//蚂蚁的输入顺序 
    int xx;//位置 
    int chao;//朝向 
}before[Max], after[Max];//before数组存储蚂蚁们的开始状态，after数组存储蚂蚁们的最后状态 

bool cmp(const Ant &a, const Ant &b)
{
    return a.xx < b.xx;
}

int main()
{
    int total;
    scanf ("%d", &total);
    for (int i = 0; i < total; i ++)
    {
        int l, t, n;
        int x;
        char chf;
        scanf ("%d%d%d", &l, &t, &n); 
        for (int j = 0; j < n; j ++)
        {
            scanf ("%d %c", &x, &chf);
            int temp = (chf == 'R') ? 1 : -1;
            before[j] = (Ant){j, x, temp};
            after[j] = (Ant){0, x + temp * t, temp};//最后状态id未知，所以为0 
        }
        printf ("Case #%d:\n", i+1);
        sort(before, before + n, cmp);
        for (int j = 0; j < n; j ++)
        {
            order[before[j].id] = j;//存储蚂蚁们的相对位置 
        }
        sort(after, after + n, cmp);
        for (int j = 0; j < n-1; j ++)
        {
            if (after[j].xx == after[j+1].xx)
                after[j].chao = after[j+1].chao = 0;
        }
        for (int j = 0; j < n; j ++) 
        {
            int k = order[j];//按相对位置顺序输出各蚂蚁的状态 
            if (after[k].xx > l || after[k].xx < 0)//蚂蚁掉下木杆的情况 
                printf ("Fell off\n");
            else
                printf ("%d %s\n", after[k].xx, dir_name[after[k].chao+1]);
        }
        printf ("\n");
    }
}