結果

問題 No.1650 Moving Coins
ユーザー scol_kpscol_kp
提出日時 2021-08-20 21:54:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 4,032 bytes
コンパイル時間 2,024 ms
コンパイル使用メモリ 206,988 KB
実行使用メモリ 8,476 KB
最終ジャッジ日時 2024-10-14 03:27:24
合計ジャッジ時間 6,681 ms
ジャッジサーバーID
（参考情報） 		judge3 / 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 24 ms
5,248 KB
testcase_04 AC 18 ms
5,472 KB
testcase_05 AC 22 ms
5,356 KB
testcase_06 AC 24 ms
5,248 KB
testcase_07 AC 24 ms
5,284 KB
testcase_08 AC 44 ms
7,012 KB
testcase_09 AC 44 ms
6,928 KB
testcase_10 AC 46 ms
7,080 KB
testcase_11 AC 47 ms
6,972 KB
testcase_12 AC 36 ms
6,312 KB
testcase_13 AC 36 ms
6,348 KB
testcase_14 AC 42 ms
6,996 KB
testcase_15 AC 32 ms
6,100 KB
testcase_16 AC 47 ms
7,252 KB
testcase_17 AC 46 ms
7,300 KB
testcase_18 AC 50 ms
7,568 KB
testcase_19 AC 59 ms
8,392 KB
testcase_20 AC 61 ms
8,476 KB
testcase_21 AC 61 ms
8,472 KB
testcase_22 AC 61 ms
8,476 KB
testcase_23 AC 60 ms
8,472 KB
testcase_24 AC 23 ms
5,348 KB
testcase_25 AC 25 ms
5,476 KB
testcase_26 AC 38 ms
6,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
template <class T>
using min_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <std::ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
#if __cplusplus >= 201703L
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
        void operator()(const Args&... args) const {
#endif
            print(args...);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
        void pvec(const T& vec, size_t sz) const {
#endif
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
        void pmat(const T& mat, size_t h, size_t w) const {
#endif
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

void solve() {
    ll N;
    cin >> N;
    Vl A(N), B(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (ll i = 0; i < N; i++) {
        cin >> B[i];
    }
    vector<pair<int, char>> ans;
    int cur = 0;
    for (ll i = 0; i < N; i++) {
        if (A[i] > B[i] && cur < B[i]) {
            for (ll j = 0; j < A[i] - B[i]; j++) {
                ans.emplace_back(i + 1, 'L');
            }
            A[i] = B[i];
            cur = A[i];
        }
    }
    cur = 10000000;
    for (ll i = N - 1; i >= 0; i--) {
        if (A[i] < B[i] && cur > B[i]) {
            for (ll j = 0; j < B[i] - A[i]; j++) {
                ans.emplace_back(i + 1, 'R');
            }
            A[i] = B[i];
            cur = A[i];
        }
    }

    prints()(ans.size());
    for (auto [idx, a] : ans) {
        prints()(idx, a);
    }
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0