uva10881

1.蚂蚁相对位置不变,因为一旦碰撞就会掉头
2.碰撞看成对穿

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e4 + 7;
int l, t, n, k, p, d, order[maxn];
char s;

struct Node {
	int id;
	int pos;
	int state;
	bool operator<(const Node& a) {
		return pos < a.pos;
	}
}input[maxn],change[maxn];

char outChar[3][10] = { "L","Turning","R"};

int main()
{
	cin >> k;
	for (int kCase = 1; kCase <= k; kCase++) {
		cin >> l >> t >> n;
		for (int i = 0; i < n; i++) {
			cin >> p >> s;
			d = s == 'L' ? -1 : 1;
			input[i] = Node{i,p,d};
			change[i] = Node{0,p + t * d,d};
		}
		sort(input, input + n);

		for (int i = 0; i < n; i++) order[input[i].id] = i;

		sort(change, change + n);

		for (int i = 0; i < n - 1; i++) {
			if (change[i].pos == change[i + 1].pos) change[i].state = change[i + 1].state = 0;
		}

		cout << "Case #" << kCase << ":" << endl;
		for (int i = 0; i < n; i++) {
			int a = order[i], pos = change[a].pos,state = change[a].state;
			if (pos < 0 || pos > l) cout << "Fell off" << endl;
			else cout << pos << " " << outChar[state + 1] << endl;
		}
		cout << endl;
	}
	return 0;
}