結果

問題 No.1031 いたずら好きなお姉ちゃん
ユーザー haruki_Kharuki_K
提出日時 2020-04-17 23:27:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 51 ms / 3,500 ms
コード長 6,009 bytes
コンパイル時間 1,790 ms
コンパイル使用メモリ 178,120 KB
実行使用メモリ 19,712 KB
最終ジャッジ日時 2024-10-03 15:31:55
合計ジャッジ時間 5,378 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 4 ms
5,248 KB
testcase_05 AC 4 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 3 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 4 ms
5,248 KB
testcase_10 AC 4 ms
5,248 KB
testcase_11 AC 40 ms
16,512 KB
testcase_12 AC 40 ms
16,512 KB
testcase_13 AC 49 ms
19,456 KB
testcase_14 AC 42 ms
17,152 KB
testcase_15 AC 45 ms
18,432 KB
testcase_16 AC 40 ms
16,384 KB
testcase_17 AC 46 ms
18,560 KB
testcase_18 AC 45 ms
17,920 KB
testcase_19 AC 48 ms
18,688 KB
testcase_20 AC 51 ms
19,328 KB
testcase_21 AC 44 ms
18,048 KB
testcase_22 AC 40 ms
16,384 KB
testcase_23 AC 40 ms
16,640 KB
testcase_24 AC 47 ms
18,688 KB
testcase_25 AC 48 ms
19,328 KB
testcase_26 AC 45 ms
18,176 KB
testcase_27 AC 42 ms
17,152 KB
testcase_28 AC 48 ms
19,456 KB
testcase_29 AC 49 ms
19,456 KB
testcase_30 AC 49 ms
19,456 KB
testcase_31 AC 48 ms
19,456 KB
testcase_32 AC 47 ms
19,456 KB
testcase_33 AC 49 ms
19,328 KB
testcase_34 AC 37 ms
19,632 KB
testcase_35 AC 38 ms
19,712 KB
testcase_36 AC 39 ms
19,712 KB
testcase_37 AC 39 ms
19,708 KB
testcase_38 AC 38 ms
19,456 KB
testcase_39 AC 37 ms
18,944 KB
testcase_40 AC 36 ms
19,328 KB
testcase_41 AC 38 ms
19,584 KB
testcase_42 AC 37 ms
19,328 KB
testcase_43 AC 37 ms
19,584 KB
testcase_44 AC 38 ms
19,456 KB
testcase_45 AC 35 ms
19,072 KB
testcase_46 AC 36 ms
19,292 KB
testcase_47 AC 36 ms
18,976 KB
testcase_48 AC 38 ms
19,572 KB
testcase_49 AC 38 ms
19,584 KB
testcase_50 AC 37 ms
19,456 KB
testcase_51 AC 41 ms
19,536 KB
testcase_52 AC 43 ms
19,412 KB
testcase_53 AC 43 ms
19,540 KB
testcase_54 AC 2 ms
5,248 KB
testcase_55 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> BIT

struct BIT {
    int n;
    vector<int> v; // use v[1..n]
    BIT(int n) : n(n), v(n+1) {}
    int size() const { return n; }
    int get(int i) const { return sum(i+1)-sum(i); }
    void set(int i, int x) { add(i,x-get(i)); }
    void add(int i, int x) {
        assert(0 <= i); assert(i < n);
        for (i++; i <= n; i += i&(-i)) v[i] += x;
    }
    int sum(int r) const { // [0,r)
        assert(0 <= r); assert(r <= n);
        int s = 0;
        for (int i = r; i > 0; i -= i&(-i)) s += v[i];
        return s;
    }
    int sum(int l, int r) const { // [l,r)
        return sum(r)-sum(l);
    }
};

// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> p(n); cin >> p;
    vector<int> pos(n);
    rep (i,n) pos[--p[i]] = i;

    vector<pair<int,int>> min_rng(n),max_rng(n),tmp(n);
    rep (i,n) min_rng[i] = max_rng[i] = mp(i,i+1);
    rep (i,n) {
        int x = pos[i];
        if (x+1 < n && p[x+1] < i) chmax(max_rng[x].snd, tmp[x+1].snd);
        if (x-1 >= 0 && p[x-1] < i) chmin(max_rng[x].fst, tmp[x-1].fst);
        tmp[max_rng[x].snd-1].fst = max_rng[x].fst;
        tmp[max_rng[x].fst].snd = max_rng[x].snd;
    }
    repR (i,n) {
        int x = pos[i];
        if (x+1 < n && p[x+1] > i) chmax(min_rng[x].snd, tmp[x+1].snd);
        if (x-1 >= 0 && p[x-1] > i) chmin(min_rng[x].fst, tmp[x-1].fst);
        tmp[min_rng[x].snd-1].fst = min_rng[x].fst;
        tmp[min_rng[x].fst].snd = min_rng[x].snd;
    }
    dump(min_rng);
    dump(max_rng);

    vector<vector<int>> wmin(n+1),wmax(n+1);
    rep (i,n) {
        wmin[min_rng[i].snd].eb(i);
        wmax[max_rng[i].snd].eb(i);
    }

    BIT bit_min(n), bit_max(n);
    int cnt = 0;
    rep (i,n) {
        dump(i);
        dump(bit_min.sum(max_rng[i].fst,i));
        cnt += bit_min.sum(max_rng[i].fst,i);
        bit_min.add(i,+1);
        for (int idx : wmin[i+1]) {
            bit_min.add(idx,-1);
        }

        dump(bit_max.sum(min_rng[i].fst,i));
        cnt += bit_max.sum(min_rng[i].fst,i);
        bit_max.add(i,+1);
        for (int idx : wmax[i+1]) {
            bit_max.add(idx,-1);
        }
    }

    cout << cnt << endl;

}
0