結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー 👑 eoeoeoeo
提出日時 2023-05-19 22:24:05
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 532 ms / 2,000 ms
コード長 6,925 bytes
コンパイル時間 3,738 ms
コンパイル使用メモリ 257,884 KB
実行使用メモリ 13,556 KB
最終ジャッジ日時 2024-12-21 03:10:58
合計ジャッジ時間 44,098 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 225 ms
5,248 KB
testcase_03 AC 222 ms
6,820 KB
testcase_04 AC 227 ms
5,248 KB
testcase_05 AC 219 ms
5,248 KB
testcase_06 AC 223 ms
5,248 KB
testcase_07 AC 174 ms
5,248 KB
testcase_08 AC 270 ms
6,880 KB
testcase_09 AC 268 ms
7,296 KB
testcase_10 AC 262 ms
7,296 KB
testcase_11 AC 362 ms
7,124 KB
testcase_12 AC 228 ms
6,784 KB
testcase_13 AC 459 ms
7,296 KB
testcase_14 AC 286 ms
7,808 KB
testcase_15 AC 234 ms
6,016 KB
testcase_16 AC 347 ms
5,564 KB
testcase_17 AC 294 ms
7,424 KB
testcase_18 AC 532 ms
12,928 KB
testcase_19 AC 509 ms
13,080 KB
testcase_20 AC 485 ms
12,672 KB
testcase_21 AC 485 ms
13,056 KB
testcase_22 AC 446 ms
12,544 KB
testcase_23 AC 475 ms
12,928 KB
testcase_24 AC 459 ms
12,928 KB
testcase_25 AC 472 ms
12,928 KB
testcase_26 AC 473 ms
12,800 KB
testcase_27 AC 511 ms
12,800 KB
testcase_28 AC 524 ms
12,800 KB
testcase_29 AC 505 ms
12,800 KB
testcase_30 AC 519 ms
13,556 KB
testcase_31 AC 480 ms
12,928 KB
testcase_32 AC 487 ms
12,928 KB
testcase_33 AC 439 ms
12,800 KB
testcase_34 AC 475 ms
12,928 KB
testcase_35 AC 493 ms
13,224 KB
testcase_36 AC 506 ms
12,672 KB
testcase_37 AC 464 ms
12,800 KB
testcase_38 AC 317 ms
5,248 KB
testcase_39 AC 429 ms
5,248 KB
testcase_40 AC 330 ms
5,248 KB
testcase_41 AC 368 ms
5,248 KB
testcase_42 AC 525 ms
13,368 KB
testcase_43 AC 527 ms
13,364 KB
testcase_44 AC 436 ms
12,800 KB
testcase_45 AC 435 ms
12,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef MY_DEBUG
#define dbg(...) debug_out(__VA_ARGS__)
#define dbgn(var) debug_out(#var, "=", var)
#else
#define dbg(...)
#define dbgn(...)
#endif
void debug_out();
template <class Head, class... Tail> void debug_out(Head, Tail...);
template <class T> bool chmax(T&, const T&);
template <class T> bool chmin(T&, const T&);
template <class T> T pwr(T, ll);
template <class T> T squ(T x) { return x * x; }
ll fact(ll);
ll comb(ll, ll);
ll ctoll(char);
char lltoc(ll);
bool flg(ll b, ll i) { return ((b) >> (i)) & 1LL; }  // flg(0b010, 1LL) -> true
const ll LINF = (ll)1e18 + 7;
const double EPS = 1e-9;
const int MAX_DUBUG_SIZE = 10;

void solve([[maybe_unused]] int test) {
    ll n, m;
    cin >> n >> m;
    vector<ll> ans;
    // vector<ll> a(n);
    set<ll> a;
    for (ll i = 0; i < n; i++) {
        ll tmp;
        cin >> tmp;
        a.insert(tmp);
    }
    // vector<ll> b(m);
    set<ll> b;
    for (ll i = 0; i < m; i++) {
        ll tmp;
        cin >> tmp;
        b.insert(tmp);
        if (a.count(tmp)) {
            ans.push_back(tmp);
        }
    }

    for (auto&& x : ans) {
        a.erase(x);
        b.erase(x);
    }

    if (ans.size() == 0 and a.size() > 0 and b.size() > 0) {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;

    bool red = false;
    for (auto&& x : a) {
        cout << "Red " << x << endl;
        red = true;
    }
    if (ans.size() > 0) {
        ll back = ans.back();
        ans.pop_back();
        cout << "Red " << back << endl;
        cout << "Blue " << back << endl;
        red = false;
    }
    for (auto&& x : b) {
        cout << "Blue " << x << endl;
        red = false;
    }

    while (ans.size() > 0) {
        ll tmp = ans.back();
        ans.pop_back();

        if (red) {
            cout << "Red " << tmp << endl;
            cout << "Blue " << tmp << endl;
            red = false;
        }
        else {
            cout << "Blue " << tmp << endl;
            cout << "Red " << tmp << endl;
            red = true;
        }
    }
}

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12);

    int testcase_size = 1;
    cin >> testcase_size;

    for (int _t = 0; _t < testcase_size; _t++) {
        solve(_t);
    }
}

/*



























-----------------------------------MY_FUNCTIONS------------------------------------ */
template <class First, class Second> ostream& operator<<(ostream& os, const pair<First, Second>& pp) {
    return os << "{" << pp.first << "," << pp.second << "}";
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& V) {
    if (V.empty()) return os << "[]";
    os << "[";
    for (ll i = 0; i < (ll)V.size(); i++) {
        os << V[i] << (i == int(V.size() - 1) ? "]" : ",");
    }
    return os;
}

template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& VV) {
    if (VV.empty()) return os << "[[]]";
    os << "[\n";
    for (auto&& V : VV) {
        os << V << "\n";
    }
    os << "]";
    return os;
}

template <class T> ostream& operator<<(ostream& os, const vector<vector<vector<T>>>& VVV) {
    if (VVV.empty()) return os << "[[[]]]";
    os << "["
       << "\n";
    int cnt = 0;
    for (auto&& VV : VVV) {
        os << cnt++ << VV << "\n\n";
    }
    os << "]";
    return os;
}

template <class T> ostream& operator<<(ostream& os, const set<T>& SS) {
    if (SS.empty()) return os << "[]";
    os << "[";
    auto ii = SS.begin();
    for (; ii != SS.end(); ii++) os << *ii << (ii == prev(SS.end()) ? "]" : ",");
    return os;
}

template <class Key, class Tp> ostream& operator<<(ostream& os, const map<Key, Tp>& MM) {
    if (MM.empty()) return os << "[{:}]";
    os << "[";
    auto ii = MM.begin();
    for (; ii != MM.end(); ii++)
        os << "{" << ii->first << ":" << ii->second << "}" << (ii == prev(MM.end()) ? "]" : ",");
    return os;
}

void debug_out() { cerr << endl; }

void debug_out_vl(vector<ll> V) {
    const int MAX_SIZE = min((int)V.size(), MAX_DUBUG_SIZE);

    cerr << "\033[33m";
    if (V.empty()) {
        cerr << "[]" << endl;
        return;
    }
    cerr << "[";
    for (int i = 0; i < MAX_SIZE; i++) {
        if (V[i] == LINF)
            cerr << "INF";
        else
            cerr << V[i];

        if (i == (int)V.size() - 1)
            cerr << "]\n";
        else if (i == MAX_DUBUG_SIZE - 1)
            cerr << ",...\n";
        else
            cerr << ",";
    }
    return;
}

void debug_out_vvl(vector<vector<ll>> VV) {
    cerr << "\033[33m";
    if (VV.empty()) {
        cerr << "[[]]" << endl;
        return;
    }
    cerr << "[\n";

    int MAX_ROW = min((int)VV.size(), MAX_DUBUG_SIZE);
    for (int i = 0; i < MAX_ROW; i++) {
        const int MAX_COLUMN = min((int)VV[i].size(), MAX_DUBUG_SIZE);
        if (VV[i].empty()) {
            cerr << "[]" << endl;
            continue;
        }
        cerr << "[";
        for (int j = 0; j < MAX_COLUMN; j++) {
            if (VV[i][j] == LINF)
                cerr << "INF";
            else
                cerr << VV[i][j];

            if (j == (int)VV[i].size() - 1)
                cerr << "]\n";
            else if (j == MAX_DUBUG_SIZE - 1)
                cerr << ",...\n";
            else
                cerr << ",";
        }

        if (i != (int)VV.size() - 1 and i == MAX_DUBUG_SIZE - 1) {
            cerr << ":\n:\033[m\n";
            return;
        }
    }

    cerr << "]\033[m\n";
    return;
}

template <class Head, class... Tail> void debug_out(Head H, Tail... T) {
    if constexpr (std::is_same_v<Head, vector<ll>>) {
        debug_out_vl(H);
    }
    else if constexpr (std::is_same_v<Head, vector<vector<ll>>>) {
        debug_out_vvl(H);
    }
    else {
        cerr << "\033[33m" << H << "\033[m ";
    }

    debug_out(T...);
}

template <class T> bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T pwr(T x, ll n) {
    T res = 1;
    for (int i = 0; i < n; i++) {
        res *= x;
    }
    return res;
}

ll fact(ll n) {
    ll res = 1;
    for (ll i = 1; i <= n; i++) res *= i;
    return res;
}

ll comb(ll n, ll r) {  // comb(60, 30)までオーバーフローなし
    ll res = 1;
    for (int i = 1; i <= r; i++) {
        res *= n--;
        res /= i;
    }
    return res;
}

ll ctoll(char c) {
    if (c < '0' or '9' < c) {
        cerr << "\n\033[33m ctoll に '0'~'9' 以外の文字が入りました．\033[m\n" << endl;
    }
    return ll(c - '0');
}

char lltoc(ll n) {
    if (n < 0 or 9 < n) {
        cerr << "\n\033[33m lltoc に 0 ~ 9 以外の数字が入りました．\033[m\n" << endl;
    }
    return char(n + '0');
}
0