题目: https://uva.onlinejudge.org/external/108/10881.pdf
汗!还需努力。对题目的观察还不够,一定有简单的规律可以利用,太急躁了,应该画个图好好分析的。
const int INF =0x3f3f3f3f;
const int maxn= 10000+20 ;
//const int maxm= ;
//by yskysker123
int L,T,n;
struct kk
{
int x;
int d;
int inde;
} a[maxn];
int p[maxn];
bool cmpx(kk a,kk b)
{
return a.x<b.x;
}
int inde[maxn];
void check(int t)
{
int x= a[t].x;
if( x<0||x>L ) a[t].d=0; //当初写成了 x<0||x>10 ;
}
int main()
{
int T_T,kase=0;
scanf("%d",&T_T); //因为变量名T起重了,当初还wa了一次,唉
while(T_T--)
{
scanf("%d%d%d",&L,&T,&n);
char c;
for(int i=1;i<=n;i++)
{
scanf("%d %c",&a[i].x,&c);
a[i].inde=i;
if(c=='L')
a[i].d=-1;
else a[i].d=1;
}
sort(a+1,a+1+n,cmpx);
for(int i=1;i<=n;i++)
{
inde[i]=a[i].inde;
a[i].x+= (a[i].d* T);
}
sort(a+1,a+1+n,cmpx);
for(int i=1;i<=n;i++)
{
check(i);
p[inde[i] ]=i;
if(i>1&&a[i].x==a[i-1].x)
{
a[i].d=a[i-1].d=2;
}
}
printf("Case #%d:\n",++kase);
for(int i=1;i<=n;i++)
{
int x=p[i];
if(a[x].d==0) {puts("Fell off");continue;}
printf("%d ",a[x].x);
if(a[x].d==2) puts("Turning");
else puts(a[x].d==-1?"L":"R");
}
puts("");
}
return 0;
}
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n) for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n) for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n) for(int i=(n) ;i>=0 ;i--)
#define lson num<<1,le,mid
#define rson num<<1|1,mid+1,ri
#define MID int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk make_pair
#define _f first
#define _s second
using namespace std;
//const int INF= ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);