uva 10881

#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;#define MAXN (10000+5)struct node{int num;int wz;char cx;bool operator<(const node a)const{return wz < a.wz;}};node ant[MAXN];int q[MAXN];int main(){int T;scanf("%d", &T);int cases = 0;while(T--){int Lw, t, n;scanf("%d%d%d", &Lw, &t, &n);for(int i = 1; i <= n; i++){char tmp;scanf("%d%c%c", &ant[i].wz, &tmp, &ant[i].cx);ant[i].num = i;}sort(ant+1, ant+n+1);for(int i = 1; i <= n; i++) q[ant[i].num] = i;for(int i = 1; i <= n; i++){char c = ant[i].cx;if(c == 'L') ant[i].wz -= t; else ant[i].wz += t;}sort(ant+1, ant+n+1);printf("Case #%d:\n", ++cases);for(int i = 1; i <= n; i++){int now = q[i];if(ant[now].wz < 0 || ant[now].wz > Lw) printf("Fell off\n");else{printf("%d ", ant[now].wz);if(ant[now].wz==ant[now+1].wz || ant[now].wz==ant[now-1].wz)           printf("Turning\n");else printf("%c\n", ant[now].cx);}}printf("\n");}return 0;}