結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー mikammikam
提出日時 2023-05-20 14:47:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 219 ms / 2,000 ms
コード長 4,754 bytes
コンパイル時間 3,400 ms
コンパイル使用メモリ 247,272 KB
実行使用メモリ 20,048 KB
最終ジャッジ日時 2023-08-23 09:37:05
合計ジャッジ時間 31,522 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 68 ms
4,376 KB
testcase_03 AC 83 ms
4,380 KB
testcase_04 AC 82 ms
4,376 KB
testcase_05 AC 82 ms
4,376 KB
testcase_06 AC 83 ms
4,380 KB
testcase_07 AC 79 ms
4,376 KB
testcase_08 AC 110 ms
8,688 KB
testcase_09 AC 111 ms
9,856 KB
testcase_10 AC 127 ms
9,976 KB
testcase_11 AC 119 ms
8,280 KB
testcase_12 AC 121 ms
9,300 KB
testcase_13 AC 155 ms
9,952 KB
testcase_14 AC 120 ms
10,612 KB
testcase_15 AC 108 ms
7,796 KB
testcase_16 AC 107 ms
7,128 KB
testcase_17 AC 115 ms
8,752 KB
testcase_18 AC 193 ms
19,312 KB
testcase_19 AC 152 ms
13,368 KB
testcase_20 AC 203 ms
19,512 KB
testcase_21 AC 189 ms
18,476 KB
testcase_22 AC 193 ms
20,032 KB
testcase_23 AC 190 ms
18,852 KB
testcase_24 AC 175 ms
16,784 KB
testcase_25 AC 176 ms
17,860 KB
testcase_26 AC 198 ms
19,508 KB
testcase_27 AC 189 ms
19,468 KB
testcase_28 AC 180 ms
18,860 KB
testcase_29 AC 182 ms
20,048 KB
testcase_30 AC 156 ms
14,568 KB
testcase_31 AC 185 ms
19,480 KB
testcase_32 AC 186 ms
19,492 KB
testcase_33 AC 219 ms
19,476 KB
testcase_34 AC 176 ms
18,108 KB
testcase_35 AC 155 ms
14,512 KB
testcase_36 AC 179 ms
17,848 KB
testcase_37 AC 197 ms
18,320 KB
testcase_38 AC 53 ms
4,376 KB
testcase_39 AC 76 ms
4,376 KB
testcase_40 AC 81 ms
4,380 KB
testcase_41 AC 69 ms
4,376 KB
testcase_42 AC 142 ms
11,964 KB
testcase_43 AC 139 ms
12,108 KB
testcase_44 AC 184 ms
19,224 KB
testcase_45 AC 209 ms
19,256 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #include "atcoder/convolution"
#include "atcoder/dsu"
#include "atcoder/fenwicktree"
#include "atcoder/lazysegtree"
#include "atcoder/math"
#include "atcoder/maxflow"
#include "atcoder/mincostflow"
#include "atcoder/modint"
#include "atcoder/scc"
#include "atcoder/segtree"
#include "atcoder/string"
#include "atcoder/twosat"
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> void print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> void print(T& a){cout << a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
void YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(t);
    while(t--){
        INT(n,m);
        vi A(n),B(m);
        cin>>A>>B;
        map<int,int> mp;
        rep(i,n)mp[A[i]]++;
        rep(i,m)mp[B[i]]+=2;
        vi r,b,p;
        for(auto [k,v]:mp){
            if(v==1)r.push_back(k);
            if(v==2)b.push_back(k);
            if(v==3)p.push_back(k);
        }
        if(p.size()==0){
            if(r.size()>0 && b.size()>0){
                print("No");
                continue;
            }
        }
        print("Yes");
        for(auto v:r)print("Red",v);
        rep(i,p.size()){
            if(i%2==0)print("Red",p[i]);
            print("Blue",p[i]);
            if(i%2==1)print("Red",p[i]);
            if(i==0)for(auto v:b)print("Blue",v);
        }
        if(p.size()==0)for(auto v:b)print("Blue",v);
    }

    return 0;
}
0