結果

問題 No.930 数列圧縮
ユーザー haruki_Kharuki_K
提出日時 2019-11-22 23:10:21
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 19 ms / 2,000 ms
コード長 4,738 bytes
コンパイル時間 1,660 ms
コンパイル使用メモリ 169,104 KB
実行使用メモリ 5,216 KB
最終ジャッジ日時 2023-08-01 12:56:38
合計ジャッジ時間 3,996 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 13 ms
4,588 KB
testcase_09 AC 16 ms
4,788 KB
testcase_10 AC 12 ms
4,700 KB
testcase_11 AC 14 ms
4,636 KB
testcase_12 AC 15 ms
4,728 KB
testcase_13 AC 6 ms
4,376 KB
testcase_14 AC 7 ms
4,376 KB
testcase_15 AC 16 ms
5,156 KB
testcase_16 AC 17 ms
5,172 KB
testcase_17 AC 18 ms
5,120 KB
testcase_18 AC 17 ms
5,080 KB
testcase_19 AC 19 ms
5,024 KB
testcase_20 AC 17 ms
5,216 KB
testcase_21 AC 17 ms
5,092 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 17 ms
5,088 KB
testcase_24 AC 1 ms
4,376 KB
testcase_25 AC 1 ms
4,380 KB
testcase_26 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> a(n); cin >> a;

    vector<int> ans;
    auto left = [&](int i) {
        if (i == 0) return;
        assert(a[0] < a[i]);
        rep (j,i) if (a[j] > a[i]) ans.eb(a[j]);
        repR (j,i) if (a[j] < a[i]) ans.eb(a[j]);
    };
    auto right = [&](int i) {
        if (i == n-1) return;
        assert(a[i] < a[n-1]);
        loopR (j,n-1,>=i+1) if (a[i] > a[j]) ans.eb(a[j]);
        loop (j,i+1,<n) if (a[i] < a[j]) ans.eb(a[j]);
    };
    auto answer = [&]() {
        for (int x : ans) cout << x << " ";
        cout << endl;
        exit(0);
    };

    rep (i,n) {
        if (i == 0) {
            if (a[i] < a[n-1]) {
                cout << "Yes\n";
                right(i);
                answer();
            }
        } else if (i == n-1) {
            if (a[0] < a[i]) {
                cout << "Yes\n";
                left(i);
                answer();
            }
        } else {
            if (a[0] < a[i] && a[i] < a[n-1]) {
                cout << "Yes\n";
                left(i);
                right(i);
                answer();
            }
        }
    }
    cout << "No\n";




}
0