Piotr's Ants UVa 10881

 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <queue>
 #include <vector>
 #define maxn 10005
 #define L -1
 #define R 1
 #define fell 10
 #define Turning  -10
 #define On 0;

 using namespace std;
 struct ants{
     int location;
     int direction;
     int inputorder;
     int state;
     bool operator < (const ants& a) const{
         return location <a.location;
     }
 }Ant[maxn];

 int main(){
     //if(freopen("input.txt","r",stdin)== NULL)  {printf("Error\n"); exit(0);}

     int n,l,T;
     int N;
     cin>>N;
     for(int test=;test<=N;test++){
         cin>>l>>T>>n;
         int a;
         char ch;
         for(int i=;i<=n;i++){
             cin>>a>>ch;

             if(ch == 'R')    Ant[i].direction = R;
             else             Ant[i].direction = L;
             Ant[i].location = a;
             Ant[i].inputorder = i;
         }
         sort(Ant+,Ant+n+);
         int order[maxn];
         for(int i=;i<=n;i++){
             order[Ant[i].inputorder] = i;
         }

         for(int i=;i<=n;i++) Ant[i].location += T * Ant[i].direction;

         sort(Ant+,Ant+n+);

         for(int i=;i<=n;i++)
            if(Ant[i].location <  || Ant[i].location > l)
              Ant[i].state = fell;
            else if(Ant[i].location == Ant[i+].location && i < n) {
                 Ant[i].state = Ant [i+].state = Turning;
                 i++;
               }
            else
              Ant[i].state = On;
         printf("Case #%d:\n",test);

         for(int i=;i<=n;i++){
             int j = order[i];
             if(Ant[j].state == fell) printf("Fell off\n");
             else if(Ant[j].state == Turning){
                 printf("%d Turning\n",Ant[j].location);
             }
             else
                 printf("%d %c\n",Ant[j].location,Ant[j].direction == R ? 'R' : 'L');

         }
         printf("\n");
     }
 }