#include<iostream> #include<algorithm> using namespace std; long long A[500005]; long long pref[500005]; const int i0 = 1 << 19; const long long inf = 2LL * 1000LL * 1000LL; int n; int _time = 0; struct four { long long sum, upd_d, upd_t, h, d, t; }; struct tree { four v[2 * i0]; void ins(int a, int b, int beg, int end, int i, long long h, long long d, long long t, long long h1, long long d1, long long t1) { if (a <= beg and end <= b) { v[i].sum = 1ll * (end - beg + 1) * h; v[i].upd_t = v[i].t = t; v[i].upd_d = v[i].d = d; v[i].h = h; return; } int mid = (beg + end)/2; if (v[i].t > t1) t1 = v[i].t, h1 = v[i].h, d1 = v[i].d; if (a <= mid) ins(a, b, beg, mid, 2 * i, h, d, t, h1, d1, t1); else { if (v[2 * i].upd_t < t1) { v[2 * i].sum = 1ll * (mid - beg + 1) * h1 + (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[2 * i].sum += (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[2 * i].upd_d); } v[2 * i].upd_t = t; v[2 * i].upd_d = d; if (t1 > v[2 * i].t) { v[2 * i].t = t1; v[2 * i].h = h1; v[2 * i].d = d1; } } if (b > mid) ins(a, b, mid + 1, end, 2 * i + 1, h, d, t, h1, d1, t1); else { if (v[2 * i + 1].upd_t < t1) { v[2 * i + 1].sum = 1ll * (end - mid) * h1 + (pref[end] - pref[mid]) * (d - d1); } else { v[2 * i + 1].sum += (pref[end] - pref[mid]) * (d - v[2 * i + 1].upd_d); } v[2 * i + 1].upd_t = t; v[2 * i + 1].upd_d = d; if (t1 > v[2 * i + 1].t) { v[2 * i + 1].t = t1; v[2 * i + 1].h = h1; v[2 * i + 1].d = d1; } } v[i].h = v[i].d = v[i].t = 0; v[i].upd_t = t; v[i].upd_d = d; v[i].sum = v[2 * i].sum + v[2 * i + 1].sum; } void ins(int a, int b, long long h, long long d) { ins(a, b, 0, i0 - 1, 1, h, d, ++_time, 0, 0, 0); } long long sum(int a, int b, int beg, int end, int i, long long d, long long t, long long h1, long long d1, long long t1) { if (a <= beg and end <= b) { //if (beg == 3 and end == 3) cout << t1 << "\n"; if (v[i].upd_t < t1) { v[i].sum = 1ll * (end - beg + 1) * h1 + (pref[end] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[i].sum += (pref[end] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[i].upd_d); } if (t1 > v[i].t) { v[i].h = h1; v[i].t = t1; v[i].d = d1; } v[i].upd_t = t; v[i].upd_d = d; return v[i].sum; } int mid = (beg + end)/2; long long s = 0; if (v[i].t > t1) t1 = v[i].t, h1 = v[i].h, d1 = v[i].d; //if (beg == 2 and end == 3) cout << "T: " << t1 << "\n"; if (a <= mid) s += sum(a, b, beg, mid, 2 * i, d, t, h1, d1, t1); else { if (v[2 * i].upd_t < t1) { v[2 * i].sum = 1ll * (mid - beg + 1) * h1 + (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[2 * i].sum += (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[2 * i].upd_d); } v[2 * i].upd_t = t; v[2 * i].upd_d = d; if (t1 > v[2 * i].t) { v[2 * i].t = t1; v[2 * i].h = h1; v[2 * i].d = d1; } } if (b > mid) s += sum(a, b, mid + 1, end, 2 * i + 1, d, t, h1, d1, t1); else { if (v[2 * i + 1].upd_t < t1) { v[2 * i + 1].sum = 1ll * (end - mid) * h1 + (pref[end] - pref[mid]) * (d - d1); } else { v[2 * i + 1].sum += (pref[end] - pref[mid]) * (d - v[2 * i + 1].upd_d); } v[2 * i + 1].upd_t = t; v[2 * i + 1].upd_d = d; if (t1 > v[2 * i + 1].t) { v[2 * i + 1].t = t1; v[2 * i + 1].h = h1; v[2 * i + 1].d = d1; } } v[i].upd_t = t; v[i].upd_d = d; v[i].sum = v[2 * i].sum + v[2 * i + 1].sum; v[i].h = v[i].t = v[i].d = 0; return s; } long long sum(int a, int b, long long d) { return sum(a, b, 0, i0 - 1, 1, d, ++_time, 0, 0, 0); } int bin_search(long long h, long long t) { int p = 0, q = n + 1; while (p < q - 1) { int m = (p + q)/2; if (sum(m, m, t) > h) q = m; else p = m; } return q; } }; tree T; int main() { ios_base::sync_with_stdio(0); int m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> A[i]; A[n + 1] = inf; sort(A + 1, A + n + 1); for (int i = 1; i <= n + 1; i++) pref[i] = pref[i - 1] + A[i]; while(m--) { long long h, t; cin >> t >> h; int pos = T.bin_search(h, t); //cout << "A: " << pos << "\n"; long long s = 0; s = T.sum(pos, n, t); //cout << "B: " << T.sum(2, 2, 2) << "\n"; T.ins(pos, n + 1, h, t); s -= T.sum(pos, n, t); //for (int i = 0; i <= 5; i++) cout << T.v[i0 + i].sum << " "; //cout << "\n"; //cout << "C: " << T.v[i0/2 + 1].h << "\n"; //cout << "D: " << T.sum(3, 3, t) << "\n"; cout << s << "\n"; } return 0; }
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 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 | #include<iostream> #include<algorithm> using namespace std; long long A[500005]; long long pref[500005]; const int i0 = 1 << 19; const long long inf = 2LL * 1000LL * 1000LL; int n; int _time = 0; struct four { long long sum, upd_d, upd_t, h, d, t; }; struct tree { four v[2 * i0]; void ins(int a, int b, int beg, int end, int i, long long h, long long d, long long t, long long h1, long long d1, long long t1) { if (a <= beg and end <= b) { v[i].sum = 1ll * (end - beg + 1) * h; v[i].upd_t = v[i].t = t; v[i].upd_d = v[i].d = d; v[i].h = h; return; } int mid = (beg + end)/2; if (v[i].t > t1) t1 = v[i].t, h1 = v[i].h, d1 = v[i].d; if (a <= mid) ins(a, b, beg, mid, 2 * i, h, d, t, h1, d1, t1); else { if (v[2 * i].upd_t < t1) { v[2 * i].sum = 1ll * (mid - beg + 1) * h1 + (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[2 * i].sum += (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[2 * i].upd_d); } v[2 * i].upd_t = t; v[2 * i].upd_d = d; if (t1 > v[2 * i].t) { v[2 * i].t = t1; v[2 * i].h = h1; v[2 * i].d = d1; } } if (b > mid) ins(a, b, mid + 1, end, 2 * i + 1, h, d, t, h1, d1, t1); else { if (v[2 * i + 1].upd_t < t1) { v[2 * i + 1].sum = 1ll * (end - mid) * h1 + (pref[end] - pref[mid]) * (d - d1); } else { v[2 * i + 1].sum += (pref[end] - pref[mid]) * (d - v[2 * i + 1].upd_d); } v[2 * i + 1].upd_t = t; v[2 * i + 1].upd_d = d; if (t1 > v[2 * i + 1].t) { v[2 * i + 1].t = t1; v[2 * i + 1].h = h1; v[2 * i + 1].d = d1; } } v[i].h = v[i].d = v[i].t = 0; v[i].upd_t = t; v[i].upd_d = d; v[i].sum = v[2 * i].sum + v[2 * i + 1].sum; } void ins(int a, int b, long long h, long long d) { ins(a, b, 0, i0 - 1, 1, h, d, ++_time, 0, 0, 0); } long long sum(int a, int b, int beg, int end, int i, long long d, long long t, long long h1, long long d1, long long t1) { if (a <= beg and end <= b) { //if (beg == 3 and end == 3) cout << t1 << "\n"; if (v[i].upd_t < t1) { v[i].sum = 1ll * (end - beg + 1) * h1 + (pref[end] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[i].sum += (pref[end] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[i].upd_d); } if (t1 > v[i].t) { v[i].h = h1; v[i].t = t1; v[i].d = d1; } v[i].upd_t = t; v[i].upd_d = d; return v[i].sum; } int mid = (beg + end)/2; long long s = 0; if (v[i].t > t1) t1 = v[i].t, h1 = v[i].h, d1 = v[i].d; //if (beg == 2 and end == 3) cout << "T: " << t1 << "\n"; if (a <= mid) s += sum(a, b, beg, mid, 2 * i, d, t, h1, d1, t1); else { if (v[2 * i].upd_t < t1) { v[2 * i].sum = 1ll * (mid - beg + 1) * h1 + (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - d1); } else { v[2 * i].sum += (pref[mid] - pref[beg > 0 ? beg - 1 : beg]) * (d - v[2 * i].upd_d); } v[2 * i].upd_t = t; v[2 * i].upd_d = d; if (t1 > v[2 * i].t) { v[2 * i].t = t1; v[2 * i].h = h1; v[2 * i].d = d1; } } if (b > mid) s += sum(a, b, mid + 1, end, 2 * i + 1, d, t, h1, d1, t1); else { if (v[2 * i + 1].upd_t < t1) { v[2 * i + 1].sum = 1ll * (end - mid) * h1 + (pref[end] - pref[mid]) * (d - d1); } else { v[2 * i + 1].sum += (pref[end] - pref[mid]) * (d - v[2 * i + 1].upd_d); } v[2 * i + 1].upd_t = t; v[2 * i + 1].upd_d = d; if (t1 > v[2 * i + 1].t) { v[2 * i + 1].t = t1; v[2 * i + 1].h = h1; v[2 * i + 1].d = d1; } } v[i].upd_t = t; v[i].upd_d = d; v[i].sum = v[2 * i].sum + v[2 * i + 1].sum; v[i].h = v[i].t = v[i].d = 0; return s; } long long sum(int a, int b, long long d) { return sum(a, b, 0, i0 - 1, 1, d, ++_time, 0, 0, 0); } int bin_search(long long h, long long t) { int p = 0, q = n + 1; while (p < q - 1) { int m = (p + q)/2; if (sum(m, m, t) > h) q = m; else p = m; } return q; } }; tree T; int main() { ios_base::sync_with_stdio(0); int m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> A[i]; A[n + 1] = inf; sort(A + 1, A + n + 1); for (int i = 1; i <= n + 1; i++) pref[i] = pref[i - 1] + A[i]; while(m--) { long long h, t; cin >> t >> h; int pos = T.bin_search(h, t); //cout << "A: " << pos << "\n"; long long s = 0; s = T.sum(pos, n, t); //cout << "B: " << T.sum(2, 2, 2) << "\n"; T.ins(pos, n + 1, h, t); s -= T.sum(pos, n, t); //for (int i = 0; i <= 5; i++) cout << T.v[i0 + i].sum << " "; //cout << "\n"; //cout << "C: " << T.v[i0/2 + 1].h << "\n"; //cout << "D: " << T.sum(3, 3, t) << "\n"; cout << s << "\n"; } return 0; } |