
LSTTCD2
By:
cpc_1996 on
Jun 26th, 2012 | syntax:
None | size: 1.79 KB | hits: 15 | expires: Never
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <locale>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <conio.h>
using namespace std;
#define maxn 100000
#define fo(i, a, b) for(int i=a; i<=b; i++)
#define fod(i, a, b) for(int i=a; i>=b; i--)
#define mp make_pair
#define pb push_back
#define pp pop_back
#define as assign
#define fi first
#define se second
typedef pair <int ,int> ii;
typedef vector <int> vi;
typedef vector <ii> vii;
typedef vector <vi> vvi;
bool cmp(ii x, ii y)
{
if (x.fi == y.fi) return x.se < y.se;
return x.fi<y.fi;
}
/*------------------------------------------------------------------------------*/
void run1(int b) // b---------->1-------->b-1
{
if(b==1) return;
int k=(x-1)/2;
if(b%2==0) {
if(k!=0) fo(i,1 ,k) printf("L 2\n");
printf("L 1\n");fo(i, 1, k) printf("R 2\n");
}
else {
fo(i, 1, k) printf("L 2\n");printf("R 1\n");
fo(i, 1, k-1) printf("R 2\n");
}
}
void run2(int b) // b--------->n--------->b+1
{
if(b==n) return;
int k=(n-b)/2;
if((n-b)%2==1) {
if(k!=0) fo(i,1 ,k) printf("L 2\n");
printf("L 1\n");fo(i, 1, k) printf("R 2\n");
}
else {
fo(i, 1, k) printf("L 2\n");printf("R 1\n");
fo(i, 1, k-1) printf("R 2\n");
}
}
main()
{
int n, x, y;
scanf("%d%d%d", &n, &x, &y);
if((abs(x-y)==1||x==y)&&(x>1 && y<n)) printf("-1");
else {
if(x<y) {
else printf("R 1\n");
if(y-x+2!=0) fo(i, 1, y-x+2) printf("R 1\n");
if(y<n)