結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー ktr216ktr216
提出日時 2023-05-19 23:45:32
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,559 bytes
コンパイル時間 1,773 ms
コンパイル使用メモリ 176,120 KB
実行使用メモリ 12,928 KB
最終ジャッジ日時 2024-06-01 01:55:04
合計ジャッジ時間 38,325 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 2 ms
6,944 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 179 ms
6,944 KB
testcase_39 AC 279 ms
6,940 KB
testcase_40 AC 315 ms
6,940 KB
testcase_41 AC 335 ms
6,940 KB
testcase_42 AC 455 ms
8,192 KB
testcase_43 AC 458 ms
8,064 KB
testcase_44 AC 446 ms
12,800 KB
testcase_45 AC 454 ms
12,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define double long double

using ll = long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VC = vector<char>;
using VVC = vector<VC>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VVVVI = vector<VVVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VVVVL = vector<VVVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
//using P = pair<int, int>;

#define REP(i, n) for (ll i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {2, 1, -1, -2, -2, -1, 1, 2};
constexpr int DY[] = {1, 2, 2, 1, -1, -2, -2, -1};

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

const ll MOD = 998244353;

const int MAX_N = 400010;
int par[MAX_N];
int rnk[MAX_N];
int siz[MAX_N];

void init(int n) {
    REP(i,n) {
        par[i] = i;
        rnk[i] = 0;
        siz[i] = 1;
    }
}

int find(int x) {
    if (par[x] == x) {
        return x;
    } else {
        return par[x] = find(par[x]);
    }
}

void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    int s = siz[x] + siz[y];
    if (rnk[x] < rnk[y]) {
        par[x] = y;
    } else {
        par[y] = x;
        if (rnk[x] == rnk[y]) rnk[x]++;
    }
    siz[find(x)] = s;
}

bool same(int x, int y) {
    return find(x) == find(y);
}

int size(int x) {
    return siz[find(x)];
}

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    x %= mod;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll gcd(ll x, ll y) {
    if (y == 0) return x;
    return gcd(y, x % y);
}

/*
typedef pair<ll, int> P0;
struct edge { int to; ll cost; };

const int MAX_V = 100000;
//const ll LINF = 1LL<<60;

int V;
vector<edge> G[MAX_V];
ll d[MAX_V];

void dijkstra(ll s) {
    priority_queue<P0, vector<P0>, greater<P0> > que;
    fill(d, d + V, LINF);
    d[s] = 0;
    que.push(P0(0, s));

    while (!que.empty()) {
        P0 p = que.top(); que.pop();
        int v = p.second;
        if (d[v] < p.first) continue;
        for (edge e : G[v]) {
            if (d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(P0(d[e.to], e.to));
            }
        }
    }
}
*/

/*
VL f(400010, 1);

ll C(ll n, ll k) {
    return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD;
}
*/

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //REP(i, 400009) f[i + 1] = f[i] * (i + 1) % MOD;
    int T;
    cin >> T;
    while (T--) {
        int N, M;
        cin >> N >> M;
        multiset<int> red, blue, both;
        REP(i, N) {
            int A;
            cin >> A;
            red.insert(A);
        }
        REP(i, M) {
            int B;
            cin >> B;
            if (red.find(B) == red.end()) {
                blue.insert(B);
            } else {
                red.erase(red.find(B));
                both.insert(B);
            }
        }
        if (both.empty() && !red.empty() && !blue.empty()) {
            cout << "No\n";
            continue;
        }
        cout << "Yes\n";
        if (both.empty()) {
            if (red.empty()) {
                for (int i : blue) {
                    cout << "Blue " << i << endl;
                }
            } else {
                for (int i : red) {
                    cout << "Red " << i << endl;
                }
            }
        } else {
            for (int i : blue) {
                cout << "Blue " << i << endl;
            }
            int count = 0;
            for (int i : both) {
                if (count % 2) {
                    cout << "Red " << i << endl << "Blue " << i << endl;
                } else {
                    cout << "Blue " << i << endl << "Red " << i << endl;
                    if (count == 0) {
                        for (int j : blue) {
                            cout << "Red " << j << endl;
                        }
                    }
                }
                count++;
            }
            for (int i : red) {
                cout << "Red " << i << endl;
            }
        }

    }
}
0