結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー siganaisiganai
提出日時 2023-05-19 21:33:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 232 ms / 2,000 ms
コード長 5,341 bytes
コンパイル時間 2,625 ms
コンパイル使用メモリ 217,684 KB
実行使用メモリ 13,568 KB
最終ジャッジ日時 2024-05-10 08:05:39
合計ジャッジ時間 29,737 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 65 ms
5,376 KB
testcase_03 AC 84 ms
5,376 KB
testcase_04 AC 82 ms
5,376 KB
testcase_05 AC 86 ms
5,376 KB
testcase_06 AC 80 ms
5,376 KB
testcase_07 AC 82 ms
5,376 KB
testcase_08 AC 119 ms
6,784 KB
testcase_09 AC 111 ms
7,424 KB
testcase_10 AC 104 ms
7,552 KB
testcase_11 AC 125 ms
7,152 KB
testcase_12 AC 105 ms
7,084 KB
testcase_13 AC 125 ms
7,616 KB
testcase_14 AC 111 ms
7,936 KB
testcase_15 AC 95 ms
6,008 KB
testcase_16 AC 111 ms
5,760 KB
testcase_17 AC 119 ms
7,424 KB
testcase_18 AC 145 ms
13,440 KB
testcase_19 AC 195 ms
13,440 KB
testcase_20 AC 204 ms
13,440 KB
testcase_21 AC 227 ms
13,440 KB
testcase_22 AC 191 ms
13,440 KB
testcase_23 AC 227 ms
13,440 KB
testcase_24 AC 217 ms
13,440 KB
testcase_25 AC 219 ms
13,312 KB
testcase_26 AC 202 ms
13,440 KB
testcase_27 AC 213 ms
13,568 KB
testcase_28 AC 213 ms
13,440 KB
testcase_29 AC 201 ms
13,312 KB
testcase_30 AC 231 ms
13,440 KB
testcase_31 AC 209 ms
13,440 KB
testcase_32 AC 212 ms
13,440 KB
testcase_33 AC 186 ms
13,440 KB
testcase_34 AC 229 ms
13,440 KB
testcase_35 AC 231 ms
13,440 KB
testcase_36 AC 220 ms
13,312 KB
testcase_37 AC 214 ms
13,440 KB
testcase_38 AC 47 ms
5,376 KB
testcase_39 AC 71 ms
5,376 KB
testcase_40 AC 79 ms
5,376 KB
testcase_41 AC 94 ms
5,376 KB
testcase_42 AC 232 ms
13,440 KB
testcase_43 AC 219 ms
13,440 KB
testcase_44 AC 158 ms
13,440 KB
testcase_45 AC 157 ms
13,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>

#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;
void solve() {
    INT(n,m);
    VEC(int,a,n);
    VEC(int,b,m);
    map<int,int> mp;
    rep(i,n) mp[a[i]]++;
    rep(i,m) mp[b[i]]++;
    if(n == 0 || m == 0) {
        cout << "Yes\n";
        rep(i,n) {
            cout << "Red " << a[i] << '\n';
        }
        rep(i,m) {
            cout << "Blue " << b[i] << '\n';
        }
        return;
    }
    int flg = 0;
    set<int> s;
    for(auto &[X,c]:mp) {
        if(c == 2) {
            flg = 1;
            s.insert(X);
        }
    }
    if(!flg) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    rep(i,n) {
        if(s.find(a[i]) == s.end()) {
            cout << "Red " << a[i] << '\n';
        }
    }
    cout << "Red " << *s.begin() << '\n';
    cout << "Blue " << *s.begin() << '\n';
    rep(i,m) {
        if(s.find(b[i]) == s.end()) {
            cout << "Blue " << b[i] << '\n';
        }
    }
    s.erase(*s.begin());
    int now = 1;
    for(auto &x:s) {
        if(now == 1) {
            cout << "Blue " << x << '\n';
            cout << "Red " << x << '\n';
        }
        else {
            cout << "Red " << x << '\n';
            cout << "Blue " << x << '\n';
        }
        now ^= 1;
    }
}

int main() {
    INT(TT);
    while(TT--) solve();

}
0