Piotr’s Ants UVA - 10881
题意:
有一个木棍,有n个蚂蚁在上面走,t秒之后,有几只蚂蚁落到了棍下。(碰撞会掉头)
思路:
- 碰撞时,可以看作两个“蚂蚁”互相穿过。
- 那么计算T秒时间后的位置即可。
- 现在的问题是:不清楚哪只蚂蚁的具体位置? 其实也很容易,蚂蚁的相对位置是不变的。用一个order数组保存相对位置即可。(以便按照输入输出)
AC
#include <iostream>
#include <bits/stdc++.h>
#define For(i,x,y) for(int i=(x); i<=(y); i++)
#define fori(i,x,y) for(int i=(x); i<(y); i++)
#define rep(i,y,x) for(int i=(y); i>=(x); i--)
#define mst(x,a) memset(x,a,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int>pa;
typedef pair<ll,ll>pai;
const int maxn = 1e4+10;
struct Ant{
int p;
int d;
int id;
bool operator < (const Ant&x){return p<x.p;}
} before[maxn], after[maxn];
int order[maxn];
char ans[3][20] = {"L","Turning","R"};
int main()
{
//ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tt, kase = 0; scanf("%d", &tt);
while(tt--){
int l, t, n;
scanf("%d%d%d", &l, &t, &n);
For(i,1,n){
int x;
char dr_s[10];
scanf("%d%s", &x, dr_s);
int dr = (dr_s[0]=='L')?-1:1;
before[i] = {x, dr, i};
after[i] = {x+dr*t, dr, i};
}
sort(before+1, before+n+1);
For(i,1,n)order[before[i].id] = i;
sort(after+1, after +n+1);
fori(i,1,n)if(after[i].p == after[i+1].p)after[i].d = after[i+1].d = 0;
printf("Case #%d:\n", ++kase);
For(i,1,n){
int id = order[i];
int x = after[id].p;
if(x < 0 || x > l)printf("Fell off\n");
else printf("%d %s\n",after[id].p, ans[ after[id].d+1 ]);
}
printf("\n");
}
return 0;
}