結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー | |
提出日時 | 2023-05-19 21:39:21 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,491 bytes |
コンパイル時間 | 3,553 ms |
コンパイル使用メモリ | 254,228 KB |
実行使用メモリ | 13,916 KB |
最終ジャッジ日時 | 2023-08-23 02:40:00 |
合計ジャッジ時間 | 12,230 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | WA | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | WA | - |
testcase_08 | AC | 136 ms
6,864 KB |
testcase_09 | RE | - |
testcase_10 | AC | 124 ms
6,088 KB |
testcase_11 | AC | 142 ms
6,196 KB |
testcase_12 | AC | 132 ms
6,708 KB |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | WA | - |
testcase_17 | RE | - |
testcase_18 | AC | 183 ms
11,720 KB |
testcase_19 | AC | 174 ms
10,408 KB |
testcase_20 | AC | 137 ms
7,952 KB |
testcase_21 | AC | 137 ms
8,344 KB |
testcase_22 | AC | 187 ms
12,040 KB |
testcase_23 | AC | 137 ms
8,052 KB |
testcase_24 | AC | 197 ms
12,296 KB |
testcase_25 | AC | 197 ms
11,856 KB |
testcase_26 | AC | 138 ms
8,080 KB |
testcase_27 | AC | 213 ms
12,420 KB |
testcase_28 | AC | 152 ms
9,128 KB |
testcase_29 | AC | 154 ms
9,548 KB |
testcase_30 | AC | 194 ms
11,620 KB |
testcase_31 | AC | 136 ms
7,968 KB |
testcase_32 | AC | 136 ms
7,828 KB |
testcase_33 | AC | 233 ms
13,672 KB |
testcase_34 | AC | 213 ms
13,376 KB |
testcase_35 | AC | 188 ms
10,840 KB |
testcase_36 | AC | 154 ms
8,836 KB |
testcase_37 | AC | 188 ms
11,620 KB |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | AC | 129 ms
4,380 KB |
testcase_42 | AC | 186 ms
10,476 KB |
testcase_43 | AC | 179 ms
10,452 KB |
testcase_44 | WA | - |
testcase_45 | RE | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using ull = uint64_t; using ll = int64_t; using vi = vector<int>; using vll = vector<ll>; using vs = vector<string>; using ld = long double; using P = pair<ll,ll>; using G = vector<vector<int>>; #define LO(...) (void)0 #define debug(x) (void)0 #define reps(i,a,n) for(ll i##_len = (ll)(n), i = (a); i < i##_len; ++i) #define rep(i,n) reps(i,0,(n)) #define rrep(i,n) reps(i,1,(n)+1) #define repd(i,n) for(ll i=(n)-1;i>=0;i--) #define rrepd(i,n) for(ll i=(n);i>=1;i--) namespace std {template<typename T,typename U> istream &operator>>(istream &is, pair<T,U> &v){return is>>v.first>>v.second;}} template<typename T>void input(T& a){cin>>a;} template<typename T,typename... Ts>void input(T& a,Ts&... b){cin>>a;input(b...);} #define inp(...) ll __VA_ARGS__;input(__VA_ARGS__) #define inps(...) string __VA_ARGS__;input(__VA_ARGS__) #define inpp(p) cin >> (p).first >> (p).second #define inpv(v,N) vll v(N);rep(i,N)cin>>v[i]; #define inpvs(v,N) vs v(N);rep(i,N)cin>>v[i]; #define all(v) begin(v),end(v) #define Yes cout<<"Yes\n" #define No cout<<"No\n" #define allok(i,N,pred) [&]()->bool{bool allok_=1;rep(i,N)if(!(pred))allok_=0;return allok_;}() #define anyok(i,N,pred) [&]()->bool{bool anyok_=0;rep(i,N)if(pred)anyok_=1;return anyok_;}() inline void YESNO(bool b){cout<<(b?"YES\n":"NO\n");}inline void yesno(bool b){cout<<(b?"yes\n":"no\n");}inline void YesNo(bool b){cout<<(b?"Yes\n":"No\n");} #define SP cout<<' ' #define ENDL cout<<'\n' #define setfp cout<<fixed<<setprecision(16) template<typename C>string join(const C &v){ostringstream s;bool f=1;for(auto &&e:v){if(!f)s<<' ';f=0;s<<e;}return s.str();} template<typename C>string joinadd(const C &v){ostringstream s;bool f=1;for(auto &&e:v){if(!f)s<<' ';f=0;s<<e+1;}return s.str();} template<typename C>void prv_(const C &v){cout<<join(v);} template<typename C>void prvadd_(const C &v){cout<<joinadd(v);} template<typename C>void prv(const C &v){prv_(v);ENDL;} template<typename C>void prvadd(const C &v){prvadd_(v);ENDL;} template<typename ...>using rr_void_t=void; template<typename T,typename=void>struct is_container:false_type{}; template<typename T>struct is_container<T,rr_void_t<typename T::iterator>>:true_type{}; template<typename T,typename=enable_if_t<is_container<T>::value && !is_same<string,T>::value>> void pr_(const T& a){prv_(a);} template<typename T,typename=enable_if_t<!is_container<T>::value || is_same<string,T>::value>,typename=void> void pr_(const T& a){cout<<a;} inline void pr(){cout<<'\n';} template<typename T>void pr(const T& a){pr_(a);cout<<'\n';} template<typename T,typename... Ts>void pr(const T& a,const Ts&... b){pr_(a);cout<<' ';pr(b...);} template<typename T>void prs(const T& a){pr_(a);SP;} inline ll max(ll a, ll b){return max<ll>(a, b);} inline ll min(ll a, ll b){return min<ll>(a, b);} template<typename T>bool chmax(T &a,const T &b){return a<b?(a=b,1):0;} template<typename T>bool chmin(T &a,const T &b){return b<a?(a=b,1):0;} template<typename T,typename C=less<>>void so(T &a,C c=C{}){sort(begin(a),end(a),c);} template<typename T,typename C=less<>>void rso(T &a,C c=C{}){sort(rbegin(a),rend(a),c);} template<typename T>void rev(T &a){reverse(begin(a),end(a));} constexpr ll INF = 1e18; int main() { inp(T); while(T--){ inp(N,M); inpv(a,N); inpv(b,M); set<ll> as; rep(i,N)as.insert(a[i]); ll co = 0; vll no; vll aa; rep(i,M){ if(as.count(b[i])){ as.erase(b[i]); aa.push_back(b[i]); co++; }else{ no.push_back(b[i]); } } if(N==0){ Yes; rep(i,M){ prs("Blue"); pr(a[i]); } }else if(M==0){ Yes; rep(i,M){ prs("Blue"); pr(a[i]); } }else if(co){ Yes; for(ll c : as){ prs("Red"); pr(c); } ll t = 0; for(ll c : aa){ prs(t%2 ? "Blue" : "Red"); pr(c); prs(t%2 ? "Red" : "Blue"); pr(c); if(t==0){ for(ll c : no){ prs("Blue"); pr(c); } } t++; } }else{ No; } } }