#870365 (C++17) No.2307 [Cherry 5 th Tune *] Cool 46

提出ソース

結果

問題	No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー	sten_san
提出日時	2023-05-19 21:48:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,826 ms / 2,000 ms
コード長	4,716 bytes
コンパイル時間	3,255 ms
コンパイル使用メモリ	226,060 KB
実行使用メモリ	22,784 KB
最終ジャッジ日時	2024-12-21 02:20:10
合計ジャッジ時間	67,201 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	143 ms 5,248 KB
testcase_03	AC	314 ms 5,248 KB
testcase_04	AC	319 ms 5,248 KB
testcase_05	AC	321 ms 5,248 KB
testcase_06	AC	315 ms 5,248 KB
testcase_07	AC	247 ms 5,248 KB
testcase_08	AC	524 ms 7,984 KB
testcase_09	AC	491 ms 8,704 KB
testcase_10	AC	638 ms 11,264 KB
testcase_11	AC	748 ms 9,216 KB
testcase_12	AC	472 ms 9,992 KB
testcase_13	AC	1,137 ms 11,596 KB
testcase_14	AC	597 ms 12,032 KB
testcase_15	AC	469 ms 8,432 KB
testcase_16	AC	670 ms 7,680 KB
testcase_17	AC	625 ms 9,900 KB
testcase_18	AC	1,505 ms 22,784 KB
testcase_19	AC	1,249 ms 15,104 KB
testcase_20	AC	1,646 ms 22,656 KB
testcase_21	AC	1,826 ms 21,248 KB
testcase_22	AC	1,484 ms 22,784 KB
testcase_23	AC	1,715 ms 21,760 KB
testcase_24	AC	1,503 ms 19,200 KB
testcase_25	AC	1,554 ms 20,992 KB
testcase_26	AC	1,746 ms 22,656 KB
testcase_27	AC	1,578 ms 21,632 KB
testcase_28	AC	1,675 ms 21,632 KB
testcase_29	AC	1,571 ms 22,400 KB
testcase_30	AC	1,355 ms 16,256 KB
testcase_31	AC	1,698 ms 22,656 KB
testcase_32	AC	1,677 ms 22,784 KB
testcase_33	AC	1,419 ms 22,656 KB
testcase_34	AC	1,387 ms 20,608 KB
testcase_35	AC	1,396 ms 16,128 KB
testcase_36	AC	1,613 ms 19,968 KB
testcase_37	AC	1,486 ms 21,632 KB
testcase_38	AC	46 ms 6,820 KB
testcase_39	AC	71 ms 5,248 KB
testcase_40	AC	48 ms 5,248 KB
testcase_41	AC	303 ms 5,248 KB
testcase_42	AC	1,028 ms 13,440 KB
testcase_43	AC	1,041 ms 13,312 KB
testcase_44	AC	48 ms 5,248 KB
testcase_45	AC	48 ms 5,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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;
}

yukicoder

結果

テストケース

ソースコード