結果

問題 No.1435 Mmm......
ユーザー heno239heno239
提出日時 2021-03-19 22:28:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 582 ms / 2,000 ms
コード長 4,931 bytes
コンパイル時間 1,854 ms
コンパイル使用メモリ 147,076 KB
実行使用メモリ 269,696 KB
最終ジャッジ日時 2024-11-18 23:16:09
合計ジャッジ時間 15,745 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 204 ms
265,472 KB
testcase_01 AC 204 ms
265,668 KB
testcase_02 AC 203 ms
265,472 KB
testcase_03 AC 202 ms
265,600 KB
testcase_04 AC 202 ms
265,672 KB
testcase_05 AC 201 ms
265,600 KB
testcase_06 AC 437 ms
268,544 KB
testcase_07 AC 499 ms
269,036 KB
testcase_08 AC 541 ms
269,396 KB
testcase_09 AC 517 ms
269,212 KB
testcase_10 AC 477 ms
268,992 KB
testcase_11 AC 466 ms
268,856 KB
testcase_12 AC 449 ms
268,812 KB
testcase_13 AC 445 ms
268,548 KB
testcase_14 AC 369 ms
267,392 KB
testcase_15 AC 556 ms
269,548 KB
testcase_16 AC 492 ms
269,032 KB
testcase_17 AC 391 ms
267,320 KB
testcase_18 AC 561 ms
269,564 KB
testcase_19 AC 462 ms
268,712 KB
testcase_20 AC 526 ms
269,236 KB
testcase_21 AC 514 ms
269,568 KB
testcase_22 AC 508 ms
269,692 KB
testcase_23 AC 577 ms
269,568 KB
testcase_24 AC 577 ms
269,696 KB
testcase_25 AC 582 ms
269,572 KB
testcase_26 AC 580 ms
269,696 KB
testcase_27 AC 580 ms
269,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 24;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

int calc(P a, P b) {
	return min({ a.first + b.first,a.first + a.second,b.first + b.second });
}
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	ll ans = 0;
	function<void(int, int)> yaru = [&](int l, int r) {
		if (l + 1 == r)return;
		int m = (l + r) / 2;
		yaru(l, m); yaru(m, r);
		vector<P> vl, vr;
		vector<int> mal, mar;
		int ma = -1;
		P mi = { mod,mod };
		for (int i = m - 1; i >= l; i--) {
			ma = max(ma, a[i]);
			if (a[i] < mi.first) {
				mi.second = mi.first;
				mi.first = a[i];
			}
			else if (a[i] < mi.second) {
				mi.second = a[i];
			}
			mal.push_back(ma);
			vl.push_back(mi);
		}

		ma = -1;
		mi = { mod,mod };
		for (int i = m; i < r; i++) {
			ma = max(ma, a[i]);
			if (a[i] < mi.first) {
				mi.second = mi.first;
				mi.first = a[i];
			}
			else if (a[i] < mi.second) {
				mi.second = a[i];
			}
			mar.push_back(ma);
			vr.push_back(mi);
		}
		rep(i, vr.size()) {
			int le = -1, ri = vl.size();
			while (ri - le > 1) {
				int mid = (le + ri) / 2;
				if (mal[mid] > mar[i]) {
					ri = mid;
				}
				else {
					le = mid;
				}
			}
			//[0,ri)
			le = -1;
			while (ri - le > 1) {
				int mid = (le + ri) / 2;
				int val = calc(vl[mid], vr[i]);
				if (val >= mar[i]) {
					le = mid;
				}
				else {
					ri = mid;
				}
			}
			ans += le + 1;
		}
		swap(vl, vr);
		swap(mal, mar);
		rep(i, vr.size()) {
			int le = -1, ri = vl.size();
			while (ri - le > 1) {
				int mid = (le + ri) / 2;
				if (mal[mid] >= mar[i]) {
					ri = mid;
				}
				else {
					le = mid;
				}
			}
			//[0,ri)
			le = -1;
			while (ri - le > 1) {
				int mid = (le + ri) / 2;
				int val = calc(vl[mid], vr[i]);
				if (val >= mar[i]) {
					le = mid;
				}
				else {
					ri = mid;
				}
			}
			ans += le + 1;
		}
	};
	yaru(0, n);
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0