結果

問題 No.2307 [Cherry 5 th Tune *] Cool 46
ユーザー AnchorBluesAnchorBlues
提出日時 2023-09-29 14:58:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 542 ms / 2,000 ms
コード長 2,735 bytes
コンパイル時間 2,053 ms
コンパイル使用メモリ 205,060 KB
最終ジャッジ日時 2025-02-17 02:57:04
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
const ll INF = 1LL << 60;
template <class T>
void chmax(T& a, T b) {
if (b > a) a = b;
}
template <class T>
void chmin(T& a, T b) {
if (b < a) a = b;
}
template <typename T, typename S>
std::ostream& operator<<(std::ostream& os, const pair<T, S>& x) noexcept {
return os << "(" << x.first << ", " << x.second << ")";
}
template <typename T>
void print_vector(vector<T> a) {
cout << '[';
for (int i = 0; i < a.size(); i++) {
cout << a[i];
if (i != a.size() - 1) {
cout << ", ";
}
}
cout << ']' << endl;
}
void solve() {
ll N, M;
cin >> N >> M;
set<ll> A, B, AB;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.insert(a);
}
for (int j = 0; j < M; j++) {
ll b;
cin >> b;
B.insert(b);
}
for (auto& v : A) {
if (B.count(v)) AB.insert(v);
}
// std::cout << N << ' ' << M << "\n";
// std::cout << A.size() << ' ' << B.size() << endl;
// std::cout << AB.size() << "\n";
if (AB.size() == 0 && A.size() > 0 && B.size() > 0) {
std::cout << "No"
<< "\n";
return;
}
set<ll> to_be_removed_A, to_be_removed_B;
for (auto& v : A) {
if (AB.count(v)) {
to_be_removed_A.insert(v);
}
}
for (auto& v : B) {
if (AB.count(v)) {
to_be_removed_B.insert(v);
}
}
for (auto& v : to_be_removed_A) {
A.erase(v);
}
for (auto& v : to_be_removed_B) {
B.erase(v);
}
//
std::cout << "Yes"
<< "\n";
for (auto& v : A) {
std::cout << "Red" << ' ' << v << endl;
}
if (AB.size() > 0) {
auto it = AB.begin();
auto u = *it;
std::cout << "Red" << ' ' << u << endl;
std::cout << "Blue" << ' ' << u << endl;
AB.erase(it);
}
for (auto& v : B) {
std::cout << "Blue" << ' ' << v << endl;
}
bool blue = true;
for (auto& v : AB) {
if (blue) {
std::cout << "Blue" << ' ' << v << endl;
std::cout << "Red" << ' ' << v << endl;
} else {
std::cout << "Red" << ' ' << v << endl;
std::cout << "Blue" << ' ' << v << endl;
}
blue = blue ^ true;
}
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0