結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー kwm_t
提出日時 2023-05-20 10:39:23
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 210 ms / 2,000 ms
コード長 1,962 bytes
コンパイル時間 2,400 ms
コンパイル使用メモリ 208,148 KB
最終ジャッジ日時 2025-02-13 03:40:01
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t; cin >> t;
while (t--) {
int n, m; cin >> n >> m;
vector<int>a(n), b(m);
rep(i, n)cin >> a[i];
rep(i, m)cin >> b[i];
vector<int>na, nb, x;
{
multiset<int>mst;
rep(i, a.size())mst.insert(a[i]);
rep(i, b.size()) {
if (mst.end() == mst.find(b[i])) {
nb.push_back(b[i]);
continue;
}
x.push_back(b[i]);
mst.erase(mst.find(b[i]));
}
for (auto e : mst)na.push_back(e);
}
if (!x.size() && (n && m)) {
cout << "No" << endl;
continue;
}
cout << "Yes" << endl;
vector<pair<string, int>>ans;
rep(i, na.size()) ans.push_back({ "Red",na[i] });
if (x.size()) {
ans.push_back({ "Red",x[0] });
ans.push_back({ "Blue",x[0] });
}
rep(i, nb.size()) ans.push_back({ "Blue",nb[i] });
rep2(i, 1, x.size()) {
if (0 == i % 2) {
ans.push_back({ "Red",x[i] });
ans.push_back({ "Blue",x[i] });
}
else {
ans.push_back({ "Blue",x[i] });
ans.push_back({ "Red",x[i] });
}
}
rep(i, ans.size()) {
cout << ans[i].first << " " << ans[i].second << endl;
}
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0