模拟注意细节
一开始因为考虑下一个传的 s+1 没考虑反向囧。。。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n,m,s,f,t[MAXN],l[MAXN],r[MAXN];
int main()
{
// freopen("Spies.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n>>m>>s>>f;
For(i,m) cin>>t[i]>>l[i]>>r[i];
int nowt=1,i=1,dire;
if (s<f) dire=1;else dire=-1;
while (s^f)
{
if (nowt==t[i])
{
if ((l[i]<=s&&s<=r[i])||(l[i]<=s+dire&&s+dire<=r[i]))
{
printf("X");
nowt++;i++;
continue;
}
i++;
}
if (dire==1) printf("R");else printf("L");;
s+=dire;
nowt++;
}
puts("");
return 0;
}