結果

問題 No.1031 いたずら好きなお姉ちゃん
ユーザー FF256grhyFF256grhy
提出日時 2020-09-18 03:34:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 88 ms / 3,500 ms
コード長 6,892 bytes
コンパイル時間 2,834 ms
コンパイル使用メモリ 222,208 KB
実行使用メモリ 9,468 KB
最終ジャッジ日時 2023-09-04 08:20:26
合計ジャッジ時間 8,624 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 4 ms
4,376 KB
testcase_04 AC 4 ms
4,376 KB
testcase_05 AC 4 ms
4,380 KB
testcase_06 AC 5 ms
4,380 KB
testcase_07 AC 4 ms
4,376 KB
testcase_08 AC 4 ms
4,380 KB
testcase_09 AC 4 ms
4,380 KB
testcase_10 AC 5 ms
4,376 KB
testcase_11 AC 62 ms
8,504 KB
testcase_12 AC 64 ms
8,616 KB
testcase_13 AC 71 ms
9,292 KB
testcase_14 AC 63 ms
8,716 KB
testcase_15 AC 77 ms
9,080 KB
testcase_16 AC 60 ms
8,800 KB
testcase_17 AC 67 ms
9,124 KB
testcase_18 AC 74 ms
9,200 KB
testcase_19 AC 70 ms
9,160 KB
testcase_20 AC 77 ms
9,420 KB
testcase_21 AC 66 ms
9,048 KB
testcase_22 AC 62 ms
8,656 KB
testcase_23 AC 64 ms
8,744 KB
testcase_24 AC 72 ms
9,124 KB
testcase_25 AC 83 ms
9,284 KB
testcase_26 AC 73 ms
9,220 KB
testcase_27 AC 64 ms
8,712 KB
testcase_28 AC 72 ms
9,412 KB
testcase_29 AC 75 ms
9,452 KB
testcase_30 AC 74 ms
9,296 KB
testcase_31 AC 79 ms
9,240 KB
testcase_32 AC 73 ms
9,460 KB
testcase_33 AC 76 ms
9,308 KB
testcase_34 AC 86 ms
9,436 KB
testcase_35 AC 81 ms
9,300 KB
testcase_36 AC 86 ms
9,312 KB
testcase_37 AC 85 ms
9,384 KB
testcase_38 AC 86 ms
9,232 KB
testcase_39 AC 79 ms
9,304 KB
testcase_40 AC 80 ms
9,248 KB
testcase_41 AC 82 ms
9,436 KB
testcase_42 AC 85 ms
9,412 KB
testcase_43 AC 80 ms
9,276 KB
testcase_44 AC 80 ms
9,408 KB
testcase_45 AC 84 ms
9,256 KB
testcase_46 AC 88 ms
9,300 KB
testcase_47 AC 78 ms
9,244 KB
testcase_48 AC 81 ms
9,468 KB
testcase_49 AC 84 ms
9,328 KB
testcase_50 AC 84 ms
9,376 KB
testcase_51 AC 87 ms
9,328 KB
testcase_52 AC 86 ms
9,464 KB
testcase_53 AC 87 ms
9,404 KB
testcase_54 AC 2 ms
4,380 KB
testcase_55 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(LL i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };
auto inIX = [](auto x, auto l, auto r) { return (l <= x && x <  r); };
auto inXI = [](auto x, auto l, auto r) { return (l <  x && x <= r); };
auto inXX = [](auto x, auto l, auto r) { return (l <  x && x <  r); };
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define RV(c) reverse(ALL(c))
#define SC static_cast
#define SI(c) SC<int>(c.size())
#define SL(c) SC<LL >(c.size())
#define RF(e, c) for(auto & e: c)
#define SF(c, ...) for(auto & [__VA_ARGS__]: c)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
array<string, 3> SEQ = { "", " ", "" };
// input elements (as a tuple)
template<typename U, int I> void in_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); }
template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; }
// input an array
template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; }
// input a (multi-dimensional) vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input multi-column (as a tuple of vector)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	A a; (* IS) >> a; get<I>(t).push_back(a); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
// output elements
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
// output a (multi-dimensional) vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout(T && v, A a, B ... b) {
	vout_(v, b ...); (* OS) << a << flush;
}

// ---- ----

template<typename T> class SegmentTree {
private:
	int n, s;
	vector<T> a;
	function<T(T &, T &)> f;
	T e;
	bool ok;
	void shift(int & p) {
		assert(inIX(p, 0, n));
		p += s;
	}
public:
	SegmentTree() { n = 0; }
	SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
	void init(int nn, function<T(T &, T &)> ff, T ee) {
		n = nn;
		f = ff;
		e = ee;
		s = 1;
		while(s < n) { s *= 2; }
		a = vector<T>(2 * s, e);
		ok = true;
	}
	void apply(int p, function<void(T &)> g) {
		shift(p);
		g(a[p]);
		while(p > 1) {
			p /= 2;
			a[p] = f(a[2 * p], a[2 * p + 1]);
		}
	}
	T fold_IX(int l, int r) {
		assert(ok);
		assert(inII(l, 0, n)); l += s;
		assert(inII(r, 0, n)); r += s; r--;
		T x = e, y = e;
		while(l <= r) {
			if(l % 2 == 1) { x = f(x, a[l]); l++; }
			if(r % 2 == 0) { y = f(a[r], y); r--; }
			l /= 2;
			r /= 2;
		}
		return f(x, y);
	}
	T fold_II(int l, int r) { return fold_IX(l + 0, r + 1); }
	T fold_XI(int l, int r) { return fold_IX(l + 1, r + 1); }
	T fold_XX(int l, int r) { return fold_IX(l + 1, r + 0); }
	const T & operator[](int p) {
		shift(p);
		return a[p];
	}
	T & ref(int p) {
		shift(p);
		ok = false;
		return a[p];
	}
	void calc() {
		dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
		ok = true;
	}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }

// ----

template<typename T> vector<int> min_left(vector<T> const & v, bool is_strict) {
	int n = SI(v);
	vector<int> r(n);
	stack<pair<T, int>> s;
	inc(i, n) {
		until(s.empty() || (is_strict && s.top().FI <= v[i]) || s.top().FI < v[i]) { s.pop(); }
		r[i] = (s.empty() ? 0 : s.top().SE + 1);
		s.push({ v[i], i });
	}
	return r;
}

// [ min_left, min_right, max_left, max_right ]
template<typename T> array<vector<T>, 4> range_min_max(vector<T> const & v_, bool is_strict = false) {
	auto v = v_;
	int n = SI(v);
	array<vector<T>, 4> ans = { vector<int>(n), vector<int>(n), vector<int>(n), vector<int>(n) };
	inc(k, 2) {
		auto L = min_left(v, is_strict); RV(v);
		auto R = min_left(v, is_strict); RV(v);
		inc(i, n) { ans[2*k + 0][i] = L[i]; }
		inc(i, n) { ans[2*k + 1][i] = n - R[n - 1 - i]; }
		RF(e, v) { e *= -1; }
	}
	return ans;
}

int main() {
	auto f = [](auto a, auto b) -> LL {
		int n = SI(a);
		vector<pair<int, int>> v;
		v.EB(n + 1, -1);
		inc(i, n) { v.EB(b[i], i); }
		sort(RALL(v));
		
		SegmentTree<int> st(n, OP(A + B), 0);
		inc(i, n) { st.ref(i) = 1; }
		st.calc();
		
		LL c = 0;
		inc(i, n) {
			while(v.BA.FI <= i) { st.apply(v.BA.SE, AP(A--)); v.pop_back(); }
			c += st.fold_IX(a[i], i);
		}
		return c;
	};
	
	auto [n] = in<int>();
	auto p = vin<int>(n);
	
	auto [minL, minR, maxL, maxR] = range_min_max(p);
	out(f(minL, maxR) + f(maxL, minR));
}
0