結果
問題 | No.2307 [Cherry 5 th Tune *] Cool 46 |
ユーザー | sten_san |
提出日時 | 2023-05-19 21:48:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,504 ms / 2,000 ms |
コード長 | 4,716 bytes |
コンパイル時間 | 3,098 ms |
コンパイル使用メモリ | 225,828 KB |
実行使用メモリ | 22,912 KB |
最終ジャッジ日時 | 2024-06-01 00:36:59 |
合計ジャッジ時間 | 59,081 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,812 KB |
testcase_02 | AC | 131 ms
6,944 KB |
testcase_03 | AC | 288 ms
6,940 KB |
testcase_04 | AC | 294 ms
6,940 KB |
testcase_05 | AC | 287 ms
6,940 KB |
testcase_06 | AC | 282 ms
6,948 KB |
testcase_07 | AC | 226 ms
6,940 KB |
testcase_08 | AC | 431 ms
8,108 KB |
testcase_09 | AC | 412 ms
8,832 KB |
testcase_10 | AC | 514 ms
11,392 KB |
testcase_11 | AC | 640 ms
9,344 KB |
testcase_12 | AC | 403 ms
9,992 KB |
testcase_13 | AC | 954 ms
11,592 KB |
testcase_14 | AC | 520 ms
12,160 KB |
testcase_15 | AC | 390 ms
8,436 KB |
testcase_16 | AC | 578 ms
7,680 KB |
testcase_17 | AC | 538 ms
10,112 KB |
testcase_18 | AC | 1,306 ms
22,784 KB |
testcase_19 | AC | 1,081 ms
15,104 KB |
testcase_20 | AC | 1,427 ms
22,784 KB |
testcase_21 | AC | 1,504 ms
21,248 KB |
testcase_22 | AC | 1,263 ms
22,912 KB |
testcase_23 | AC | 1,483 ms
21,888 KB |
testcase_24 | AC | 1,229 ms
19,328 KB |
testcase_25 | AC | 1,272 ms
20,992 KB |
testcase_26 | AC | 1,496 ms
22,784 KB |
testcase_27 | AC | 1,316 ms
21,760 KB |
testcase_28 | AC | 1,399 ms
21,632 KB |
testcase_29 | AC | 1,377 ms
22,528 KB |
testcase_30 | AC | 1,076 ms
16,384 KB |
testcase_31 | AC | 1,429 ms
22,784 KB |
testcase_32 | AC | 1,440 ms
22,784 KB |
testcase_33 | AC | 1,189 ms
22,656 KB |
testcase_34 | AC | 1,186 ms
20,736 KB |
testcase_35 | AC | 1,193 ms
16,256 KB |
testcase_36 | AC | 1,391 ms
20,096 KB |
testcase_37 | AC | 1,349 ms
21,632 KB |
testcase_38 | AC | 43 ms
6,948 KB |
testcase_39 | AC | 68 ms
6,944 KB |
testcase_40 | AC | 44 ms
6,940 KB |
testcase_41 | AC | 283 ms
6,940 KB |
testcase_42 | AC | 926 ms
13,440 KB |
testcase_43 | AC | 934 ms
13,440 KB |
testcase_44 | AC | 44 ms
6,940 KB |
testcase_45 | AC | 44 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename F> constexpr auto fix(F &&f) noexcept { return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...); }; } int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; auto a = vec<int>(uns, n); auto b = vec<int>(uns, m); for (auto &e : a) cin >> e; for (auto &e : b) cin >> e; if (n == 0) { cout << "Yes" << '\n'; for (auto v : b) { cout << "Blue " << v << '\n'; } continue; } if (m == 0) { cout << "Yes" << '\n'; for (auto v : a) { cout << "Red " << v << '\n'; } continue; } bool exists = false; map<int, bool> f; for (auto v : a) { f[v] = true; } map<int, bool> g; for (auto v : b) { g[v] = f[v]; exists |= f[v]; } if (!exists) { cout << "No" << '\n'; continue; } cout << "Yes" << '\n'; sort(begin(a), end(a), [&](int x, int y) { return make_tuple(g[x], x) < make_tuple(g[y], y); }); int iter1 = 0; while (iter1 < n && !g[a[iter1]]) { cout << "Red " << a[iter1++] << '\n'; } sort(begin(b), end(b), [&](int x, int y) { if (y == a[iter1]) { return false; } if (x == a[iter1]) { return true; } return make_tuple(g[x], x) < make_tuple(g[y], y); }); cout << "Red " << a[iter1++] << '\n'; int iter2 = 0; cout << "Blue " << b[iter2++] << '\n'; while (iter2 < m && !g[b[iter2]]) { cout << "Blue " << b[iter2++] << '\n'; } bool turn = false; while (iter1 < n || iter2 < m) { if (!turn) { cout << "Blue " << b[iter2++] << '\n'; if (iter1 < n) { cout << "Red " << a[iter1++] << '\n'; } } else { cout << "Red " << a[iter1++] << '\n'; if (iter2 < m) { cout << "Blue " << b[iter2++] << '\n'; } } turn = !turn; } } cout << flush; }