結果
問題 |
No.2307 [Cherry 5 th Tune *] Cool 46
|
ユーザー |
![]() |
提出日時 | 2023-05-19 22:24:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 371 ms / 2,000 ms |
コード長 | 2,713 bytes |
コンパイル時間 | 4,377 ms |
コンパイル使用メモリ | 263,372 KB |
最終ジャッジ日時 | 2025-02-13 02:16:02 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace atcoder; //using mint = modint1000000007; using mint = modint998244353; //g++ -I/opt/ac-library ./**.cpp using namespace std; using ll = long long; using ull = unsigned long long; //const long long MOD = 1000000007; const long long MOD = 998244353; const long double PI = 3.14159265358979; const long long INF = 1LL<<60; template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;} template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;} #define deb(var) do{cout << #var << " : "; view(var);}while(0) template<typename T> void view(T e){cout << e << endl;} void view(vector<string>& v){cout << endl;for(auto& s :v){view(s);}cout << endl;} template<typename T> void view(vector<T>& v){for(auto& e :v){cout << e << " ";}cout << endl;} template<typename T> void view(vector<vector<T>>& vv){cout << endl;for(auto& v:vv){view(v);}} ll gcd(ll a, ll b){if (b == 0) return a;else return gcd(b, a % b);} ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;} template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>; #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define int long long void solve() { int n, m; cin >> n >> m; vector<int> a(n), b(m); set<int> st1, st2; for (int i=0; i<n; i++) { cin >> a[i]; st1.insert(a[i]); } for (int i=0; i<m; i++) { cin >> b[i]; st2.insert(b[i]); } int s = -1; { bool same = false; for (auto x: a) { if (st2.count(x)) { same = true; s = x; } } if (n > 0 && m > 0 && !same) { cout << "No" << "\n"; return; } } vector<pair<string, int>> ans; if (m == 0) { for (auto x: a) ans.push_back({"Red", x}); } else if (n == 0) { for (auto x: b) ans.push_back({"Blue", x}); } else { for (auto x: a) { if (!st2.count(x)) ans.push_back({"Red", x}); } ans.push_back({"Red", s}); ans.push_back({"Blue", s}); for (auto x: b) { if (!st1.count(x)) ans.push_back({"Blue", x}); } string nx = "Blue"; for (auto x: a) { if (s != x && st2.count(x)) { ans.push_back({nx, x}); if (nx == "Red") nx = "Blue"; else nx = "Red"; ans.push_back({nx, x}); } } } cout << "Yes" << "\n"; for (auto x: ans) cout << x.first << " " << x.second << "\n"; } int32_t main() { int t; cin >> t; while (t--) solve(); }