結果
問題 | No.930 数列圧縮 |
ユーザー | jell |
提出日時 | 2019-12-30 18:32:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 11,930 bytes |
コンパイル時間 | 1,499 ms |
コンパイル使用メモリ | 131,244 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-14 06:24:34 |
合計ジャッジ時間 | 4,234 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 3 ms
6,816 KB |
testcase_08 | AC | 13 ms
6,816 KB |
testcase_09 | AC | 17 ms
6,820 KB |
testcase_10 | AC | 14 ms
6,816 KB |
testcase_11 | AC | 14 ms
6,820 KB |
testcase_12 | AC | 16 ms
6,816 KB |
testcase_13 | AC | 6 ms
6,816 KB |
testcase_14 | AC | 8 ms
6,820 KB |
testcase_15 | AC | 18 ms
6,820 KB |
testcase_16 | AC | 18 ms
6,816 KB |
testcase_17 | AC | 19 ms
6,816 KB |
testcase_18 | AC | 20 ms
6,824 KB |
testcase_19 | AC | 19 ms
6,816 KB |
testcase_20 | AC | 19 ms
6,820 KB |
testcase_21 | AC | 19 ms
6,816 KB |
testcase_22 | AC | 2 ms
6,816 KB |
testcase_23 | AC | 18 ms
6,824 KB |
testcase_24 | AC | 2 ms
6,816 KB |
testcase_25 | AC | 2 ms
6,816 KB |
testcase_26 | AC | 2 ms
6,816 KB |
ソースコード
#ifdef LOCAL #define _GLIBCXX_DEBUG #define __clock__ #else #pragma GCC optimize("Ofast") // #define NDEBUG #endif // #define __buffer_check__ #define __precision__ 10 #define iostream_untie true #define debug_stream std::cerr #include <algorithm> #include <bitset> #include <cassert> #include <chrono> #include <complex> #include <cstring> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <unordered_map> #include <unordered_set> #define all(v) std::begin(v), std::end(v) #define rall(v) std::rbegin(v), std::rend(v) #define odd(n) ((n) & 1) #define even(n) (not __odd(n)) #define __popcount(n) __builtin_popcountll(n) #define __clz32(n) __builtin_clz(n) #define __clz64(n) __builtin_clzll(n) #define __ctz32(n) __builtin_ctz(n) #define __ctz64(n) __builtin_ctzll(n) using i32 = int_least32_t; using i64 = int_least64_t; using u32 = uint_least32_t; using u64 = uint_least64_t; using pii = std::pair<i32, i32>; using pll = std::pair<i64, i64>; template <class T> using heap = std::priority_queue<T>; template <class T> using rheap = std::priority_queue<T, std::vector<T>, std::greater<T>>; template <class T> using hashset = std::unordered_set<T>; template <class Key, class Value> using hashmap = std::unordered_map<Key, Value>; namespace setting { using namespace std::chrono; system_clock::time_point start_time, end_time; long long get_elapsed_time() { end_time = system_clock::now(); return duration_cast<milliseconds>(end_time - start_time).count(); } void print_elapsed_time() { debug_stream << "\n----- Exec time : " << get_elapsed_time() << " ms -----\n"; } void buffer_check() { char bufc; if(std::cin >> bufc) debug_stream << "\n\033[1;35mwarning\033[0m: buffer not empty.\n"; } struct setupper { setupper() { if(iostream_untie) std::ios::sync_with_stdio(false), std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(__precision__); #ifdef stderr_path if(freopen(stderr_path, "a", stderr)) { std::cerr << std::fixed << std::setprecision(__precision__); } #endif #ifdef stdout_path if(not freopen(stdout_path, "w", stdout)) { freopen("CON", "w", stdout); debug_stream << "\n\033[1;35mwarning\033[0m: failed to open stdout file.\n"; } std::cout << ""; #endif #ifdef stdin_path if(not freopen(stdin_path, "r", stdin)) { freopen("CON", "r", stdin); debug_stream << "\n\033[1;35mwarning\033[0m: failed to open stdin file.\n"; } #endif #ifdef LOCAL debug_stream << "\n----- stderr at LOCAL -----\n\n"; atexit(print_elapsed_time); #endif #ifdef __buffer_check__ atexit(buffer_check); #endif #if defined(__clock__) || defined(LOCAL) start_time = system_clock::now(); #endif } } __setupper; // struct setupper } // namespace setting #ifdef __clock__ class { std::chrono::system_clock::time_point built_pt, last_pt; int built_ln, last_ln; std::string built_func, last_func; bool is_built = false; public: void build(int crt_ln, const std::string &crt_func) { is_built = true, last_pt = built_pt = std::chrono::system_clock::now(), last_ln = built_ln = crt_ln, last_func = built_func = crt_func; } void set(int crt_ln, const std::string &crt_func) { if(is_built) last_pt = std::chrono::system_clock::now(), last_ln = crt_ln, last_func = crt_func; else debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::set failed (yet to be built!)\n"; } void get(int crt_ln, const std::string &crt_func) { if(is_built) { std::chrono::system_clock::time_point crt_pt(std::chrono::system_clock::now()); long long diff = std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt - last_pt).count(); debug_stream << diff << " ms elapsed from" << " [ " << last_ln << " : " << last_func << " ]"; if(last_ln == built_ln) debug_stream << " (when built)"; debug_stream << " to" << " [ " << crt_ln << " : " << crt_func << " ]" << "\n"; last_pt = built_pt, last_ln = built_ln, last_func = built_func; } else { debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::get failed (yet to be built!)\n"; } } } myclock; // unnamed class #define build_clock() myclock.build(__LINE__, __func__) #define set_clock() myclock.set(__LINE__, __func__) #define get_clock() myclock.get(__LINE__, __func__) #else #define build_clock() ((void)0) #define set_clock() ((void)0) #define get_clock() ((void)0) #endif namespace std { // hash template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); } template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } }; template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } }; template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } }; template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } }; // iostream template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; } template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; } template <class tuple_t, size_t index> struct tupleis { static istream &apply(istream &is, tuple_t &t) { tupleis<tuple_t, index - 1>::apply(is, t); return is >> get<index>(t); } }; template <class tuple_t> struct tupleis<tuple_t, SIZE_MAX> { static istream &apply(istream &is, tuple_t &t) { return is; } }; template <class... T> istream &operator>>(istream &is, tuple<T...> &t) { return tupleis<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is, t); } template <> istream &operator>>(istream &is, tuple<> &t) { return is; } template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } }; template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } }; template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); } template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; } template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr> istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; } template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr> ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; } } // namespace std #ifdef LOCAL #define dump(...) \ debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n", \ dump_func(#__VA_ARGS__, __VA_ARGS__) template <class T> void dump_func(const char *ptr, const T &x) { debug_stream << '\t'; for(char c = *ptr; c != '\0'; c = *++ptr) if(c != ' ') debug_stream << c; debug_stream << " : " << x << '\n'; } template <class T, class... rest_t> void dump_func(const char *ptr, const T &x, rest_t... rest) { debug_stream << '\t'; for(char c = *ptr; c != ','; c = *++ptr) if(c != ' ') debug_stream << c; debug_stream << " : " << x << ",\n"; dump_func(++ptr, rest...); } #else #define dump(...) ((void)0) #endif template <class T = int> T read() { T x; std::cin >> x; return x; } template <class iterator> void read(iterator __first, iterator __last) { for(iterator i = __first; i != __last; ++i) std::cin >> *i; } template <class iterator> void write(iterator __first, iterator __last) { for(iterator i = __first; i != __last; std::cout << (++i == __last ? "" : " ")) std::cout << *i; } // substitute y for x if x > y. template <class T> inline bool sbmin(T &x, const T &y) { return x > y ? x = y, true : false; } // substitute y for x if x < y. template <class T> inline bool sbmax(T &x, const T &y) { return x < y ? x = y, true : false; } // binary search on integers. long long bin(long long __ok, long long __ng, const std::function<bool(long long)> &pred) { while(std::abs(__ok - __ng) > 1) { long long mid{(__ok + __ng) / 2}; (pred(mid) ? __ok : __ng) = mid; } return __ok; } // binary search on real numbers. long double bin(long double __ok, long double __ng, const long double eps, const std::function<bool(long double)> &pred) { while(std::abs(__ok - __ng) > eps) { long double mid{(__ok + __ng) / 2}; (pred(mid) ? __ok : __ng) = mid; } return __ok; } // binary search on integers(with a class member function). template <class X, class int_t> long long bin(long long __ok, long long __ng, bool (X::*const pred)(int_t), X *const x) { while(std::abs(__ok - __ng) > 1) { long long mid{(__ok + __ng) / 2}; ((x->*pred)(mid) ? __ok : __ng) = mid; } return __ok; } // binary search on real numbers(with a class member function). template <class X, class real_t> long double bin(long double __ok, long double __ng, const long double eps, bool (X::*const pred)(real_t), X *const x) { while(std::abs(__ok - __ng) > eps) { long double mid{(__ok + __ng) / 2}; ((x->*pred)(mid) ? __ok : __ng) = mid; } return __ok; } // be careful that val is type-sensitive. template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } // reset all bits. template <class A> void reset(A &array) { memset(array, 0, sizeof(array)); } /* The main code follows. */ using namespace std; struct solver { solver() { int n; cin>>n; vector<int> a(n); cin>>a; if(a.front()>a.back()) { cout << "No" << "\n"; return; } cout << "Yes" << "\n"; stack<int> stk; stk.emplace(a.front()); int itr=1; while(itr<n) { while(stk.size()>1 && stk.top()<a[itr]) { cout << stk.top() << " "; stk.pop(); } if(stk.top()>a[itr]) { stk.emplace(a[itr]); } else { cout << a[itr] << " "; } itr++; } } }; // struct solver int main(int argc, char *argv[]) { u32 t; // loop count #ifdef LOCAL t = 1; #else t = 1; // single test case // t = -1; // infinite loop // cin >> t; // case number given #endif while(t--) { solver(); } }