結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー | 👑 amentorimaru |
提出日時 | 2023-05-19 21:42:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,598 bytes |
コンパイル時間 | 4,377 ms |
コンパイル使用メモリ | 192,416 KB |
実行使用メモリ | 21,336 KB |
最終ジャッジ日時 | 2023-08-23 02:44:51 |
合計ジャッジ時間 | 30,743 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 124 ms
4,376 KB |
testcase_05 | AC | 123 ms
4,380 KB |
testcase_06 | AC | 125 ms
4,384 KB |
testcase_07 | WA | - |
testcase_08 | AC | 136 ms
9,048 KB |
testcase_09 | AC | 134 ms
9,136 KB |
testcase_10 | AC | 137 ms
9,752 KB |
testcase_11 | AC | 143 ms
9,408 KB |
testcase_12 | AC | 132 ms
9,616 KB |
testcase_13 | AC | 159 ms
10,596 KB |
testcase_14 | AC | 138 ms
11,048 KB |
testcase_15 | AC | 128 ms
7,404 KB |
testcase_16 | AC | 141 ms
7,264 KB |
testcase_17 | AC | 134 ms
9,320 KB |
testcase_18 | AC | 170 ms
18,980 KB |
testcase_19 | AC | 161 ms
16,524 KB |
testcase_20 | AC | 184 ms
21,328 KB |
testcase_21 | AC | 170 ms
19,104 KB |
testcase_22 | AC | 166 ms
18,452 KB |
testcase_23 | AC | 170 ms
19,012 KB |
testcase_24 | AC | 167 ms
17,132 KB |
testcase_25 | AC | 172 ms
17,932 KB |
testcase_26 | AC | 175 ms
18,364 KB |
testcase_27 | AC | 176 ms
18,052 KB |
testcase_28 | AC | 176 ms
18,156 KB |
testcase_29 | AC | 179 ms
18,788 KB |
testcase_30 | AC | 165 ms
17,292 KB |
testcase_31 | AC | 183 ms
20,552 KB |
testcase_32 | AC | 183 ms
20,640 KB |
testcase_33 | AC | 173 ms
20,220 KB |
testcase_34 | AC | 176 ms
20,388 KB |
testcase_35 | AC | 164 ms
16,676 KB |
testcase_36 | AC | 172 ms
18,176 KB |
testcase_37 | AC | 173 ms
18,584 KB |
testcase_38 | WA | - |
testcase_39 | AC | 308 ms
4,380 KB |
testcase_40 | WA | - |
testcase_41 | AC | 136 ms
4,380 KB |
testcase_42 | AC | 161 ms
16,392 KB |
testcase_43 | AC | 164 ms
16,052 KB |
testcase_44 | AC | 173 ms
20,636 KB |
testcase_45 | AC | 175 ms
21,336 KB |
ソースコード
#define ATCODER #define _USE_MATH_DEFINES #include<stdio.h> #include<iostream> #include<fstream> #include<algorithm> #include<vector> #include<string> #include <cassert> #include <numeric> #include <unordered_map> #include <unordered_set> #include <queue> #include <math.h> #include <climits> #include <set> #include <map> #include <list> #include <random> #include <iterator> #include <bitset> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; //template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++) #define VV(type) vector< vector<type> > #define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m) #define vec(type) vector<type> #define VEC(type,n,val) vector<type> val;val.resize(n) #define VL vector<ll> #define VVL vector< vector<ll> > #define VP vector< pair<ll,ll> > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<<i) #define BITSET(x,i) x | (ll(1)<<i) #define BITCUT(x,i) x & ~(ll(1)<<i) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define ALLBIT(n) (ll(1)<<n-1) #define TOMAX(n,v) n=n<v?v:n #define TOMIN(n,v) n=n>v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include <atcoder/all> using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template<typename T = ll> vector<T> read(size_t n) { vector<T> ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template<typename TV, const ll N> void read_tuple_impl(TV&) {} template<typename TV, const ll N, typename Head, typename... Tail> void read_tuple_impl(TV& ts) { get<N>(ts).emplace_back(*(istream_iterator<Head>(cin))); read_tuple_impl<TV, N + 1, Tail...>(ts); } template<typename... Ts> decltype(auto) read_tuple(size_t n) { tuple<vector<Ts>...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; int main() { ll t; cin >> t; while (t--) { ll n, m; cin >> n >> m; unordered_set<ll> sa, sb, d; auto a = read(n); auto b = read(m); for (auto& v : a) { sa.insert(v); } for (auto& v : b) { if (sa.find(v) != sa.end()) { d.insert(v); sa.erase(v); } else { sb.insert(v); } } bool stB = false; if (d.size() == n && d.size() == m) { stB = false; } else if (d.size() == n) { stB = n % 2 == 0; } else if (d.size() == m) { stB = n % 2 == 1; } VP ans; while (1) { bool find = false; if (stB) { if (!sb.empty()) { auto it = sb.begin(); ans.emplace_back(*it, 1); sb.erase(it); find = true; } else if (!d.empty()) { auto it = d.begin(); ans.emplace_back(*it, 1); ans.emplace_back(*it, 0); d.erase(it); find = true; stB = false; } } else { if (!sa.empty()) { auto it = sa.begin(); ans.emplace_back(*it, 0); sa.erase(it); find = true; } else if (!d.empty()) { auto it = d.begin(); ans.emplace_back(*it, 0); ans.emplace_back(*it, 1); d.erase(it); find = true; stB = true; } } if (!find) break; } if (ans.size() != n + m) { cout << "No\n"; } else { cout << "Yes\n"; for (auto& [v, c] : ans) { if (c) cout << "Blue "; else cout << "Red "; cout << v << "\n"; } } } return 0; }