結果
| 問題 | No.1095 Smallest Kadomatsu Subsequence |
| ユーザー |
 Ogtsn99
|
| 提出日時 | 2020-06-26 21:42:30 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 328 ms / 2,000 ms |
| コード長 | 7,292 bytes |
| コンパイル時間 | 1,930 ms |
| コンパイル使用メモリ | 185,756 KB |
| 実行使用メモリ | 43,036 KB |
| 最終ジャッジ日時 | 2024-07-04 20:23:24 |
| 合計ジャッジ時間 | 5,949 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 2 ms
5,376 KB |
| testcase_04 | AC | 2 ms
5,376 KB |
| testcase_05 | AC | 2 ms
5,376 KB |
| testcase_06 | AC | 2 ms
5,376 KB |
| testcase_07 | AC | 2 ms
5,376 KB |
| testcase_08 | AC | 2 ms
5,376 KB |
| testcase_09 | AC | 1 ms
5,376 KB |
| testcase_10 | AC | 1 ms
5,376 KB |
| testcase_11 | AC | 2 ms
5,376 KB |
| testcase_12 | AC | 2 ms
5,376 KB |
| testcase_13 | AC | 11 ms
5,376 KB |
| testcase_14 | AC | 11 ms
5,504 KB |
| testcase_15 | AC | 11 ms
5,504 KB |
| testcase_16 | AC | 11 ms
5,504 KB |
| testcase_17 | AC | 10 ms
5,376 KB |
| testcase_18 | AC | 12 ms
5,504 KB |
| testcase_19 | AC | 12 ms
5,376 KB |
| testcase_20 | AC | 12 ms
5,376 KB |
| testcase_21 | AC | 11 ms
5,376 KB |
| testcase_22 | AC | 11 ms
5,504 KB |
| testcase_23 | AC | 304 ms
43,000 KB |
| testcase_24 | AC | 305 ms
43,036 KB |
| testcase_25 | AC | 313 ms
43,008 KB |
| testcase_26 | AC | 304 ms
42,972 KB |
| testcase_27 | AC | 328 ms
43,004 KB |
| testcase_28 | AC | 245 ms
43,032 KB |
| testcase_29 | AC | 244 ms
42,912 KB |
| testcase_30 | AC | 268 ms
42,916 KB |
| testcase_31 | AC | 268 ms
43,008 KB |
| testcase_32 | AC | 271 ms
42,880 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T>
int getIndexOfLowerBound(vector <T> &v, T x){
return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T>
int getIndexOfUpperBound(vector <T> &v, T x){
return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT<<'{';
os << pair_var.first;
DUMPOUT<<',';
os << " "<< pair_var.second;
DUMPOUT<<'}';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT<<'[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT<<']';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto& vec : df) os<<vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct SegTree{
int n;
vector <pair <int,int> > node;
SegTree(vector <int> v){
int sz = v.size();
n = 1;
while(n<sz) n*=2;
node.resize(2*n-1, {INF,INF});
for(int i=0; i<sz; i++) node[i+n-1] = {v[i],i}; //一番下側
for(int i=n-2;i>=0;i--) node[i] = min(node[2*i+1], node[2*i+2]);
}
int getnum(int p){
return node[n-1+p].F;
}
int geti(int p){
return node[n-1+p].S;
}
void update(int number, int val){
number += n-1;
node[number].F= val;
while(number>0){
number=(number-1)/2;
node[number] = min(node[number*2+1], node[number*2+2]);
}
}
pair <int,int> getmin(int a, int b, int k=0, int l = 0, int r = -1){ //値, 場所
if(r<0) r=n;
if(r<=a||b<=l) return {INF,INF};
if(a <= l&& r<=b) return node[k];
pair <int,int> vl = getmin(a, b, 2*k+1, l, (l+r)/2);
pair <int,int> vr = getmin(a, b, 2*k+2, (l+r)/2, r);
return min(vl, vr);
}
void showall(){
for(int i=0;i<2*n-1;i++)cout<<node[i].F<<'&'<<node[i].S<<endl;
}
};
struct SegTreema{
int n;
vector <pair <int,int> > node;
SegTreema(vector <int> v){
int sz = v.size();
n = 1;
while(n<sz) n*=2;
node.resize(2*n-1, {-INF,-INF});
for(int i=0; i<sz; i++) node[i+n-1] = {v[i],i}; //一番下側
for(int i=n-2;i>=0;i--) node[i] = max(node[2*i+1], node[2*i+2]);
}
int getnum(int p){
return node[n-1+p].F;
}
int geti(int p){
return node[n-1+p].S;
}
void update(int number, int val){
number += n-1;
node[number].F= val;
while(number>0){
number=(number-1)/2;
node[number] = max(node[number*2+1], node[number*2+2]);
}
}
pair <int,int> getmax(int a, int b, int k=0, int l = 0, int r = -1){ //0~n
if(r<0) r=n;
if(r<=a||b<=l) return {-INF,-INF};
if(a <= l&& r<=b) return node[k];
pair <int,int> vl = getmax(a, b, 2*k+1, l, (l+r)/2);
pair <int,int> vr = getmax(a, b, 2*k+2, (l+r)/2, r);
return max(vl, vr);
}
void showall(){
for(int i=0;i<2*n-1;i++)cout<<node[i].F<<'&'<<node[i].S<<endl;
}
};
bool f(int a, int b, int c){
return a != b && c != b && a != c;
}
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
int n; cin>>n;
vector <int> a(n);
cin>>a;
SegTree segmi(a);
SegTreema segma(a);
vector <int> lbig(n), rbig(n);
set <int> se;
se.insert(INF);
rep(i, n){
if(i == 0) se.insert(a[i]);
else {
lbig[i] = *se.lower_bound(a[i]);
se.insert(a[i]);
}
}
set <int> se2;
se2.insert(INF);
rrep(i, n){
if(i == n-1) se2.insert(a[i]);
else {
rbig[i] = *se2.lower_bound(a[i]);
se2.insert(a[i]);
}
}
int ans = INF;
rep(i, n){
if(i == 0 || i == n-1) continue;
int lmi = segmi.getmin(0, i).F, rmi = segmi.getmin(i+1, INF).F;
if(lmi < a[i] && rmi < a[i] && f(a[i], lmi, rmi)) chmin(ans, a[i] + lmi + rmi);
//より大きい
chmin(ans, a[i] + rbig[i] + lbig[i]);
}
if(ans == INF) print(-1);
else print(ans);
}