UVALive 6662 TheLastAnt

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 struct xxx
 {
     int p,d;
 }a[];
 int n,l;
 bool f[];
 int main()
 {
     while (~scanf("%d%d",&n,&l))
     {
         if (n==&&l==) break;
         for (int i=;i<=n;i++)
         {
             char s[];
             scanf("%s",s);
             scanf("%d",&a[i].p);
             if (s[]=='R') a[i].d=;
             else a[i].d=;
         }
         int ti=,tot=n;
         memset(f,,sizeof(f));
         int ans;
         while (tot)
         {
             ti++;
             for (int i=;i<=n;i++)
                 if (!f[i])
                 {
                     if (a[i].d==) a[i].p++;
                     else a[i].p--;
                 }
             for (int i=;i<=n;i++)
                 if (!f[i])
                 {
                     if (a[i].p>=l)
                     {
                         ans=i;
                         f[i]=;
                         tot--;
                     }
                 }
             for (int i=;i<=n;i++)
                 if (!f[i])
                 {
                     if (a[i].p<)
                     {
                         ans=i;
                         f[i]=;
                         tot--;
                     }
                 }
             for (int i=;i<=n;i++)
                 for (int j=i+;j<=n;j++)
                     if (a[i].p==a[j].p)
                     {
                         a[i].d^=;
                         a[j].d^=;
                     }
         }
         printf("%d %d\n",ti,ans);
     }
     return ;
 }