UVA 10881 Piotr's Ants

思路：大白例题

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 10000
#define LL long long
int cas=1,T;
struct Ant
{
	int id;
	int p;
	int d;
	bool operator<(const Ant&a)const
	{
		return p<a.p;
	}
}before[maxn],after[maxn];
const char dirName[][10]={"L","Turning","R"};
int order[maxn];
int main()
{
	//freopen("in","r",stdin);
	scanf("%d",&T);
	while (T--)
	{
		int L,T,n;
		printf("Case #%d:\n",cas++);
		scanf("%d%d%d",&L,&T,&n);
        for (int i = 0;i<n;i++)
		{
			int p,d;
			char c;
			scanf("%d %c",&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-1;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)
				printf("Fell off\n");
			else
				printf("%d %s\n",after[a].p,dirName[after[a].d+1]);
		}
		printf("\n");
	}
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}