結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー | Daylight |
提出日時 | 2023-05-19 21:39:05 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 470 ms / 2,000 ms |
コード長 | 4,005 bytes |
コンパイル時間 | 3,296 ms |
コンパイル使用メモリ | 218,128 KB |
実行使用メモリ | 14,208 KB |
最終ジャッジ日時 | 2024-12-21 01:55:57 |
合計ジャッジ時間 | 40,623 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 212 ms
6,816 KB |
testcase_03 | AC | 199 ms
6,816 KB |
testcase_04 | AC | 191 ms
6,820 KB |
testcase_05 | AC | 188 ms
6,816 KB |
testcase_06 | AC | 206 ms
6,820 KB |
testcase_07 | AC | 153 ms
6,820 KB |
testcase_08 | AC | 233 ms
6,820 KB |
testcase_09 | AC | 237 ms
6,816 KB |
testcase_10 | AC | 197 ms
6,816 KB |
testcase_11 | AC | 310 ms
6,820 KB |
testcase_12 | AC | 208 ms
7,072 KB |
testcase_13 | AC | 343 ms
6,816 KB |
testcase_14 | AC | 249 ms
8,192 KB |
testcase_15 | AC | 170 ms
6,820 KB |
testcase_16 | AC | 281 ms
6,816 KB |
testcase_17 | AC | 226 ms
6,820 KB |
testcase_18 | AC | 413 ms
10,880 KB |
testcase_19 | AC | 406 ms
8,448 KB |
testcase_20 | AC | 346 ms
6,016 KB |
testcase_21 | AC | 351 ms
6,820 KB |
testcase_22 | AC | 427 ms
11,392 KB |
testcase_23 | AC | 344 ms
6,816 KB |
testcase_24 | AC | 423 ms
11,392 KB |
testcase_25 | AC | 422 ms
11,136 KB |
testcase_26 | AC | 345 ms
6,816 KB |
testcase_27 | AC | 431 ms
11,648 KB |
testcase_28 | AC | 367 ms
6,820 KB |
testcase_29 | AC | 365 ms
7,424 KB |
testcase_30 | AC | 419 ms
10,240 KB |
testcase_31 | AC | 344 ms
6,016 KB |
testcase_32 | AC | 350 ms
6,016 KB |
testcase_33 | AC | 470 ms
13,568 KB |
testcase_34 | AC | 462 ms
12,800 KB |
testcase_35 | AC | 409 ms
9,088 KB |
testcase_36 | AC | 372 ms
6,400 KB |
testcase_37 | AC | 407 ms
10,240 KB |
testcase_38 | AC | 334 ms
5,248 KB |
testcase_39 | AC | 446 ms
5,248 KB |
testcase_40 | AC | 328 ms
5,248 KB |
testcase_41 | AC | 340 ms
5,248 KB |
testcase_42 | AC | 403 ms
8,832 KB |
testcase_43 | AC | 417 ms
8,832 KB |
testcase_44 | AC | 439 ms
14,208 KB |
testcase_45 | AC | 306 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define SZ(x) (int) (x).size() #define REP(i, n) for(int i = 0; i < (n); i++) #define FOR(i, a, b) for(auto i = (a); i < (b); i++) #define For(i, a, b, c) \ for(auto i = (a); i != (b); i += (c)) #define REPR(i, n) for(auto i = (n) -1; i >= 0; i--) #define ALL(s) (s).begin(), (s).end() #define so(V) sort(ALL(V)) #define rev(V) reverse(ALL(V)) #define uni(v) v.erase(unique(ALL(v)), (v).end()) #define eb emplace_back typedef unsigned long long ull; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<bool> vb; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef pair<int, int> PI; typedef pair<ll, ll> PL; const double EPS = 1e-6; const int MOD = 1e9 + 7; const int INF = (1 << 30); const ll LINF = 1e18; const double math_PI = acos(-1); template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); } template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>( a, make_v<T>(ts...)); } template<typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v( T& t, const V& v) { t = v; } template<typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v( T& t, const V& v) { for(auto& e: t) fill_v(e, v); } template<class T> bool chmax(T& a, const T& b) { if(a < b) { a = b; return true; } return false; } template<class T> bool chmin(T& a, const T& b) { if(a > b) { a = b; return true; } return false; } template<typename S, typename T> istream& operator>>(istream& is, pair<S, T>& p) { cin >> p.first >> p.second; return is; } template<typename T> istream& operator>>(istream& is, vector<T>& vec) { for(T& x: vec) is >> x; return is; } template<typename T> string join(vector<T>& vec, string splitter) { stringstream ss; REP(i, SZ(vec)) { if(i != 0) ss << splitter; ss << vec[i]; } return ss.str(); } template<typename T> ostream& operator<<(ostream& os, vector<T>& vec) { os << join(vec, " "); return os; } void solve() { int N, M; cin >> N >> M; vi A(N), B(M); cin >> A >> B; set<int> SA; for(auto a: A) SA.insert(a); queue<int> onlyA, onlyB, same; for(auto b: B) { if(SA.find(b) != SA.end()) { same.push(b); SA.erase(b); } else { onlyB.push(b); } } for(auto a: SA) { onlyA.push(a); } if(onlyA.empty()) { cout << "Yes" << endl; while(!onlyB.empty()) { cout << "Blue " << onlyB.front() << endl; onlyB.pop(); } bool nextA = false; while(!same.empty()) { if(nextA) { cout << "Red " << same.front() << endl; cout << "Blue " << same.front() << endl; } else { cout << "Blue " << same.front() << endl; cout << "Red " << same.front() << endl; } same.pop(); nextA = !nextA; } return; } if(onlyB.empty()) { cout << "Yes" << endl; while(!onlyA.empty()) { cout << "Red " << onlyA.front() << endl; onlyA.pop(); } bool nextA = true; while(!same.empty()) { if(nextA) { cout << "Red " << same.front() << endl; cout << "Blue " << same.front() << endl; } else { cout << "Blue " << same.front() << endl; cout << "Red " << same.front() << endl; } same.pop(); nextA = !nextA; } return; } if(same.empty()) { cout << "No" << endl; return; } cout << "Yes" << endl; while(!onlyA.empty()) { cout << "Red " << onlyA.front() << endl; onlyA.pop(); } cout << "Red " << same.front() << endl; cout << "Blue " << same.front() << endl; same.pop(); while(!onlyB.empty()) { cout << "Blue " << onlyB.front() << endl; onlyB.pop(); } bool nextA = false; while(!same.empty()) { if(nextA) { cout << "Red " << same.front() << endl; cout << "Blue " << same.front() << endl; } else { cout << "Blue " << same.front() << endl; cout << "Red " << same.front() << endl; } same.pop(); nextA = !nextA; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int T; cin >> T; while(T--) { solve(); } return 0; }