//Pawel Kura #define _CRT_SECURE_NO_WARNINGS #ifdef __MINGW32__ #define LLF "%I64d" float _hypot(float a, float b) {return 0.0;} #else #define LLF "%lld" #endif #include <cstdio> #include <vector> #include <algorithm> using namespace std; const int MAXN = 500 * 1000; int a[MAXN]; int n, m; long long sumA; long long prefSum[MAXN + 1]; struct BestTreeEver { struct Node { long long set, add, sum; bool cur; }; vector<Node> tree; int size; void init(int n) { size = 1; while (size < n) size *= 2; tree.resize(2 * size); tree[1].cur = true; } inline long long _sum(int beg, int end) { if (beg >= n) return 0; return prefSum[min(end + 1, n)] - prefSum[beg]; } void _push(int a, int b, int k, int beg, int end) { if (a <= beg && end <= b) return; if (tree[k].cur) { for (int c = 0; c < 2; c++) { tree[2 * k + c] = tree[k]; } tree[2 * k].sum = tree[k].set * (end - beg + 1) / 2 + tree[k].add * _sum(beg, (beg + end) / 2); tree[2 * k + 1].sum = tree[k].set * (end - beg + 1) / 2 + tree[k].add * _sum(1 + (beg + end) / 2, end); tree[k].cur = false; tree[k].add = 0; tree[k].set = 0; } else { for (int c = 0; c < 2; c++) { tree[2 * k + c].add += tree[k].add; } tree[2 * k].sum += tree[k].add * _sum(beg, (beg+end)/2); tree[2 * k + 1].sum += tree[k].add * _sum(1+(beg+end)/2, end); // tree[2 * k].sum = tree[2 * k].set * (end - beg + 1) / 2 + tree[2 * k].add * _sum(beg, (beg + end) / 2); // tree[2 * k + 1].sum = tree[2 * k + 1].set * (end - beg + 1) / 2 + tree[2 * k + 1].add * _sum(1 + (beg + end) / 2, end); tree[k].add = 0; } if (a <= (beg + end) / 2) _push(a, b, 2 * k, beg, (beg + end) / 2); if (b >(beg + end) / 2) _push(a, b, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) { tree[k].sum += tree[2 * k + c].sum; } } void _set(int a, int b, long long v, int k, int beg, int end) { if (a <= beg && end <= b) { tree[k].set = v; tree[k].add = 0; tree[k].cur = true; tree[k].sum = v * (end - beg + 1); return; } if (a <= (beg + end) / 2) _set(a, b, v, 2 * k, beg, (beg + end) / 2); if (b > (beg + end) / 2) _set(a, b, v, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) tree[k].sum += tree[2 * k + c].sum; } void _add(int a, int b, long long v, int k, int beg, int end) { if ((a <= beg && end <= b) || tree[k].cur) { tree[k].add += v; if (tree[k].cur) tree[k].sum = tree[k].set * (end - beg + 1) + tree[k].add * _sum(beg, end); else tree[k].sum += v * _sum(beg, end); return; } if (a <= (beg + end) / 2) _add(a, b, v, 2 * k, beg, (beg + end) / 2); if (b > (beg + end) / 2) _add(a, b, v, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) tree[k].sum += tree[2 * k + c].sum; } void set(int a, int b, long long v) { if (a > b) return; _push(a, b, 1, 0, size - 1); _set(a, b, v, 1, 0, size - 1); } void add(int a, int b, long long v) { if (a > b) return; _push(a, b, 1, 0, size - 1); _add(a, b, v, 1, 0, size - 1); } long long getSum() { return tree[1].sum; } long long getValue(int a) { long long speed = _sum(a, a); a += size; long long result = 0; while (a > 0) { if (tree[a].cur) result = tree[a].set; result += speed * tree[a].add; a /= 2; } return result; } }; BestTreeEver lol; inline bool check(int s, long long h) { return lol.getValue(s) > h; } int main() { scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } sort(a, a + n); prefSum[0] = 0; for (int i = 0; i < n; i++) { prefSum[i + 1] = prefSum[i] + a[i]; sumA += a[i]; } lol.init(n); long long lastT = 0; long long s = 0, ns = 0, res = 0; for (int i = 1; i <= m; i++) { long long t, h; scanf(LLF " " LLF, &t, &h); lol.add(0, n - 1, t - lastT); int p = 0; int q = n; while (q - p > 1) { int s = p + (q - p) / 2; if (check(s, h)) q = s; else p = s; } if (!check(p, h)) p++; s = lol.getSum(); lol.set(p, n - 1, h); ns = lol.getSum(); res = s - ns; printf(LLF "\n", res); lastT = t; } 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 | //Pawel Kura #define _CRT_SECURE_NO_WARNINGS #ifdef __MINGW32__ #define LLF "%I64d" float _hypot(float a, float b) {return 0.0;} #else #define LLF "%lld" #endif #include <cstdio> #include <vector> #include <algorithm> using namespace std; const int MAXN = 500 * 1000; int a[MAXN]; int n, m; long long sumA; long long prefSum[MAXN + 1]; struct BestTreeEver { struct Node { long long set, add, sum; bool cur; }; vector<Node> tree; int size; void init(int n) { size = 1; while (size < n) size *= 2; tree.resize(2 * size); tree[1].cur = true; } inline long long _sum(int beg, int end) { if (beg >= n) return 0; return prefSum[min(end + 1, n)] - prefSum[beg]; } void _push(int a, int b, int k, int beg, int end) { if (a <= beg && end <= b) return; if (tree[k].cur) { for (int c = 0; c < 2; c++) { tree[2 * k + c] = tree[k]; } tree[2 * k].sum = tree[k].set * (end - beg + 1) / 2 + tree[k].add * _sum(beg, (beg + end) / 2); tree[2 * k + 1].sum = tree[k].set * (end - beg + 1) / 2 + tree[k].add * _sum(1 + (beg + end) / 2, end); tree[k].cur = false; tree[k].add = 0; tree[k].set = 0; } else { for (int c = 0; c < 2; c++) { tree[2 * k + c].add += tree[k].add; } tree[2 * k].sum += tree[k].add * _sum(beg, (beg+end)/2); tree[2 * k + 1].sum += tree[k].add * _sum(1+(beg+end)/2, end); // tree[2 * k].sum = tree[2 * k].set * (end - beg + 1) / 2 + tree[2 * k].add * _sum(beg, (beg + end) / 2); // tree[2 * k + 1].sum = tree[2 * k + 1].set * (end - beg + 1) / 2 + tree[2 * k + 1].add * _sum(1 + (beg + end) / 2, end); tree[k].add = 0; } if (a <= (beg + end) / 2) _push(a, b, 2 * k, beg, (beg + end) / 2); if (b >(beg + end) / 2) _push(a, b, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) { tree[k].sum += tree[2 * k + c].sum; } } void _set(int a, int b, long long v, int k, int beg, int end) { if (a <= beg && end <= b) { tree[k].set = v; tree[k].add = 0; tree[k].cur = true; tree[k].sum = v * (end - beg + 1); return; } if (a <= (beg + end) / 2) _set(a, b, v, 2 * k, beg, (beg + end) / 2); if (b > (beg + end) / 2) _set(a, b, v, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) tree[k].sum += tree[2 * k + c].sum; } void _add(int a, int b, long long v, int k, int beg, int end) { if ((a <= beg && end <= b) || tree[k].cur) { tree[k].add += v; if (tree[k].cur) tree[k].sum = tree[k].set * (end - beg + 1) + tree[k].add * _sum(beg, end); else tree[k].sum += v * _sum(beg, end); return; } if (a <= (beg + end) / 2) _add(a, b, v, 2 * k, beg, (beg + end) / 2); if (b > (beg + end) / 2) _add(a, b, v, 2 * k + 1, 1 + (beg + end) / 2, end); tree[k].sum = 0; for (int c = 0; c < 2; c++) tree[k].sum += tree[2 * k + c].sum; } void set(int a, int b, long long v) { if (a > b) return; _push(a, b, 1, 0, size - 1); _set(a, b, v, 1, 0, size - 1); } void add(int a, int b, long long v) { if (a > b) return; _push(a, b, 1, 0, size - 1); _add(a, b, v, 1, 0, size - 1); } long long getSum() { return tree[1].sum; } long long getValue(int a) { long long speed = _sum(a, a); a += size; long long result = 0; while (a > 0) { if (tree[a].cur) result = tree[a].set; result += speed * tree[a].add; a /= 2; } return result; } }; BestTreeEver lol; inline bool check(int s, long long h) { return lol.getValue(s) > h; } int main() { scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } sort(a, a + n); prefSum[0] = 0; for (int i = 0; i < n; i++) { prefSum[i + 1] = prefSum[i] + a[i]; sumA += a[i]; } lol.init(n); long long lastT = 0; long long s = 0, ns = 0, res = 0; for (int i = 1; i <= m; i++) { long long t, h; scanf(LLF " " LLF, &t, &h); lol.add(0, n - 1, t - lastT); int p = 0; int q = n; while (q - p > 1) { int s = p + (q - p) / 2; if (check(s, h)) q = s; else p = s; } if (!check(p, h)) p++; s = lol.getSum(); lol.set(p, n - 1, h); ns = lol.getSum(); res = s - ns; printf(LLF "\n", res); lastT = t; } return 0; } |