UVa10881-Piotr's Ants

蚂蚁的题，弹性碰撞

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10010;
struct ant
{
    int id;
    int p;
    int d;///朝向：1：右，0：转身中，-1：左
    bool operator < (const ant& x) const{
        return p < x.p;
    }
}before[maxn],after[maxn];

int order[maxn];///代表最后状态的第i只蚂蚁的是第order[i]个
const char name[][10] = {"L", "Turning", "R"};
int main()
{
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase<= T; kase++)
    {
        int l, t, n;
        int p, d;
        char c;

        scanf("%d%d%d", &l, &t, &n);
        for(int i = 0; i< n; i++)
        {
            scanf("%d %c", &p, &c);
            d = (c == 'L' ? -1 : 1);
            before[i] = (ant){i, p, d};
            after[i] = (ant){0, p+t*d, d};
        }
        sort(before, before+n);
        for(int i = 0; i< n; i++)
        {
            order[before[i].id] = i;
        }
        sort(after, after+n);
        for(int i = 0; i< n-1; i++)///修改碰撞中的蚂蚁的方向
        {
            if(after[i].p == after[i+1].p)
                after[i].d = after[i+1].d = 0;
        }
        printf("Case #%d:\n", kase);
        for(int i = 0; i< n; i++)
        {
            int a = order[i];
            if(after[a].p < 0 || after[a].p > l )
                printf("Fell off\n");
            else
                printf("%d %s\n", after[a].p, name[after[a].d+1]);
        }
        printf("\n");
    }
    return 0;
}