結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー | bit_kyopro |
提出日時 | 2023-05-19 22:24:37 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 402 ms / 2,000 ms |
コード長 | 2,713 bytes |
コンパイル時間 | 4,699 ms |
コンパイル使用メモリ | 273,204 KB |
実行使用メモリ | 26,320 KB |
最終ジャッジ日時 | 2023-08-23 03:38:19 |
合計ジャッジ時間 | 38,770 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 136 ms
4,380 KB |
testcase_03 | AC | 157 ms
4,716 KB |
testcase_04 | AC | 152 ms
4,608 KB |
testcase_05 | AC | 152 ms
4,724 KB |
testcase_06 | AC | 153 ms
4,800 KB |
testcase_07 | AC | 143 ms
4,648 KB |
testcase_08 | AC | 214 ms
13,492 KB |
testcase_09 | AC | 196 ms
9,868 KB |
testcase_10 | AC | 211 ms
12,956 KB |
testcase_11 | AC | 238 ms
15,564 KB |
testcase_12 | AC | 180 ms
13,148 KB |
testcase_13 | AC | 257 ms
16,304 KB |
testcase_14 | AC | 189 ms
13,472 KB |
testcase_15 | AC | 170 ms
8,840 KB |
testcase_16 | AC | 209 ms
10,432 KB |
testcase_17 | AC | 212 ms
13,724 KB |
testcase_18 | AC | 362 ms
25,292 KB |
testcase_19 | AC | 396 ms
24,760 KB |
testcase_20 | AC | 322 ms
24,824 KB |
testcase_21 | AC | 321 ms
25,128 KB |
testcase_22 | AC | 381 ms
24,584 KB |
testcase_23 | AC | 325 ms
24,752 KB |
testcase_24 | AC | 385 ms
24,528 KB |
testcase_25 | AC | 340 ms
24,808 KB |
testcase_26 | AC | 297 ms
24,672 KB |
testcase_27 | AC | 336 ms
24,444 KB |
testcase_28 | AC | 308 ms
25,436 KB |
testcase_29 | AC | 313 ms
25,356 KB |
testcase_30 | AC | 343 ms
24,608 KB |
testcase_31 | AC | 309 ms
24,856 KB |
testcase_32 | AC | 316 ms
24,380 KB |
testcase_33 | AC | 358 ms
25,364 KB |
testcase_34 | AC | 349 ms
24,452 KB |
testcase_35 | AC | 402 ms
25,016 KB |
testcase_36 | AC | 322 ms
24,420 KB |
testcase_37 | AC | 361 ms
25,472 KB |
testcase_38 | AC | 246 ms
4,380 KB |
testcase_39 | AC | 307 ms
4,376 KB |
testcase_40 | AC | 146 ms
4,380 KB |
testcase_41 | AC | 176 ms
4,380 KB |
testcase_42 | AC | 386 ms
24,888 KB |
testcase_43 | AC | 381 ms
24,660 KB |
testcase_44 | AC | 236 ms
24,444 KB |
testcase_45 | AC | 231 ms
26,320 KB |
ソースコード
#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(); }