結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
|
提出日時 | 2022-01-27 17:40:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 365 ms / 2,000 ms |
コード長 | 2,456 bytes |
コンパイル時間 | 2,482 ms |
コンパイル使用メモリ | 205,380 KB |
最終ジャッジ日時 | 2025-01-27 15:39:29 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)#define all(x) (x).begin(), (x).end()#define sz(x) int(x.size())#define yn(joken) cout<<((joken) ? "Yes" : "No")<<endl#define YN(joken) cout<<((joken) ? "YES" : "NO")<<endlusing namespace std;using ll = long long;using vi = vector<int>;using vl = vector<ll>;using vs = vector<string>;using vc = vector<char>;using vd = vector<double>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;const int INF = 1e9;const ll LINF = 1e18;template <class T>bool chmax(T& a, const T& b) {if (a < b) {a = b;return 1;}return 0;}template <class T>bool chmin(T& a, const T& b) {if (b < a) {a = b;return 1;}return 0;}template <class T>vector<T> make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (int i = 0; i < int(v.size()); i++) {is >> v[i];}return is;}template <typename T>ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < int(v.size()); i++) {os << v[i];if (i < int(v.size()) - 1) os << ' ';}return os;}vector<int> prime_table(int n){vector<bool> prime(n + 1, true);vector<int> ret;if (n >= 0) prime[0] = false;if (n >= 1) prime[1] = false;for (int i = 2; i * i <= n; i++){if (!prime[i]) continue;for (int j = i * i; j <= n; j += i) prime[j] = false;}rep(i,n+1) if(prime[i]) ret.push_back(i);return ret;}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);int N;cin>>N;vi A(N);cin>>A;set<int> S1,S2;vi m1(N),m2(N),M1(N),M2(N);rep(i,N){S1.insert(A[i]);m1[i]=*S1.begin();if(S1.find(A[i])!=--S1.end()) M1[i]=*++S1.find(A[i]);}rrep(i,N){S2.insert(A[i]);m2[i]=*S2.begin();if(S2.find(A[i])!=--S2.end()) M2[i]=*++S2.find(A[i]);}int ans=INF;for(int i=1;i<N-1;i++){if(m1[i-1]<A[i] && A[i]>m2[i+1]) chmin(ans,m1[i-1]+A[i]+m2[i+1]);if(M1[i]>A[i] && A[i]<M2[i]) chmin(ans,M1[i]+A[i]+M2[i]);}cout<<(ans==INF ? -1 : ans)<<endl;}