結果
問題 | No.2518 Adjacent Larger |
ユーザー | sten_san |
提出日時 | 2023-10-27 22:08:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 18 ms / 2,000 ms |
コード長 | 3,642 bytes |
コンパイル時間 | 2,136 ms |
コンパイル使用メモリ | 208,056 KB |
実行使用メモリ | 4,536 KB |
最終ジャッジ日時 | 2023-10-27 22:08:48 |
合計ジャッジ時間 | 3,430 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 14 ms
4,348 KB |
testcase_02 | AC | 14 ms
4,348 KB |
testcase_03 | AC | 14 ms
4,348 KB |
testcase_04 | AC | 14 ms
4,348 KB |
testcase_05 | AC | 14 ms
4,348 KB |
testcase_06 | AC | 5 ms
4,348 KB |
testcase_07 | AC | 6 ms
4,348 KB |
testcase_08 | AC | 6 ms
4,348 KB |
testcase_09 | AC | 6 ms
4,348 KB |
testcase_10 | AC | 6 ms
4,348 KB |
testcase_11 | AC | 5 ms
4,348 KB |
testcase_12 | AC | 6 ms
4,348 KB |
testcase_13 | AC | 5 ms
4,348 KB |
testcase_14 | AC | 6 ms
4,348 KB |
testcase_15 | AC | 5 ms
4,348 KB |
testcase_16 | AC | 16 ms
4,532 KB |
testcase_17 | AC | 10 ms
4,348 KB |
testcase_18 | AC | 10 ms
4,348 KB |
testcase_19 | AC | 8 ms
4,348 KB |
testcase_20 | AC | 12 ms
4,348 KB |
testcase_21 | AC | 18 ms
4,536 KB |
testcase_22 | AC | 17 ms
4,536 KB |
testcase_23 | AC | 16 ms
4,536 KB |
testcase_24 | AC | 14 ms
4,532 KB |
testcase_25 | AC | 14 ms
4,536 KB |
testcase_26 | AC | 15 ms
4,536 KB |
testcase_27 | AC | 14 ms
4,536 KB |
testcase_28 | AC | 14 ms
4,536 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; cin >> n; auto a = vec<int>(uns, n); for (auto &e : a) cin >> e; if (count(begin(a), end(a), 1) == n) { cout << "No" << '\n'; continue; } auto dp = [&](int f) { auto dp = vec<char>(false, 2, n + 1); dp[f][0] = true; for (int i = 1; i <= n; ++i) { auto v = a[i - 1]; if (v == 0) { dp[1][i] = dp[0][i - 1]; } if (v == 1) { dp[0][i] = dp[0][i - 1]; dp[1][i] = dp[1][i - 1]; } if (v == 2) { dp[0][i] = dp[1][i - 1]; } } return dp; }; if (a[0] == 0) { cout << ((dp(0)[0][n]) ? "Yes" : "No") << '\n'; continue; } if (a[0] == 2) { cout << ((dp(1)[1][n]) ? "Yes" : "No") << '\n'; continue; } cout << ((dp(0)[0][n] || dp(1)[1][n]) ? "Yes" : "No") << '\n'; } cout << flush; }