結果

問題 No.1650 Moving Coins
ユーザー packer_jppacker_jp
提出日時 2021-08-20 21:48:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 414 ms / 2,000 ms
コード長 4,766 bytes
コンパイル時間 2,089 ms
コンパイル使用メモリ 204,540 KB
実行使用メモリ 28,288 KB
最終ジャッジ日時 2024-10-14 03:15:54
合計ジャッジ時間 13,327 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 265 ms
5,248 KB
testcase_04 AC 195 ms
5,248 KB
testcase_05 AC 231 ms
5,248 KB
testcase_06 AC 260 ms
5,248 KB
testcase_07 AC 274 ms
5,248 KB
testcase_08 AC 328 ms
5,248 KB
testcase_09 AC 326 ms
14,336 KB
testcase_10 AC 327 ms
5,248 KB
testcase_11 AC 333 ms
9,216 KB
testcase_12 AC 304 ms
7,296 KB
testcase_13 AC 309 ms
7,552 KB
testcase_14 AC 342 ms
8,960 KB
testcase_15 AC 290 ms
6,016 KB
testcase_16 AC 349 ms
8,704 KB
testcase_17 AC 330 ms
8,576 KB
testcase_18 AC 364 ms
9,728 KB
testcase_19 AC 393 ms
28,288 KB
testcase_20 AC 383 ms
6,528 KB
testcase_21 AC 414 ms
17,280 KB
testcase_22 AC 400 ms
6,400 KB
testcase_23 AC 390 ms
6,528 KB
testcase_24 AC 252 ms
5,248 KB
testcase_25 AC 262 ms
5,248 KB
testcase_26 AC 121 ms
6,528 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
ull bit(int n) { return 1ull << n; }
template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr ll DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr ll DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
ll sign(ll a) { return (a > 0) - (a < 0); }
ll cdiv(ll a, ll b) { return (a - 1 + b) / b; }
template <typename T> T sq(const T &a) { return a * a; }
template <typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    auto [t, u, v] = a;
    os << "(" << t << ", " << u << ", " << v << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); }
    os << "}";
    return os;
}
struct setup {
    static constexpr ll PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

#ifdef ONLINE_JUDGE
#define dump(...) (void(0))
#else
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {
    cerr << head;
    if (sizeof...(Tail)) cerr << ", ";
    debug(tail...);
}
#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)
#endif

struct rep {
    struct itr {
        int v;
        itr(int v) : v(v) {}
        void operator++() { ++v; }
        int operator*() const { return v; }
        bool operator!=(const itr &i) const { return v != i.v; }
    };
    int l, r;
    rep(int r) : l(0), r(r) {}
    rep(int l, int r) : l(l), r(r) {}
    itr begin() const { return l; };
    itr end() const { return r; };
};
struct per {
    struct itr {
        int v;
        itr(int v) : v(v) {}
        void operator++() { --v; }
        int operator*() const { return v; }
        bool operator!=(const itr &i) const { return v != i.v; }
    };
    int l, r;
    per(int r) : l(0), r(r) {}
    per(int l, int r) : l(l), r(r) {}
    itr begin() const { return r - 1; };
    itr end() const { return l - 1; };
};

int main() {
    ll n;
    cin >> n;
    vll a(n), b(n);
    for (ll i : rep(n)) cin >> a[i];
    for (ll i : rep(n)) cin >> b[i];
    ll ans = 0;
    for (ll i : rep(n)) ans += abs(a[i] - b[i]);
    cout << ans << endl;
    auto rec = [&](auto rec, ll cur) -> void {
        if (cur == n) return;
        if (cur == n - 1 || b[cur] < a[cur + 1]) {
            while (a[cur] < b[cur]) {
                cout << cur + 1 << " R" << endl;
                a[cur]++;
            }
            while (a[cur] > b[cur]) {
                cout << cur + 1 << " L" << endl;
                a[cur]--;
            }
            rec(rec, cur + 1);
        } else {
            rec(rec, cur + 1);
            while (a[cur] < b[cur]) {
                cout << cur + 1 << " R" << endl;
                a[cur]++;
            }
            while (a[cur] > b[cur]) {
                cout << cur + 1 << " L" << endl;
                a[cur]--;
            }
        }
    };
    rec(rec, 0);
}
0