結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー |
![]() |
提出日時 | 2023-05-19 21:38:27 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,690 bytes |
コンパイル時間 | 1,250 ms |
コンパイル使用メモリ | 122,872 KB |
最終ジャッジ日時 | 2025-02-13 01:33:00 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | WA * 46 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}struct UnionFind {vector<int> data;UnionFind(int size) : data(size, -1) {}bool unionSet(int x, int y) {x = root(x); y = root(y);if (x != y) {if (data[y] < data[x]) swap(x, y);data[x] += data[y]; data[y] = x;}return x != y;}bool findSet(int x, int y) {return root(x) == root(y);}int root(int x) {return data[x] < 0 ? x : data[x] = root(data[x]);}int size(int x) {return -data[root(x)];}};template<typename T>class Compress{public:vector<T> data;int offset;Compress(vector<T> data_, int offset=0): offset(offset){data = data_;sort(begin(data), end(data));data.erase(unique(begin(data), end(data)), end(data));};int operator[](T x) {auto p = lower_bound(data.begin(), data.end(), x);assert(x == *p);return offset+(p-data.begin());}T inv(int x){return data[x-offset];}int size(){return data.size();}};void solve(){int n, m; cin >> n >> m;vector<int> a(n), b(m);for(int i = 0; i < n; i++) cin >> a[i];for(int i = 0; i < m; i++) cin >> b[i];if(n == 0){cout << "Yes" << endl;for(int x: b) cout << "Red " << x << '\n';return;}if(m == 0){cout << "Yes" << endl;for(int x: a) cout << "Blue " << x << '\n';return;}set<int> st_a;for(int x: a) st_a.insert(x);set<int> st_ab;for(int x: b){if(st_a.count(x)) st_ab.insert(x);}if(st_ab.size() == 0){cout << "No" << endl;return;}vector<int> only_a, only_b;for(int x: a){if(st_ab.count(x) == 0) only_a.push_back(x);}for(int x: b){if(st_ab.count(x) == 0) only_b.push_back(x);}bool red = true;cout << "Yes" << endl;for(int x: only_a) cout << "RED " << x << '\n';bool first = true;for(int x: st_ab){if(red){cout << "RED " << x << '\n';cout << "BLUE " << x << '\n';}else{cout << "BLUE " << x << '\n';cout << "RED " << x << '\n';}if(first){for(int x: only_b) cout << "BLUE " << x << '\n';}red = !red;first = false;}}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int t; cin >> t;while(t--) solve();}