結果
問題 | No.930 数列圧縮 |
ユーザー |
![]() |
提出日時 | 2020-01-13 01:18:24 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 86 ms / 2,000 ms |
コード長 | 2,712 bytes |
コンパイル時間 | 1,534 ms |
コンパイル使用メモリ | 168,356 KB |
実行使用メモリ | 9,160 KB |
最終ジャッジ日時 | 2024-12-14 07:10:04 |
合計ジャッジ時間 | 4,576 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include <bits/stdc++.h> #define ADD(a, b) a = (a + ll(b)) % mod #define MUL(a, b) a = (a * ll(b)) % mod #define MAX(a, b) a = max(a, b) #define MIN(a, b) a = min(a, b) #define rep(i, a, b) for(int i = int(a); i < int(b); i++) #define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--) #define all(a) (a).begin(), (a).end() #define sz(v) (int)(v).size() #define pb push_back #define sec second #define fst first #define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<int, pi> ppi; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vl> mat; typedef complex<double> comp; void Debug() {cerr << '\n'; } template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){ cerr<<arg<<" ";Debug(rest...);} template<class T>ostream& operator<<(ostream& out,const vector<T>& v) { out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;} template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){ out<<"("<<v.first<<", "<<v.second<<")";return out;} const int MAX_N = 500010; const int MAX_V = 100010; const double eps = 1e-6; const ll mod = 1000000007; const int inf = (1 << 30) - 1; const ll linf = 1LL << 60; const double PI = 3.14159265358979323846; mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng) /////////////////////////////////////////////////////////////////////////////////////////////////// int N; int A[MAX_N]; void solve() { cin >> N; rep(i, 0, N) cin >> A[i]; if(A[0] > A[N - 1]) { cout << "No" << "\n"; } else { cout << "Yes\n"; set<int> S; rep(i, 1, N + 1) { if(i == A[0] || i == A[N - 1]) continue; S.insert(i); } int at = 1; while(!S.empty()) { int v = *(--S.end()); if(v < A[N - 1]) break; vi vec; S.erase(v); while(A[at] != v) { vec.pb(A[at]); S.erase(A[at]); at++; } at++; reverse(all(vec)); rep(i, 0, sz(vec)) { cout << vec[i] << " "; } cout << v << " "; } rer(i, N - 1, at) { cout << A[i] << " "; } cout << A[0] << "\n"; } } uint32_t rd() { uint32_t res; #ifdef __MINGW32__ asm volatile("rdrand %0" :"=a"(res) ::"cc"); #else res = std::random_device()(); #endif return res; } int main() { #ifndef LOCAL ios::sync_with_stdio(false); cin.tie(0); #endif cout << fixed; cout.precision(20); cerr << fixed; cerr.precision(6); rng.seed(rd()); #ifdef LOCAL //freopen("in.txt", "wt", stdout); //for tester if(!freopen("in.txt", "rt", stdin)) return 1; #endif solve(); cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0; }