結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー ganmodokix
提出日時 2020-06-26 21:34:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 512 ms / 2,000 ms
コード長 9,864 bytes
コンパイル時間 2,228 ms
コンパイル使用メモリ 209,080 KB
最終ジャッジ日時 2025-01-11 10:57:25
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// May this submission get accepted
#include <bits/stdc++.h>
//
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// ()
// #include <boost/multiprecision/cpp_int.hpp>
// using mll = boost::multiprecision::cpp_int;
//
#define ALLOF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define FOREACH(i,q) for (auto &i : q)
template<class T> bool chmax(T &a, const T b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T b) { if (a > b) {a = b; return true;} return false; }
constexpr int INF = numeric_limits<int>::max();
constexpr long long LINF = numeric_limits<long long>::max();
constexpr long double EPS = 1e-10L;
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define IIF(q,t,f) ((q) ? (t) : (f))
#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)
template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }
template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }
template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }
template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }
template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]
    ){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }
template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}
template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr <<
    "]"; }
template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x);
    cerr << " @ " << fn << "(" << ln << ")" << endl; }
// gcc
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
//
struct qin { // query input
size_t sz;
qin(size_t _sz = 1) : sz(_sz) {}
template <typename T> operator T () const { T a; cin >> a; return a; }
template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
qin in1; // input one
template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }
void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }
template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ?
    end : sep); } }
template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); }
    }
//
// [[LIBRARY]] segtree_lazy2.cpp
// [Inclusion] segtree_lazy2.cpp
// T: , U:
template<typename T, typename U, typename JOIN_T, typename APPLY_U, typename JOIN_U, typename MULTIPLY_U, typename HALF_U>
class segtree {
T IT; // T
U IU; // U
JOIN_T join_t; // join; T(T: , T: )
APPLY_U apply_u; // ; T(T: , U: )
JOIN_U join_u; // join; U(U: , U: )
MULTIPLY_U multiply_u; // n; U(U: , ll: 2)
HALF_U half_u; // ; U(U: multiply_u2)
ll n; //
vector<T> node;
vector<U> lazy;
vector<char> fall; // vector<bool>vector<char>
// [l, r) , k
inline void eval(ll k, ll l, ll r) {
if (!fall[k]) return;
node[k] = apply_u(node[k], lazy[k]);
if (r-l > 1) { //
lazy[k*2+1] = join_u(lazy[k*2+1], half_u(lazy[k]));
lazy[k*2+2] = join_u(lazy[k*2+2], half_u(lazy[k]));
fall[k*2+1] = fall[k*2+2] = true;
}
lazy[k] = IU;
fall[k] = false;
}
public:
//
segtree(const vector<T> &v, T _it, U _iu, JOIN_T _jot, APPLY_U _apu, JOIN_U _jou, MULTIPLY_U _muu, HALF_U _hau):
IT(_it), IU(_iu), join_t(_jot), apply_u(_apu), join_u(_jou), multiply_u(_muu), half_u(_hau)
{
ll sz = (ll)v.size();
n = 1; while (n < sz) n *= 2;
this->node = vector<T >(n * 2 - 1, IT);
this->lazy = vector<U >(n * 2 - 1, IU);
this->fall = vector<char>(n * 2 - 1, false);
for (ll i = 0; i < sz; i++) node[n-1 + i] = v[i];
for (ll i = n-1; i--; ) node[i] = join_t(node[i*2+1], node[i*2+2]);
}
// [a, b) x , [l, r)k
void apply(ll a, ll b, U x, ll k = 0, ll l = 0, ll r = -1) {
if (r < 0) r = n; //
eval(k, l, r);
if (b <= l || r <= a) return; //
if (a <= l && r <= b) {
lazy[k] = join_u(lazy[k], multiply_u(x, r - l));
fall[k] = true;
eval(k, l, r);
} else {
apply(a, b, x, k*2+1, l, (l+r)/2);
apply(a, b, x, k*2+2, (l+r)/2, r);
node[k] = join_t(node[k*2+1], node[k*2+2]);
}
}
// [a, b)
T fetch(ll a, ll b, ll k = 0, ll l = 0, ll r = -1) {
if (r < 0) r = n; //
if (b <= l || r <= a) return IT; //
eval(k, l, r);
if (a <= l && r <= b) return node[k];
T vl = fetch(a, b, k*2+1, l, (l+r)/2);
T vr = fetch(a, b, k*2+2, (l+r)/2, r);
return join_t(vl, vr);
}
// a == [a, a+1) x
inline void applyp(ll a, U x) { apply(a, a+1, x); }
// a == [a,a+1)
inline T fetchp(ll a) { return fetch(a, a+1); }
};
// C++17 ()
template<typename T, typename U, typename JOIN_T, typename APPLY_U, typename JOIN_U, typename MULTIPLY_U, typename HALF_U>
segtree<T, U, JOIN_T, APPLY_U, JOIN_U, MULTIPLY_U, HALF_U> make_segtree(const vector<T> &v, T _it, U _iu, JOIN_T _jot, APPLY_U _apu, JOIN_U _jou,
    MULTIPLY_U _muu, HALF_U _hau) {
return segtree<T, U, JOIN_T, APPLY_U, JOIN_U, MULTIPLY_U, HALF_U>(v, _it, _iu, _jot, _apu, _jou, _muu, _hau);
}
//
const auto SEGTREE_ASGF = [](ll, ll y) { return y; };
const auto SEGTREE_EYE2 = [](ll x, ll) { return x; };
const auto SEGTREE_EYE = [](ll x) { return x; };
auto make_segtree_rminq(const vector<ll> &v) {
auto minf = [](ll x, ll y) { return min(x, y); };
return make_segtree(v, LINF, LINF, minf, SEGTREE_ASGF, SEGTREE_ASGF, SEGTREE_EYE2, SEGTREE_EYE);
}
auto make_segtree_rmaxq(const vector<ll> &v) {
auto maxf = [](ll x, ll y) { return max(x, y); };
return make_segtree(v, -LINF, -LINF, maxf, SEGTREE_ASGF, SEGTREE_ASGF, SEGTREE_EYE2, SEGTREE_EYE);
}
auto make_segtree_raddq(const vector<ll> &v) {
auto addf = [](ll x, ll y) { return x + y; };
auto hlff = [](ll x) { return x / 2; };
return make_segtree(v, 0LL, 0LL, addf, addf, addf, SEGTREE_EYE2, hlff);
}
// [[/LIBRARY]]
//
int main() {
ios::sync_with_stdio(false); // stdio使
cin.tie(nullptr); //
ll n = in1;
vector<ll> a = qin(n);
ll ansmin = LINF, ansmax = -LINF;
vector r(n, 0LL);
iota(ALLOF(r), 0LL);
sort(ALLOF(r), [&](ll i, ll j) {
return a[i] < a[j];
});
{
vector dummy(n, LINF);
auto sgt = make_segtree_rminq(dummy);
REP(i_, n) {
ll i = r[n-1-i_];
ll l = sgt.fetch(0, i);
ll r = sgt.fetch(i+1, n);
if (l < LINF && r < LINF) {
ll sz = l + r + a[i];
chmin(ansmin, sz);
chmin(ansmax, sz);
}
sgt.applyp(i, a[i]);
}
}
{
vector dummy(n, LINF);
auto sgt = make_segtree_rminq(dummy);
REP(i_, n) {
ll i = r[i_];
ll l = sgt.fetch(0, i);
ll r = sgt.fetch(i+1, n);
if (l < LINF && r < LINF) {
ll sz = l + r + a[i];
chmin(ansmin, sz);
chmin(ansmax, sz);
}
sgt.applyp(i, a[i]);
}
}
say(ansmin == LINF ? -1 : ansmin);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0