結果
問題 | No.1965 Heavier |
ユーザー |
![]() |
提出日時 | 2022-06-03 23:17:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 154 ms / 2,000 ms |
コード長 | 15,297 bytes |
コンパイル時間 | 1,667 ms |
コンパイル使用メモリ | 141,660 KB |
最終ジャッジ日時 | 2025-01-29 18:00:18 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define ISIZE(x) ((int)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// tuple 出力template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {if constexpr (N < std::tuple_size_v<tuple<Args...>>) {os << get<N>(a);if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {os << ' ';} else if constexpr (end_line) {os << '\n';}return operator<<<N + 1, end_line>(os, a);}return os;}template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }void pprint() { cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail) > 0) cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifndef MYLOCAL#undef DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \assert((cin >> __VA_ARGS__));template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]--;}template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]++;}/* #endregion */// #include <atcoder/all>// using namespace atcoder;/* #region SegTree */template <typename T> // T: 要素struct SegmentTree {using F = function<T(T, T)>; // 要素と要素をマージする関数.max とか.ll n; // 木のノード数ll nn; // 外から見た要素数F f; // 区間クエリで使う演算,結合法則を満たす演算.区間最大値のクエリを投げたいなら max 演算.T ti; // 値配列の初期値.演算 f に関する単位元.区間最大値なら単位元は 0. (a>0 なら max(a,0)=max(0,a)=a)vc<T> dat; // 1-indexed 値配列 (index は木の根から順に 1 | 2 3 | 4 5 6 7 | 8 9 10 11 12 13 14 15 | ...)// コンストラクタ.SegmentTree() {}// コンストラクタ.SegmentTree(F f, T ti) : f(f), ti(ti) {}// 指定要素数のセグメント木を初期化するvoid init(ll n_) {nn = n_;n = 1;while (n < n_) n <<= 1;dat.assign(n << 1, ti);}// ベクトルからセグメント木を構築するvoid build(const vc<T> &v) {ll n_ = v.size();init(n_);REP(i, 0, n_) dat[n + i] = v[i];REPR(i, n - 1, 1) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);}// インデックス k の要素の値を x にする.void set_val(ll k, T x) {dat[k += n] = x;while (k >>= 1) dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]); // 上へ登って更新していく}// インデックス k の要素の値を取得する.T get_val(ll k) { return dat[k + n]; }// 半開区間 [a, b) に対するクエリを実行するT query(ll a, ll b) {if (a >= b) return ti;// assert(a<b)T vl = ti, vr = ti;for (ll l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {if (l & 1) vl = f(vl, dat[l++]);if (r & 1) vr = f(dat[--r], vr);}return f(vl, vr);}// セグメント木上の二分探索template <typename C> int lower_bound_right(ll st, C &check, T &acc, ll k, ll l, ll r) {if (l + 1 == r) {acc = f(acc, dat[k]);return check(acc) ? k - n : -1;}ll m = (l + r) >> 1;if (m <= st) return lower_bound_right(st, check, acc, (k << 1) | 1, m, r);if (st <= l && !check(f(acc, dat[k]))) {acc = f(acc, dat[k]);return -1;}ll vl = lower_bound_right(st, check, acc, (k << 1) | 0, l, m);if (~vl) return vl;return lower_bound_right(st, check, acc, (k << 1) | 1, m, r);}// セグメント木上の二分探索.check(query(st, idx+1)) が真となる idx を返す.// ここで query(st, idx+1) は閉区間 [st, idx] に対するクエリである.// 戻り値 idx は閉区間 [st, idx] の 右側であることに注意(半開区間ではない).// 左端固定で右端を探す.template <typename C> int lower_bound_right(ll st, C &check) {T acc = ti;return lower_bound_right(st, check, acc, 1, 0, n);}// // セグメント木上の二分探索.// // @param l 区間左端// // @param check 条件// // @return check(query(l,r)) が真となる最大の r(半開区間であることに注意).// int max_right(int l, const function<bool(T)> &check) {// assert(0 <= l && l <= nn);// assert(check(ti));// if (l == nn) return nn;// l += n;// T sm = ti;// do {// while (l % 2 == 0) l >>= 1;// if (!check(f(sm, dat[l]))) {// while (l < n) {// l = (2 * l);// if (check(f(sm, dat[l]))) {// sm = f(sm, dat[l]);// l++;// }// }// return l - n;// }// sm = f(sm, dat[l]);// l++;// } while ((l & -l) != l);// return nn;// }// セグメント木上の二分探索.// 右端 r 固定で左端 l を探す.区間 [l, r) に対するクエリ結果が評価される.// @param r 区間右端(半開区間であることに注意)// @param check 条件// @return check(query(l,r)) が真となる最小の l(半開区間であることに注意).int min_left(int r, const function<bool(T)> &check) {assert(0 <= r && r <= nn);assert(check(ti));if (r == 0) return 0;r += n;T sm = ti;do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!check(f(dat[r], sm))) {while (r < n) {r = (2 * r + 1);if (check(f(dat[r], sm))) {sm = f(dat[r], sm);r--;}}return r + 1 - n;}sm = f(dat[r], sm);} while ((r & -r) != r);return 0;}// セグ木の中身を標準出力する.void _dump() {REP(k, 0, nn) {T val = dat[k + n];cout << val << (k == nn - 1 ? '\n' : ' ');}}};/* #endregion */// Problemvoid solve() {VAR(ll, n);vll a(n), b(n);cin >> a, b;auto f = [](ll a, ll b) { return min(a, b); };SegmentTree<ll> seg_minus(f, INF);SegmentTree<ll> seg_plus(f, INF);vll data_minus(n), data_plus(n);REP(i, 0, n) {data_minus[i] = a[i] - b[i];data_plus[i] = a[i] + b[i];}seg_minus.build(data_minus);seg_plus.build(data_plus);vll R(n, n);REP(l, 0, n - 1) {auto check0 = [&](ll acc) -> bool { return acc <= a[l] - b[l]; };auto check1 = [&](ll acc) -> bool { return acc <= a[l] + b[l]; };ll r0 = seg_minus.lower_bound_right(l + 1, check0);ll r1 = seg_plus.lower_bound_right(l + 1, check1);if (r0 == -1) r0 = n;if (r1 == -1) r1 = n;ll r = min(r0, r1);// dump(l, r0, r1, r);// ans += (r - 1 - l);R[l] = r;}dump(R);SegmentTree<ll> seg(f, INF);seg.build(R);ll ans = 0;REP(i, 0, n - 1) {ll r = R[i];ll rr = seg.query(i, r);dump(i, r, rr);ans += (rr - 1 - i);}pprint(ans);}// entry pointint main() {solve();return 0;}