結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー dyktr_06dyktr_06
提出日時 2023-05-19 21:53:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 281 ms / 2,000 ms
コード長 5,543 bytes
コンパイル時間 6,034 ms
コンパイル使用メモリ 276,908 KB
実行使用メモリ 32,944 KB
最終ジャッジ日時 2024-12-21 02:29:07
合計ジャッジ時間 35,684 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 103 ms
5,248 KB
testcase_03 AC 107 ms
6,820 KB
testcase_04 AC 106 ms
6,820 KB
testcase_05 AC 112 ms
6,824 KB
testcase_06 AC 104 ms
5,248 KB
testcase_07 AC 101 ms
5,248 KB
testcase_08 AC 141 ms
12,384 KB
testcase_09 AC 150 ms
13,664 KB
testcase_10 AC 155 ms
14,420 KB
testcase_11 AC 171 ms
14,032 KB
testcase_12 AC 160 ms
15,960 KB
testcase_13 AC 179 ms
15,400 KB
testcase_14 AC 151 ms
16,148 KB
testcase_15 AC 140 ms
12,072 KB
testcase_16 AC 135 ms
10,952 KB
testcase_17 AC 155 ms
13,592 KB
testcase_18 AC 248 ms
30,040 KB
testcase_19 AC 200 ms
28,888 KB
testcase_20 AC 194 ms
31,756 KB
testcase_21 AC 192 ms
31,908 KB
testcase_22 AC 216 ms
28,884 KB
testcase_23 AC 193 ms
31,784 KB
testcase_24 AC 205 ms
28,424 KB
testcase_25 AC 212 ms
27,628 KB
testcase_26 AC 191 ms
31,996 KB
testcase_27 AC 260 ms
29,524 KB
testcase_28 AC 208 ms
31,368 KB
testcase_29 AC 230 ms
32,520 KB
testcase_30 AC 217 ms
32,408 KB
testcase_31 AC 223 ms
31,764 KB
testcase_32 AC 198 ms
31,712 KB
testcase_33 AC 281 ms
30,168 KB
testcase_34 AC 240 ms
31,576 KB
testcase_35 AC 220 ms
29,908 KB
testcase_36 AC 211 ms
32,944 KB
testcase_37 AC 222 ms
30,292 KB
testcase_38 AC 47 ms
5,248 KB
testcase_39 AC 79 ms
5,248 KB
testcase_40 AC 45 ms
5,248 KB
testcase_41 AC 107 ms
5,248 KB
testcase_42 AC 255 ms
28,888 KB
testcase_43 AC 212 ms
29,016 KB
testcase_44 AC 47 ms
6,400 KB
testcase_45 AC 48 ms
6,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll t;

void input(){
    in(t);
}

void solve(){
    ll n, m; in(n, m);
    vll a, b; vin(a, n); vin(b, m);
    if(n == 0){
        out("Yes");
        rep(i, m){
            out("Blue", b[i]);
        }
        return;
    }else if(m == 0){
        out("Yes");
        rep(i, n){
            out("Red", a[i]);
        }
        return;
    }

    map<ll, ll> cnt1, cnt2;
    rep(i, n) cnt1[a[i]]++;
    rep(i, m) cnt2[b[i]]++;
    ll cnt = 0;
    vector<pair<string, ll>> ans, ansR, ansB;
    for(auto [k, x] : cnt1){
        if(cnt2.count(k) != 0){
            cnt++;
            if(cnt % 2){
                ans.emplace_back("Red", k);
                ans.emplace_back("Blue", k);
            }else{
                ans.emplace_back("Blue", k);
                ans.emplace_back("Red", k);
            }
        }else{
            ansR.emplace_back("Red", k);
        }
    }
    for(auto [k, x] : cnt2){
        if(cnt1.count(k) != 0){
        }else{
            ansB.emplace_back("Blue", k);
        }
    }
    if(cnt == 0){
        out("No");
    }else{
        out("Yes");
        for(auto [x, y] : ansR){
            out(x, y);
        }
        ll siz = ans.size();
        out(ans[0].first, ans[0].second);
        out(ans[1].first, ans[1].second);
        for(auto [x, y] : ansB){
            out(x, y);
        }
        rep(i, 2, siz){
            out(ans[i].first, ans[i].second);
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    while(t--) solve();
}
0