結果

問題 No.2169 To Arithmetic
ユーザー 👑 hitonanodehitonanode
提出日時 2023-01-02 22:41:49
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,956 ms / 2,000 ms
コード長 10,157 bytes
コンパイル時間 2,916 ms
コンパイル使用メモリ 201,252 KB
実行使用メモリ 117,176 KB
最終ジャッジ日時 2024-05-05 06:44:43
合計ジャッジ時間 27,325 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 10 ms
5,376 KB
testcase_05 AC 9 ms
5,376 KB
testcase_06 AC 10 ms
5,376 KB
testcase_07 AC 11 ms
5,376 KB
testcase_08 AC 7 ms
5,376 KB
testcase_09 AC 400 ms
56,704 KB
testcase_10 AC 633 ms
18,992 KB
testcase_11 AC 860 ms
60,872 KB
testcase_12 AC 348 ms
6,656 KB
testcase_13 AC 1,107 ms
59,660 KB
testcase_14 AC 537 ms
32,000 KB
testcase_15 AC 417 ms
7,024 KB
testcase_16 AC 590 ms
32,584 KB
testcase_17 AC 1,175 ms
112,876 KB
testcase_18 AC 548 ms
57,820 KB
testcase_19 AC 1,956 ms
117,172 KB
testcase_20 AC 1,894 ms
117,172 KB
testcase_21 AC 1,891 ms
117,120 KB
testcase_22 AC 1,911 ms
117,044 KB
testcase_23 AC 1,911 ms
117,044 KB
testcase_24 AC 1,676 ms
117,172 KB
testcase_25 AC 1,058 ms
59,172 KB
testcase_26 AC 1,687 ms
117,016 KB
testcase_27 AC 1,600 ms
117,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/lazysegtree>

struct S {
    bool is_empty;
    lint d = 0;
    __int128 add0 = 0, add1 = 0;
    lint dleft = 0;
    lint add0left = 0, add1left = 0;
    S(lint a, lint b, lint c) : is_empty(false), d(a), add0(b), add1(c), dleft(a), add0left(b), add1left(c) {}
    __int128 get() const noexcept {
        if (is_empty) return 0;
        return add0 + add1 * d;
    }
    __int128 rightget() const noexcept { return get(); }
    lint leftget() const noexcept {
        if (is_empty) return 0;
        return add0left + add1left * dleft;
    }
};

S op(S l, S r) {
    if (l.is_empty) return r;
    if (r.is_empty) return l;
    r.dleft = l.dleft;
    r.add0left = l.add0left;
    r.add1left = l.add1left;
    return r;
}

S e() {
    S ret{0, 0, 0};
    ret.is_empty = true;
    return ret;
}

using F = pair<bool, plint>;
S mapping(F f, S x) {
    if (x.is_empty) return x;
    if (f.first) x.add0 = x.add1 = x.add0left = x.add1left = 0;

    x.add0 += f.second.first;
    x.add1 += f.second.second;
    x.add0left += f.second.first;
    x.add1left += f.second.second;
    return x;
}
F composition(F f, F g) {
    if (f.first) return f;
    if (g.first) return {true, f.second + g.second};
    return make_pair(false, f.second + g.second);
}
F id() { return make_pair(false, plint(0, 0)); }


int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N), D(Q);
    cin >> A >> D;

    vector<lint> diffs(N - 1);
    REP(i, N - 1) diffs.at(i) = A.at(i + 1) - A.at(i);

    dbg(make_tuple(N, Q, A, D, diffs));

    vector<S> init;

    auto sorted_d = sort_unique(D);
    sorted_d.insert(sorted_d.begin(), -1.01e9);
    sorted_d.push_back(1.01e9);
    dbg(sorted_d);
    for (int d : sorted_d) init.push_back(S{d, 0, 0});

    // atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> plus_cost_tree(init);
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> minus_cost_tree(init);
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree(init);
    // atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree_inv(init);

    for (const int d : diffs) {
        int i = arglb(sorted_d, d);
        // plus_cost_tree.apply(i, sorted_d.size(), F{false, make_pair(-d, 1)});
        minus_cost_tree.apply(0, i, F{false, make_pair(d, -1)});

        tree.apply(0, sorted_d.size(), F{false, make_pair(-d, 1)});
        const int r = tree.max_right(0, [&](S x) { return x.rightget() <= 0; });
        tree.apply(0, r, F{true, make_pair(0, 0)});

        // tree_inv.apply(0, D.size(), F{false, make_pair(d, -1)});

        // vector<lint> ret;
        // ret.clear();
        // REP(i, D.size()) ret.push_back(tree_inv.get(i).get());
        // dbg(make_tuple(d, ret, tree_inv.all_prod().rightget()));

        // const int r_inv = tree_inv.max_right(0, [&](S x) { return x.rightget() >= 0; });
        // tree_inv.apply(0, r_inv, F{true, make_pair(0, 0)});
    }

    for (auto d : D) {
        const int i = arglb(sorted_d, d);
        // const auto f0 = plus_cost_tree.get(i).get();
        const lint f1 = minus_cost_tree.get(i).get();
        const lint f2 = tree.get(i).get();
        // const auto f3 = abs(tree_inv.get(i).get());
        dbg(make_tuple(f1, f2));
        cout << (f1 + f2) << endl;
    }
}
0