結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー sten_sansten_san
提出日時 2023-05-19 21:48:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,525 ms / 2,000 ms
コード長 4,716 bytes
コンパイル時間 4,697 ms
コンパイル使用メモリ 221,824 KB
実行使用メモリ 22,780 KB
最終ジャッジ日時 2023-08-23 02:55:14
合計ジャッジ時間 62,312 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 128 ms
4,384 KB
testcase_03 AC 279 ms
4,380 KB
testcase_04 AC 286 ms
4,376 KB
testcase_05 AC 280 ms
4,376 KB
testcase_06 AC 274 ms
4,380 KB
testcase_07 AC 217 ms
4,376 KB
testcase_08 AC 441 ms
7,792 KB
testcase_09 AC 410 ms
8,596 KB
testcase_10 AC 547 ms
11,164 KB
testcase_11 AC 619 ms
9,132 KB
testcase_12 AC 378 ms
10,000 KB
testcase_13 AC 933 ms
11,500 KB
testcase_14 AC 495 ms
12,088 KB
testcase_15 AC 379 ms
8,616 KB
testcase_16 AC 579 ms
7,736 KB
testcase_17 AC 505 ms
9,872 KB
testcase_18 AC 1,261 ms
22,628 KB
testcase_19 AC 1,053 ms
14,992 KB
testcase_20 AC 1,454 ms
22,636 KB
testcase_21 AC 1,519 ms
21,004 KB
testcase_22 AC 1,234 ms
22,780 KB
testcase_23 AC 1,524 ms
21,856 KB
testcase_24 AC 1,201 ms
19,348 KB
testcase_25 AC 1,285 ms
21,156 KB
testcase_26 AC 1,525 ms
22,604 KB
testcase_27 AC 1,300 ms
21,536 KB
testcase_28 AC 1,439 ms
21,760 KB
testcase_29 AC 1,419 ms
22,252 KB
testcase_30 AC 1,074 ms
16,184 KB
testcase_31 AC 1,469 ms
22,640 KB
testcase_32 AC 1,471 ms
22,652 KB
testcase_33 AC 1,146 ms
22,584 KB
testcase_34 AC 1,147 ms
20,488 KB
testcase_35 AC 1,174 ms
16,040 KB
testcase_36 AC 1,376 ms
19,960 KB
testcase_37 AC 1,302 ms
21,540 KB
testcase_38 AC 42 ms
4,380 KB
testcase_39 AC 64 ms
4,380 KB
testcase_40 AC 41 ms
4,380 KB
testcase_41 AC 277 ms
4,380 KB
testcase_42 AC 904 ms
13,344 KB
testcase_43 AC 905 ms
13,440 KB
testcase_44 AC 41 ms
4,376 KB
testcase_45 AC 42 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    int t; cin >> t;

    while (t--) {
        int n, m; cin >> n >> m;
        auto a = vec<int>(uns, n);
        auto b = vec<int>(uns, m);
        for (auto &e : a) cin >> e;
        for (auto &e : b) cin >> e;

        if (n == 0) {
            cout << "Yes" << '\n';
            for (auto v : b) {
                cout << "Blue " << v << '\n';
            }
            continue;
        }

        if (m == 0) {
            cout << "Yes" << '\n';
            for (auto v : a) {
                cout << "Red " << v << '\n';
            }
            continue;
        }

        bool exists = false;

        map<int, bool> f;
        for (auto v : a) {
            f[v] = true;
        }

        map<int, bool> g;
        for (auto v : b) {
            g[v] = f[v];
            exists |= f[v];
        }

        if (!exists) {
            cout << "No" << '\n';
            continue;
        }

        cout << "Yes" << '\n';

        sort(begin(a), end(a), [&](int x, int y) {
            return make_tuple(g[x], x) < make_tuple(g[y], y);
        });

        int iter1 = 0;
        while (iter1 < n && !g[a[iter1]]) {
            cout << "Red " << a[iter1++] << '\n';
        }

        sort(begin(b), end(b), [&](int x, int y) {
            if (y == a[iter1]) {
                return false;
            }
            if (x == a[iter1]) {
                return true;
            }
            return make_tuple(g[x], x) < make_tuple(g[y], y);
        });

        cout << "Red " << a[iter1++] << '\n';

        int iter2 = 0;

        cout << "Blue " << b[iter2++] << '\n';
        while (iter2 < m && !g[b[iter2]]) {
            cout << "Blue " << b[iter2++] << '\n';
        }

        bool turn = false;
        while (iter1 < n || iter2 < m) {
            if (!turn) {
                cout << "Blue " << b[iter2++] << '\n';
                if (iter1 < n) {
                    cout << "Red " << a[iter1++] << '\n';
                }
            }
            else {
                cout << "Red " << a[iter1++] << '\n';
                if (iter2 < m) {
                    cout << "Blue " << b[iter2++] << '\n';
                }
            }
            turn = !turn;
        }
    }

    cout << flush;
}
0