結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー |
![]() |
提出日時 | 2023-05-19 23:08:34 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,649 bytes |
コンパイル時間 | 4,499 ms |
コンパイル使用メモリ | 261,336 KB |
実行使用メモリ | 14,872 KB |
最終ジャッジ日時 | 2024-12-21 03:52:42 |
合計ジャッジ時間 | 31,087 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 WA * 6 |
ソースコード
// #pragma GCC target("avx")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;#define rep(i,n) for(int i = 0; i < (int)n; i++)#define FOR(n) for(int i = 0; i < (int)n; i++)#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)#define all(x) x.begin(),x.end()//#define mp make_pair#define vi vector<int>#define vvi vector<vi>#define vvvi vector<vvi>#define vvvvi vector<vvvi>#define pii pair<int,int>#define vpii vector<pair<int,int>>template<typename T>void chmax(T &a, const T &b) {a = (a > b? a : b);}template<typename T>void chmin(T &a, const T &b) {a = (a < b? a : b);}using ll = long long;using ld = long double;using ull = unsigned long long;const ll INF = numeric_limits<long long>::max() / 2;const ld pi = 3.1415926535897932384626433832795028;const ll mod = 998244353;int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};#define int long longvoid red(int a) {cout << "Red " << a << "\n";}void blue(int b) {cout << "Blue " << b << "\n";}void solve() {int n, m;cin >> n >> m;vi a(n), b(m);FOR(n) cin >> a[i];FOR(m) cin >> b[i];sort(all(a));sort(all(b));if(n == 0) {cout << "Yes" << endl;for(auto e : b) blue(e);return;}else if(m == 0) {cout << "Yes" << endl;for(auto e : a) red(e);return;}unordered_map<int, bool> in_a;for(auto e : a) in_a[e] = true;unordered_map<int, bool> same;for(auto e : b) if(in_a[e]) same[e] = true;const int sz = (int)same.size();if((int)sz == 0) {cout << "No" << endl;return;}cout << "Yes" << endl;if(n > sz) {bool flag = false;int cur = sz%2;for(auto e : same) {if(cur == 0) {red(e.first);blue(e.first);if(!flag) {FOR(m) if(same.find(b[i]) == same.end()) blue(b[i]);flag = true;}}else {if(!flag) {FOR(m) if(same.find(b[i]) == same.end()) blue(b[i]);flag = true;}blue(e.first);red(e.first);}cur ^= 1;}FOR(n) if(same.find(a[i]) == same.end()) red(a[i]);}else {bool flag = false;int cur = (1^(sz%2));for(auto e : same) {if(cur == 0) {if(!flag) {FOR(n) if(same.find(a[i]) == same.end()) blue(a[i]);flag = true;}red(e.first);blue(e.first);}else {blue(e.first);red(e.first);if(!flag) {FOR(n) if(same.find(a[i]) == same.end()) blue(a[i]);flag = true;}return;}cur ^= 1;}FOR(m) if(same.find(b[i]) == same.end()) blue(b[i]);}// vi val_a = a, val_b = b;// sort(all(val_a));// sort(all(val_b));// val_a.erase(unique(all(val_a)), val_a.end());// val_b.erase(unique(all(val_b)), val_b.end());// for(auto& e : a) e = (int)(lower_bound(all(val_a), e) - val_a.begin());// for(auto& e : b) e = (int)(lower_bound(all(val_b), e) - val_b.begin());// vector<bool> in_a(n+1, false);}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);int t;cin >> t;while(t--) solve();return 0;}