結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー |
|
提出日時 | 2023-05-19 21:39:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 420 ms / 2,000 ms |
コード長 | 4,005 bytes |
コンパイル時間 | 2,389 ms |
コンパイル使用メモリ | 211,228 KB |
最終ジャッジ日時 | 2025-02-13 01:34:12 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define SZ(x) (int) (x).size()#define REP(i, n) for(int i = 0; i < (n); i++)#define FOR(i, a, b) for(auto i = (a); i < (b); i++)#define For(i, a, b, c) \for(auto i = (a); i != (b); i += (c))#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)#define ALL(s) (s).begin(), (s).end()#define so(V) sort(ALL(V))#define rev(V) reverse(ALL(V))#define uni(v) v.erase(unique(ALL(v)), (v).end())#define eb emplace_backtypedef unsigned long long ull;typedef long long ll;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<bool> vb;typedef vector<vi> vvi;typedef vector<vll> vvll;typedef pair<int, int> PI;typedef pair<ll, ll> PL;const double EPS = 1e-6;const int MOD = 1e9 + 7;const int INF = (1 << 30);const ll LINF = 1e18;const double math_PI = acos(-1);template<typename T>vector<T> make_v(size_t a) {return vector<T>(a);}template<typename T, typename... Ts>auto make_v(size_t a, Ts... ts) {return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));}template<typename T, typename V>typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {t = v;}template<typename T, typename V>typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {for(auto& e: t) fill_v(e, v);}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(a > b) {a = b;return true;}return false;}template<typename S, typename T>istream& operator>>(istream& is, pair<S, T>& p) {cin >> p.first >> p.second;return is;}template<typename T>istream& operator>>(istream& is, vector<T>& vec) {for(T& x: vec) is >> x;return is;}template<typename T>string join(vector<T>& vec, string splitter) {stringstream ss;REP(i, SZ(vec)) {if(i != 0) ss << splitter;ss << vec[i];}return ss.str();}template<typename T>ostream& operator<<(ostream& os, vector<T>& vec) {os << join(vec, " ");return os;}void solve() {int N, M;cin >> N >> M;vi A(N), B(M);cin >> A >> B;set<int> SA;for(auto a: A) SA.insert(a);queue<int> onlyA, onlyB, same;for(auto b: B) {if(SA.find(b) != SA.end()) {same.push(b);SA.erase(b);} else {onlyB.push(b);}}for(auto a: SA) {onlyA.push(a);}if(onlyA.empty()) {cout << "Yes" << endl;while(!onlyB.empty()) {cout << "Blue " << onlyB.front() << endl;onlyB.pop();}bool nextA = false;while(!same.empty()) {if(nextA) {cout << "Red " << same.front() << endl;cout << "Blue " << same.front() << endl;} else {cout << "Blue " << same.front() << endl;cout << "Red " << same.front() << endl;}same.pop();nextA = !nextA;}return;}if(onlyB.empty()) {cout << "Yes" << endl;while(!onlyA.empty()) {cout << "Red " << onlyA.front() << endl;onlyA.pop();}bool nextA = true;while(!same.empty()) {if(nextA) {cout << "Red " << same.front() << endl;cout << "Blue " << same.front() << endl;} else {cout << "Blue " << same.front() << endl;cout << "Red " << same.front() << endl;}same.pop();nextA = !nextA;}return;}if(same.empty()) {cout << "No" << endl;return;}cout << "Yes" << endl;while(!onlyA.empty()) {cout << "Red " << onlyA.front() << endl;onlyA.pop();}cout << "Red " << same.front() << endl;cout << "Blue " << same.front() << endl;same.pop();while(!onlyB.empty()) {cout << "Blue " << onlyB.front() << endl;onlyB.pop();}bool nextA = false;while(!same.empty()) {if(nextA) {cout << "Red " << same.front() << endl;cout << "Blue " << same.front() << endl;} else {cout << "Blue " << same.front() << endl;cout << "Red " << same.front() << endl;}same.pop();nextA = !nextA;}}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int T;cin >> T;while(T--) {solve();}return 0;}