Codeforces Round #199 (Div. 2) -- B. Xenia and Spies （簡單模拟）

B. Xenia and Spies time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

Xenia the vigorous detective faced n (n ≥ 2) foreign spies lined up in a row. We'll consider the spies numbered from 1 to n from left to right.

Spy s has an important note. He has to pass the note to spy f. Xenia interrogates the spies in several steps. During one step the spy keeping the important note can pass the note to one of his neighbours in the row. In other words, if this spy's number is x, he can pass the note to another spy, either x - 1 or x + 1 (if x = 1 or x = n, then the spy has only one neighbour). Also during a step the spy can keep a note and not pass it to anyone.

But nothing is that easy. During m steps Xenia watches some spies attentively. Specifically, during step ti (steps are numbered from 1) Xenia watches spies numbers li, li + 1, li + 2, ..., ri (1 ≤ li ≤ ri ≤ n). Of course, if during some step a spy is watched, he can't do anything: neither give the note nor take it from some other spy. Otherwise, Xenia reveals the spies' cunning plot. Nevertheless, if the spy at the current step keeps the note, Xenia sees nothing suspicious even if she watches him.

You've got s and f. Also, you have the steps during which Xenia watches spies and which spies she is going to watch during each step. Find the best way the spies should act in order to pass the note from spy s to spy f as quickly as possible (in the minimum number of steps).

Input

The first line contains four integers n, m, s and f (1 ≤ n, m ≤ 105; 1 ≤ s, f ≤ n; s ≠ f; n ≥ 2). Each of the following m lines contains three integers ti, li, ri (1 ≤ ti ≤ 109, 1 ≤ li ≤ ri ≤ n). It is guaranteed that t1 < t2 < t3 < ... < tm.

Output

Print k characters in a line: the i-th character in the line must represent the spies' actions on step i. If on step i the spy with the note must pass the note to the spy with a lesser number, the i-th character should equal "L". If on step i the spy with the note must pass it to the spy with a larger number, the i-th character must equal "R". If the spy must keep the note at the i-th step, the i-th character must equal "X".

As a result of applying the printed sequence of actions spy s must pass the note to spy f. The number of printed characters k must be as small as possible. Xenia must not catch the spies passing the note.

If there are miltiple optimal solutions, you can print any of them. It is guaranteed that the answer exists.

Examples Input

3 5 1 3
1 1 2
2 2 3
3 3 3
4 1 1
10 1 3
      

Output

XXRR
大體題意：

有n 個間諜，标号為1到n，有m 行檢查， 告訴你起點标号s，終點标号f。
問如何去走才能從起點到終點！
思路：
簡單模拟即可！
當s！= f 就一直循環。
先算出下一步是L 還是R，
然後看看是不是在檢查區間内，
在的話 +X，否則 加ch = L || R！
注意，連續的兩個檢查 時間可能跳度非常大，注意時間不想等就一直走就好了！
       
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 1000000 + 10;
vector<char>ans;
char st[maxn];
int l[maxn],r[maxn],t[maxn];
int main(){
    int n,m,s,f;
    while(scanf("%d %d %d %d",&n,&m,&s,&f) == 4 ){
        for (int i = 0; i < m ;++i){
            scanf("%d %d %d",&t[i],&l[i],&r[i]);
        }
        int cnt = 0;
        int i=0,j=1;
        while(s != f){
//        printf("%d\n",cnt);
            int ns = s;
            int ok = 1;
            char ch;
            if (s < f){ns = s+1;ch = 'R';}
            else {
                ns = s-1;
                ch = 'L';
            }
            if (i < m && j == t[i]){
                if (s >= l[i] && s <= r[i] || ns >= l[i] && ns <= r[i])ok=0;
                i++;
            }
            if (ok)st[cnt++]=ch,s=ns;
            else st[cnt++] = 'X';
            ++j;
        }
        st[cnt] = 0;
        puts(st);
    }
    return 0;
}