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

• 問題: No.2307 [Cherry 5 th Tune *] Cool 46
• ユーザー: sgfc
• 提出日時: 2023-05-19 21:37:50
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 474 ms / 2,000 ms
• コード長: 4,527 bytes
• コンパイル時間: 3,380 ms
• コンパイル使用メモリ: 176,028 KB
• 実行使用メモリ: 13,056 KB
• 最終ジャッジ日時: 2024-05-10 08:10:08
• 合計ジャッジ時間: 20,950 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	191 ms; 5,376 KB
testcase_03	AC	197 ms; 5,376 KB
testcase_04	AC	202 ms; 5,376 KB
testcase_05	AC	190 ms; 5,376 KB
testcase_06	AC	201 ms; 5,376 KB
testcase_07	AC	153 ms; 5,376 KB
testcase_08	AC	231 ms; 6,944 KB
testcase_09	AC	238 ms; 7,424 KB
testcase_10	AC	232 ms; 7,424 KB
testcase_11	AC	284 ms; 6,656 KB
testcase_12	AC	215 ms; 6,784 KB
testcase_13	AC	386 ms; 7,296 KB
testcase_14	AC	251 ms; 7,808 KB
testcase_15	AC	199 ms; 6,144 KB
testcase_16	AC	293 ms; 5,504 KB
testcase_17	AC	244 ms; 6,144 KB
testcase_18	AC	430 ms; 12,928 KB
testcase_19	AC	378 ms; 8,724 KB
testcase_20	AC	462 ms; 12,800 KB
testcase_21	AC	438 ms; 11,256 KB
testcase_22	AC	418 ms; 12,928 KB
testcase_23	AC	451 ms; 12,160 KB
testcase_24	AC	416 ms; 10,624 KB
testcase_25	AC	471 ms; 11,392 KB
testcase_26	AC	454 ms; 13,056 KB
testcase_27	AC	407 ms; 11,904 KB
testcase_28	AC	441 ms; 11,776 KB
testcase_29	AC	462 ms; 12,544 KB
testcase_30	AC	396 ms; 10,344 KB
testcase_31	AC	474 ms; 12,928 KB
testcase_32	AC	473 ms; 13,056 KB
testcase_33	AC	426 ms; 13,056 KB
testcase_34	AC	411 ms; 11,904 KB
testcase_35	AC	384 ms; 9,208 KB
testcase_36	AC	427 ms; 10,440 KB
testcase_37	AC	427 ms; 11,776 KB
testcase_38	AC	296 ms; 6,944 KB
testcase_39	AC	414 ms; 6,944 KB
testcase_40	AC	313 ms; 6,944 KB
testcase_41	AC	311 ms; 6,948 KB
testcase_42	AC	363 ms; 9,136 KB
testcase_43	AC	377 ms; 9,268 KB
testcase_44	AC	420 ms; 12,800 KB
testcase_45	AC	418 ms; 12,928 KB

ソースコード

#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <array>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <cmath>
#include <math.h>
#include <climits>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPI(i, init, n) for (ll i = init; i < (n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;

using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

using namespace std;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll t;
    cin >> t;
    REP(ttt, t) {
        ll n, m;
        cin >> n >> m;

        vector<ll> b;

        set<ll> red;
        REP(i, n) {
            ll a;
            cin >> a;
            red.insert(a);
        }
        set<ll> blue;
        REP(i, m) {
            ll a;
            cin >> a;

            auto it = red.find(a);
            if (it != red.end()) {
                b.push_back(a);
                red.erase(it);
            }
            else {
                blue.insert(a);
            }
        }

        if (n != 0 && m != 0) {
            yn(!b.empty());
            if (!b.empty()) {
                for (auto rc : red) {
                    cout << "Red " << rc << endl;
                }
                cout << "Red " << b[0] << endl;
                cout << "Blue " << b[0] << endl;
                for (auto bc : blue) {
                    cout << "Blue " << bc << endl;
                }

                REPI(i, 1, b.size()) {
                    if (i % 2 == 0) {
                        cout << "Red " << b[i] << endl;
                        cout << "Blue " << b[i] << endl;
                    }
                    else {
                        cout << "Blue " << b[i] << endl;
                        cout << "Red " << b[i] << endl;
                    }
                }
            }
        }
        else {
            cout << "Yes" << endl;
            for (auto rc : red) {
                cout << "Red " << rc << endl;
            }
            for (auto bc : blue) {
                cout << "Blue " << bc << endl;
            }

        }
    }

    return 0;
}