UVA10881 Piotr‘s Ants

#include <iostream>
#include <cstdio>
#include "bits/stdc++.h"
#define ll  long long
using namespace std;

const int maxn = 10000 + 5;

int L,T,n;
struct Ant{
    int id;
    int p; // 位移
    int d; // L -1 R 1
    bool operator < (const Ant & b) const{
        return p < b.p;
    }
}before[maxn],after[maxn];
int order[maxn];
char dir[3][10] = {"L","Turning","R"};

int main(){
    int K;
    cin>>K;
    for(int kase = 0;kase<K;kase++)
    {
        printf("Case #%d:\n",kase+1);
        cin>>L>>T>>n;
        for(int i = 0;i<n;i++)
        {
            int p,d;
            char c;
            cin>>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;
            }
        }

        for(int i = 0;i<n;i++)
        {
            int id = order[i];
            if(after[id].p < 0 || after[id].p > L) printf("Fell off\n");
            else{
                printf("%d %s\n",after[id].p,dir[after[id].d+1]);
            }
        }
        cout<<endl;
    }
    return 0;
}
/**
 *
 *
2
10 1 4
1 R
5 R
3 L
10 R
 10 2 3
 4 R
 5 L
 8 R
 
 */