1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160
| #include <algorithm> #include <climits> #include <cstdio> #include <iostream> #include <memory>
using ll = long long;
constexpr int MAX_N = 1000050; constexpr int N = 1000000; constexpr ll INF = LLONG_MAX >> 4;
int a[MAX_N], b[MAX_N]; struct Q { int p; int k; int i; } q[MAX_N];
class SegTree { public: struct L { ll k; ll b = INF; L() = default; L(ll k, ll b) { this->k = k, this->b = b; }
ll operator()(const ll& x) { return k * x + b; } } tree[MAX_N << 3];
SegTree() = default; ~SegTree() = default;
void mod(int x, int l, int r, L mv);
ll query(int x, int l, int r, const ll& qk); };
ll ans[MAX_N];
template <typename T> T read();
template <typename T> void read(T& t);
template <typename T, typename... Args> void read(T& t, Args&... rest);
int main() { std::ios::sync_with_stdio(false);
int n, m; read(n, m); for (int i = 1; i <= n; i++) { read(a[i], b[i]); } for (int i = 1; i <= m; i++) { read(q[i].p, q[i].k); q[i].i = i; } std::sort(q + 1, q + m + 1, [](const Q& x, const Q& y) { return x.p < y.p; });
{ std::unique_ptr<SegTree> segTree(new SegTree()); ll sa{}, sb{}; int i{1}; for (int j = 1; j <= m; j++) { while (i <= n and i <= q[j].p) { segTree->mod(1, -N, N, {-sb, sa}); sa += a[i]; sb += b[i]; i++; } ans[q[j].i] += sa - sb * q[j].k - segTree->query(1, -N, N, q[j].k); } } { std::unique_ptr<SegTree> segTree(new SegTree()); ll sa{}, sb{}; int i{n}; for (int j = m; j >= 1; j--) { while (i >= 1 and i > q[j].p) { segTree->mod(1, -N, N, {-sb, sa}); sa += a[i]; sb += b[i]; i--; } ans[q[j].i] += std::max( 0ll, sa - sb * q[j].k - segTree->query(1, -N, N, q[j].k)); } }
for (int i = 1; i <= m; i++) { std::cout << ans[i] << '\n'; }
return 0; }
#define lc (x << 1) #define rc ((x << 1) | 1)
void SegTree::mod(int x, int l, int r, L mv) { const auto mid = (l + r) >> 1; if (tree[x](mid) >= mv(mid)) { std::swap(tree[x], mv); } if (l == r) { return; } if (tree[x](l) >= mv(l)) { mod(lc, l, mid, mv); } else if (tree[x](r) >= mv(r)) { mod(rc, mid + 1, r, mv); } }
ll SegTree::query(int x, int l, int r, const ll& qk) { if (l == r) { return tree[x](qk); } const auto mid = (l + r) >> 1; if (qk <= mid) { return std::min(tree[x](qk), query(lc, l, mid, qk)); } else { return std::min(tree[x](qk), query(rc, mid + 1, r, qk)); } }
#undef lc #undef rc
template <typename T> T read() { T x = 0, f = 1; char ch = getchar_unlocked(); while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar_unlocked(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar_unlocked(); } return x * f; }
template <typename T> void read(T& t) { t = read<T>(); }
template <typename T, typename... Args> void read(T& t, Args&... rest) { t = read<T>(); read(rest...); }
|