#ifndef HIDDEN_IN_VISUAL_STUDIO // 無意味.折りたたむのが目的. // 警告の抑制 #define _CRT_SECURE_NO_WARNINGS // 使えるライブラリの読み込み #include #include // function using namespace std; // 型名の短縮 using ll = long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9) using pii = pair; using pll = pair; using pil = pair; using pli = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vc = vector; using vvc = vector; using vvvc = vector; using vd = vector; using vvd = vector; using vvvd = vector; template using priority_queue_rev = priority_queue, greater>; // 定数の定義 const double PI = 3.14159265359; // 円周率 const double DEG = PI / 180.0; // θ [deg] = θ * DEG [rad] const vi dx4 = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左) const vi dy4 = { 0, 1, 0, -1 }; const vi dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }; // 8 近傍 const vi dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 }; const ll INFL = (ll)1e18; const int INF = (int)1e9; const double EPS = 1e-10; // 許容誤差に応じて調整 // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((int)(x).size()) #define Yes(b) {cout << ((b) ? "Yes" : "No") << endl;} #define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順 #define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順 #define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順 #define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能) #define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能) #define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索(昇順) #define repbm(mid, set, d) for(int mid = set; mid < (1 << int(d)); mid = (mid + 1) | set) // set を含む部分集合の全探索(昇順) #define repbs(sub, set) for (int sub = set, bsub = 1; bsub > 0; bsub = sub, sub = (sub - 1) & set) // set の部分集合の全探索(降順) #define repbc(set, k, d) for (int set = (1 << k) - 1, lb, nx; set < (1 << n); lb = set & -set, nx = set + lb, set = (((set & ~nx) / lb) >> 1) | nx) // 大きさ k の部分集合の全探索 #define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順) #define repit(it, a) for(auto it = (a).begin(); it != (a).end(); ++it) // イテレータを回す(昇順) #define repitr(it, a) for(auto it = (a).rbegin(); it != (a).rend(); ++it) // イテレータを回す(降順) // 汎用関数の定義 inline ll pow(ll n, int k) { ll v = 1; rep(i, k) v *= n; return v; } inline ll pow(int n, int k) { ll v = 1; rep(i, k) v *= n; return v; } template inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) // 入出力用の >>, << のオーバーロード template inline istream& operator>> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template inline ostream& operator<< (ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template inline istream& operator>> (istream& is, tuple& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; } template inline ostream& operator<< (ostream& os, const tuple& t) { os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")"; return os; } template inline istream& operator>> (istream& is, tuple& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t); return is; } template inline ostream& operator<< (ostream& os, const tuple& t) { os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << "," << get<3>(t) << ")"; return os; } template inline istream& operator>> (istream& is, vector& v) { repea(x, v) is >> x; return is; } template inline ostream& operator<< (ostream& os, const vector& v) { repe(x, v) os << x << " "; return os; } template inline ostream& operator<< (ostream& os, const set& s) { repe(x, s) os << x << " "; return os; } template inline ostream& operator<< (ostream& os, const unordered_set& s) { repe(x, s) os << x << " "; return os; } template inline ostream& operator<< (ostream& os, const map& m) { repe(p, m) os << p << " "; return os; } // 手元環境(Visual Studio) #ifdef _MSC_VER #define popcount (int)__popcnt // 全ビットにおける 1 の個数 #define popcountll (int)__popcnt64 inline int ctz(unsigned int n) { unsigned long i; _BitScanForward(&i, n); return i; } // 下位ビットに並ぶ 0 の個数 ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // 最大公約数 #define dump(x) cerr << "[DEBUG]" << endl << x << endl; // デバッグ出力用 #define dumpel(v) cerr << "[DEBUG]" << endl; for (const auto& x : v) {cout << x << endl;} // 提出用(GCC) #else #define popcount (int)__builtin_popcount #define popcountll (int)__builtin_popcountll #define ctz __builtin_ctz #define gcd __gcd #define dump(x) #define dumpel(v) #endif #endif // 無意味.折りたたむのが目的. //-----------------AtCoder 専用----------------- #include using namespace atcoder; // mint で使いたい法によってここを切り替える using mint = modint1000000007; //using mint = modint998244353; //using mint = modint; // mint::set_mod(10000); // mint の法の指定 istream& operator>> (istream& is, mint& x) { ll tmp; is >> tmp; x = tmp; return is; } // mint の入力用 ostream& operator<< (ostream& os, const mint& x) { os << x.val(); return os; } // mint の出力用 using vm = vector; using vvm = vector; using vvvm = vector; //---------------------------------------------- int main() { cout << fixed << setprecision(15); // 小数点以下の桁数の指定 int n; cin >> n; vi a(n), b(n); cin >> a >> b; // int n = 20; // vi a = { 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 20, 22, 23, 25, 28, 29, \ //30 }; // vi b = { 31, 32, 35, 38, 39, 40, 41, 42, 43, 45, 47, 48, 51, 52, 53, 54, 55, \ //56, 58, 60 }; int res = 0; rep(i, n) { res += abs(b[i] - a[i]); } cout << res << endl; int i0 = 0, tmp = 0;; rep(i, n) { if (b[i] <= a[i]) { rep(hoge, a[i] - b[i]) { a[i]--; cout << i + 1 << " " << "L" << endl; tmp++; } i0 = i + 1; } else { if (i == n - 1 || b[i] < a[i + 1]) { rep(hoge, b[i] - a[i]) { int ni = i0; repir(j, i, i0) { a[j]++; cout << j + 1 << " " << "R" << endl; tmp++; if (a[j] == b[j]) { chmax(ni, j + 1); } } i0 = ni; } } else { rep(hoge, a[i + 1] - a[i] - 1) { int ni = i0; repir(j, i, i0) { a[j]++; cout << j + 1 << " " << "R" << endl; tmp++; if (a[j] == b[j]) { chmax(ni, j + 1); } } i0 = ni; } } } } dump(a); dump(b); dump(tmp); }