Uva 10881

#include "iostream"
#include "algorithm"
const int maxn=10000+5;
using namespace std;
struct Ant{
    int id;
    int p;
    int d;
    bool operator<(const Ant &a){
        return p<a.p;
    }
}before[maxn],after[maxn];
const char dirName[][10]={"L","Turning","R"};
int order[maxn];
int main(){
     int K;
    cin>>K;
    for(int kase=1;kase<=K;kase++){
        int L,T,n;
        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;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 a=order[i];
            if(after[a].p<0||after[a].p>L) cout<<"Fell off\n";
            else cout<<after[a].p<<'\t'<<dirName[after[a].d+1]<<endl;
        }
        cout<<endl;
    }
    return 0;
}