結果

問題 No.1965 Heavier
ユーザー ecotteaecottea
提出日時 2022-06-03 22:34:24
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 115 ms / 2,000 ms
コード長 6,764 bytes
コンパイル時間 4,575 ms
コンパイル使用メモリ 232,612 KB
実行使用メモリ 67,404 KB
最終ジャッジ日時 2024-09-21 03:01:18
合計ジャッジ時間 8,088 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi dx4 = { 1, 0, -1, 0 }; // 4
const vi dy4 = { 0, 1, 0, -1 };
const vi dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }; // 8
const vi dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 };
const int INF = 1001001001; const ll INFL = 4004004004004004004LL;
const double EPS = 1e-12; // 調
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define distance (int)distance
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
#define popcount (int)__builtin_popcount
#define popcountll (int)__builtin_popcountll
#define lsb __builtin_ctz
#define lsbll __builtin_ctzll
#define msb(n) (31 - __builtin_clz(n))
#define msbll(n) (63 - __builtin_clzll(n))
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define input_from_file(f)
#define output_to_file(f)
#endif
#endif //
//--------------AtCoder --------------
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
//----------------------------------------
//Sparse Table
/*
* Sparse_table<S, op, o>(vS a) : O(n log n)
* a[0..n)
* <S, op, o>
*
* S sum(int l, int r) : O(1)
* Σa[l..r) o()
*/
template <class S, S(*op)(S, S), S(*o)()>
struct Sparse_table {
// : https://tookunn.hatenablog.com/entry/2016/07/13/211148
// verify : https://codeforces.com/contest/689/problem/D
int n, m;
// acc[j][i] : Σa[i..i+2^j)
vector<vector<S>> acc;
//
Sparse_table() : n(0), m(0) {}
Sparse_table(const vector<S>& a) : n(sz(a)), m(msb(n) + 1), acc(m, vector<S>(n)) {
rep(i, n) acc[0][i] = a[i];
repi(j, 1, m - 1) {
int d = 1 << (j - 1);
rep(i, n - d) {
acc[j][i] = op(acc[j - 1][i], acc[j - 1][i + d]);
}
}
}
// Σa[l..r)
S sum(int l, int r) {
if (l >= r) return o();
int j = msb(r - l);
return op(acc[j][l], acc[j][r - (1 << j)]);
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Sparse_table& st) {
rep(j, st.m) {
rep(i, st.n) os << st.acc[j][i] << " ";
os << "\n";
}
return os;
}
#endif
};
//max
/* verify: https://atcoder.jp/contests/abl/tasks/abl_d */
using S503 = ll;
S503 op503(S503 a, S503 b) { return max(a, b); }
S503 o503() { return -INFL; }
#define Max_cmonoid S503, op503, o503
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
vl a(n), b(n);
cin >> a >> b;
vl s(n), d(n);
rep(i, n) {
s[i] = a[i] + b[i];
d[i] = a[i] - b[i];
}
dump(s); dump(d);
Sparse_table<Max_cmonoid> S(s), D(d);
ll res = 0;
// l, r : a[l..r)
int l = 0, r = 0;
//
while (r < n) {
if (S.sum(l, r) < s[r] && D.sum(l, r) < d[r]) {
// 1
r++;
// r
// l r l
// r r - l
res += r - l;
}
else {
// 1
l++;
}
}
cout << res - n << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0