// {{{ #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define VARGS_(_4, _3, _2, _1, N, ...) N #define VARGS(...) VARGS_(__VA_ARGS__, 4, 3, 2, 1) #define CONCAT_(a, b) a##b #define CONCAT(a, b) CONCAT_(a, b) #define FOR_1(x) for (auto& x) #define FOR_2(i, n) for (auto i = remove_reference_t<decltype(n)>{0}; i < (n); ++i) #define FOR_3(i, b, e) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); ++i) #define FOR_4(i, b, e, s) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); i += s) #define FORD_2(i, n) for (auto i = (n) - 1; i >= 0; --i) #define FORD_3(i, b, e) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); --i) #define FORD_4(i, b, e, s) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); i -= s) #define FOR(...) CONCAT(FOR_, VARGS(__VA_ARGS__))(__VA_ARGS__) #define FORD(...) CONCAT(FORD_, VARGS(__VA_ARGS__))(__VA_ARGS__) #define B begin() #define E end() #define RB rbegin() #define RE rend() #define A(x) std::begin(x), std::end(x) #define RA(x) std::rbegin(x), std::rend(x) #define RANGE(x, b, e) (std::begin(x) + (b)), (std::begin(x) + (e)) #define MP make_pair #define MT make_tuple #define FS first #define ND second #define G1 get<0> #define G2 get<1> #define G3 get<2> #define G4 get<3> #define G5 get<4> #define PB push_back #define PP pop_back #define PF push_front #define FF pop_front #define RS resize #define INF(T) numeric_limits<T>::max() #define L0(_expr) [&]() { return _expr; } #define L1(_expr) [&](auto&& _1) { return _expr; } #define L2(_expr) [&](auto&& _1, auto&& _2) { return _expr; } #define _ CONCAT(_unused_, __COUNTER__) #define MIN min_element #define MAX max_element #define SUM accumulate using namespace std; using LL = long long; using LD = long double; using ULL = unsigned long long; template<class T1,class T2> using P = pair<T1,T2>; using PII = P<int,int>; using PLL = P<LL,LL>; using PLD = P<LD,LD>; template<class T> using V = vector<T>; using VI = V<int>; using VLL = V<LL>; using VLD = V<LD>; using VB = V<bool>; using VS = V<string>; template<class T,class Comp=greater<T>> using PQ = priority_queue<T,V<T>,Comp>; template<class T> int sz(const T& x) { return size(x); } template<class T> bool amin(T& a, const T& b) { if (b < a) { a = b; return true; } return false; } template<class T> bool amax(T& a, const T& b) { if (b > a) { a = b; return true; } return false; } /* find_by_order(k) - k'th largest counting from 0; order_of_key(k) - number of items strictly smaller than k; join(other), split(k, other) - all keys in other greater than in *(this). */ template<class K,class V,class Comp=less<K>> using ordered_map = __gnu_pbds::tree<K,V,Comp, __gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<class T,class Comp=less<T>> using ordered_set = ordered_map<T,__gnu_pbds::null_type,Comp>; string _sep = " ", _ignore; bool _newline = true; stack<ostream*> _ostack; stack<istream*> _istack; template<class TH> void out(const TH& h) { if (_newline) _newline = false; else *_ostack.top() << _sep; *_ostack.top() << h; } template<class TH,class...TA> void out(const TH& h, const TA&... a) { out(h); out(a...); } void outln() { *_ostack.top() << '\n'; _newline = true; } template<class...TA> void outln(const TA&... a) { out(a...); outln(); } template<class TH> void in(TH& h) { *_istack.top() >> h; } template<class TH,class...TA> void in(TH& h, TA&... a) { in(h); in(a...); } template<class...TA> void EXIT(const TA&... a) { outln(a...); exit(0); } #ifdef SPONGE template<class...TA> void dbg(const TA&... a) { _ostack.push(&cerr); cerr << "\033[1;33m"; outln(a...); cerr << "\033[0m"; _ostack.pop(); } #else #define dbg(...) #endif struct _upgrade_io { _upgrade_io(bool ok) { _ostack.push(&cout); _istack.push(&cin); if (ok) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(15); cout.setf(ios::fixed, ios::floatfield); }} } _upgrade_io(true); /* bitset: _Find_first(), _Find_next(i) */ // }}} bool brute_on = false; int q, n, m, bsz; VLL weights, sum; VI cnt, cnt_sum; VB skip, dirty; LL query(int l, int r) { if (r < l) return 0; dbg("Query: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; dbg("Bucket_ind", b_ind, b_lo, b_hi); LL res = 0; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) res += cnt[i] * weights[i]; if (b_hi >= r) return res; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); if (!skip[b_ind]) res += sum[b_ind]; b_ind++; b_hi += bsz; } dbg("Bucket_ind", b_ind, b_hi - bsz, b_hi); if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) res += cnt[i] * weights[i]; } return res; } int query_cnt(int l, int r) { if (r < l) return 0; dbg("Query: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; dbg("Bucket_ind", b_ind, b_lo, b_hi); int res = 0; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) res += cnt[i]; if (b_hi >= r) return res; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); if (!skip[b_ind]) res += cnt_sum[b_ind]; b_ind++; b_hi += bsz; } dbg("Bucket_ind", b_ind, b_hi - bsz, b_hi); if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) res += cnt[i]; } return res; } void set2zero(int l, int r) { if (r < l) return; dbg("set2zero: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) { if (cnt[i] == 1) { sum[b_ind] -= weights[i]; cnt_sum[b_ind]--; cnt[i] = 0; } } dirty[b_ind] = true; if (b_hi >= r) return; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); skip[b_ind] = true; b_ind++; b_hi += bsz; } if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) { if (cnt[i] == 1) { sum[b_ind] -= weights[i]; cnt_sum[b_ind]--; cnt[i] = 0; } } dirty[b_ind] = true; } } void reset() { int b_lo = 0, b_hi = bsz; FOR(i, bsz) { if (dirty[i]) { FOR(j, b_lo, b_hi) if (cnt[j] == 0) { sum[i] += weights[j]; cnt[j] = 1; } dirty[i] = false; } cnt_sum[i] = bsz; skip[i] = false; b_lo = b_hi; b_hi += bsz; } } void brute(int t) { if (t == 1) { LL s, k; in(s, k); int ans = 0; VB vis(sz(weights)); while (s < k) { int j = -1; FOR(i, sz(weights)) { if (weights[i] < s && !vis[i] && (j == -1 || weights[j] < weights[i])) j = i; } if (j == -1) { outln(-1); return; } else { ans++; s += weights[j]; vis[j] = true; } } if (k >= s) { outln(ans); } } else if (t == 2) { LL w; in(w); weights.PB(w); } else { LL w; in(w); int i = 0; while (weights[i] != w) i++; swap(weights[i], weights.back()); weights.PP(); } } int main() { in(n); bsz = (int)sqrt(n) + 1; m = bsz * bsz; dbg("Bucket size", bsz, "Size", m); weights.RS(m); FOR(i, n) in(weights[i]); sort(A(weights)); cnt.RS(m, 1); cnt_sum.RS(m, bsz); sum.RS(bsz); skip.RS(bsz); dirty.RS(bsz); FOR(i, bsz) { sum[i] = SUM(RANGE(weights, i * bsz, (i + 1) * bsz), 0LL); } /* outln("Wagi szprotow:"); FOR(i, m) { cout << setw(3) << i << ' '; } outln(); FOR(w : weights) { cout << setw(3) << w << ' '; } outln(); */ /* FOR(w : weights) out(w); outln(); */ in(q); while (q--) { int t; in(t); if (brute_on || t != 1) { brute_on = true; brute(t); continue; } LL s, k; in(s, k); //outln("Przyplywa szczupak o wadze", s, "kg i chce przytyc do", k, "kg jedzac szproty"); int ans = 0; while (s < k) { int mx = lower_bound(A(weights), s) - weights.B; LL mx_w; if (mx == sz(weights)) { //outln("Szczupak: Umiem zjesc wszystkie szprotki, i co tera?"); mx_w = k; } else { mx_w = weights[mx]; //outln("Najwieksza szprota, ktorej szczupak nie moze zjesc ma indeks", mx, "i wazy", weights[mx]); } if (query(0, mx - 1) == 0) break; int l = 0, r = mx - 1; while (l < r) { int mid = (l + r + 1) / 2; if (query(mid, mx - 1) + s > mx_w) l = mid; else r = mid - 1; } if (query(0, mx - 1) + s >= k) { int ll = 0, rr = mx - 1; while (ll < rr) { int mid = (ll + rr + 1) / 2; if (query(mid, mx - 1) + s >= k) ll = mid; else rr = mid - 1; } if (mx - ll <= mx - l) { //outln("XD"); //outln("Szczupak zjada szproty", ll, mx - 1); ans += query_cnt(ll, mx - 1); s += query(ll, mx - 1); //outln("Teraz szczupak wazy", s, "kg"); break; } } //outln("Szczupak zjada szproty", l, mx - 1); ans += query_cnt(l, mx - 1); dbg(s, query(l, mx - 1)); s += query(l, mx - 1); //outln("Teraz szczupak wazy", s, "kg"); set2zero(l, mx - 1); } reset(); if (s >= k) { //outln("Szczupak sie najadl i odplywa"); outln(ans); } else { //outln("Szczupak nie moze jesc wiecej szprot, a wiec odplywa glodny i smutny :("); outln(-1); } } }
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 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 | // {{{ #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define VARGS_(_4, _3, _2, _1, N, ...) N #define VARGS(...) VARGS_(__VA_ARGS__, 4, 3, 2, 1) #define CONCAT_(a, b) a##b #define CONCAT(a, b) CONCAT_(a, b) #define FOR_1(x) for (auto& x) #define FOR_2(i, n) for (auto i = remove_reference_t<decltype(n)>{0}; i < (n); ++i) #define FOR_3(i, b, e) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); ++i) #define FOR_4(i, b, e, s) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); i += s) #define FORD_2(i, n) for (auto i = (n) - 1; i >= 0; --i) #define FORD_3(i, b, e) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); --i) #define FORD_4(i, b, e, s) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); i -= s) #define FOR(...) CONCAT(FOR_, VARGS(__VA_ARGS__))(__VA_ARGS__) #define FORD(...) CONCAT(FORD_, VARGS(__VA_ARGS__))(__VA_ARGS__) #define B begin() #define E end() #define RB rbegin() #define RE rend() #define A(x) std::begin(x), std::end(x) #define RA(x) std::rbegin(x), std::rend(x) #define RANGE(x, b, e) (std::begin(x) + (b)), (std::begin(x) + (e)) #define MP make_pair #define MT make_tuple #define FS first #define ND second #define G1 get<0> #define G2 get<1> #define G3 get<2> #define G4 get<3> #define G5 get<4> #define PB push_back #define PP pop_back #define PF push_front #define FF pop_front #define RS resize #define INF(T) numeric_limits<T>::max() #define L0(_expr) [&]() { return _expr; } #define L1(_expr) [&](auto&& _1) { return _expr; } #define L2(_expr) [&](auto&& _1, auto&& _2) { return _expr; } #define _ CONCAT(_unused_, __COUNTER__) #define MIN min_element #define MAX max_element #define SUM accumulate using namespace std; using LL = long long; using LD = long double; using ULL = unsigned long long; template<class T1,class T2> using P = pair<T1,T2>; using PII = P<int,int>; using PLL = P<LL,LL>; using PLD = P<LD,LD>; template<class T> using V = vector<T>; using VI = V<int>; using VLL = V<LL>; using VLD = V<LD>; using VB = V<bool>; using VS = V<string>; template<class T,class Comp=greater<T>> using PQ = priority_queue<T,V<T>,Comp>; template<class T> int sz(const T& x) { return size(x); } template<class T> bool amin(T& a, const T& b) { if (b < a) { a = b; return true; } return false; } template<class T> bool amax(T& a, const T& b) { if (b > a) { a = b; return true; } return false; } /* find_by_order(k) - k'th largest counting from 0; order_of_key(k) - number of items strictly smaller than k; join(other), split(k, other) - all keys in other greater than in *(this). */ template<class K,class V,class Comp=less<K>> using ordered_map = __gnu_pbds::tree<K,V,Comp, __gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<class T,class Comp=less<T>> using ordered_set = ordered_map<T,__gnu_pbds::null_type,Comp>; string _sep = " ", _ignore; bool _newline = true; stack<ostream*> _ostack; stack<istream*> _istack; template<class TH> void out(const TH& h) { if (_newline) _newline = false; else *_ostack.top() << _sep; *_ostack.top() << h; } template<class TH,class...TA> void out(const TH& h, const TA&... a) { out(h); out(a...); } void outln() { *_ostack.top() << '\n'; _newline = true; } template<class...TA> void outln(const TA&... a) { out(a...); outln(); } template<class TH> void in(TH& h) { *_istack.top() >> h; } template<class TH,class...TA> void in(TH& h, TA&... a) { in(h); in(a...); } template<class...TA> void EXIT(const TA&... a) { outln(a...); exit(0); } #ifdef SPONGE template<class...TA> void dbg(const TA&... a) { _ostack.push(&cerr); cerr << "\033[1;33m"; outln(a...); cerr << "\033[0m"; _ostack.pop(); } #else #define dbg(...) #endif struct _upgrade_io { _upgrade_io(bool ok) { _ostack.push(&cout); _istack.push(&cin); if (ok) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(15); cout.setf(ios::fixed, ios::floatfield); }} } _upgrade_io(true); /* bitset: _Find_first(), _Find_next(i) */ // }}} bool brute_on = false; int q, n, m, bsz; VLL weights, sum; VI cnt, cnt_sum; VB skip, dirty; LL query(int l, int r) { if (r < l) return 0; dbg("Query: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; dbg("Bucket_ind", b_ind, b_lo, b_hi); LL res = 0; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) res += cnt[i] * weights[i]; if (b_hi >= r) return res; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); if (!skip[b_ind]) res += sum[b_ind]; b_ind++; b_hi += bsz; } dbg("Bucket_ind", b_ind, b_hi - bsz, b_hi); if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) res += cnt[i] * weights[i]; } return res; } int query_cnt(int l, int r) { if (r < l) return 0; dbg("Query: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; dbg("Bucket_ind", b_ind, b_lo, b_hi); int res = 0; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) res += cnt[i]; if (b_hi >= r) return res; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); if (!skip[b_ind]) res += cnt_sum[b_ind]; b_ind++; b_hi += bsz; } dbg("Bucket_ind", b_ind, b_hi - bsz, b_hi); if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) res += cnt[i]; } return res; } void set2zero(int l, int r) { if (r < l) return; dbg("set2zero: [", l, r, "]"); r++; int b_ind = l / bsz; int b_lo = b_ind * bsz, b_hi = b_lo + bsz; if (l > b_ind && !skip[b_ind]) { FOR(i, l, min(r, b_hi)) { if (cnt[i] == 1) { sum[b_ind] -= weights[i]; cnt_sum[b_ind]--; cnt[i] = 0; } } dirty[b_ind] = true; if (b_hi >= r) return; b_ind++; b_hi += bsz; } while (b_hi <= r) { dbg("Fast", b_ind); skip[b_ind] = true; b_ind++; b_hi += bsz; } if (r < b_hi && !skip[b_ind]) { b_lo = b_hi - bsz; FOR(i, b_lo, r) { if (cnt[i] == 1) { sum[b_ind] -= weights[i]; cnt_sum[b_ind]--; cnt[i] = 0; } } dirty[b_ind] = true; } } void reset() { int b_lo = 0, b_hi = bsz; FOR(i, bsz) { if (dirty[i]) { FOR(j, b_lo, b_hi) if (cnt[j] == 0) { sum[i] += weights[j]; cnt[j] = 1; } dirty[i] = false; } cnt_sum[i] = bsz; skip[i] = false; b_lo = b_hi; b_hi += bsz; } } void brute(int t) { if (t == 1) { LL s, k; in(s, k); int ans = 0; VB vis(sz(weights)); while (s < k) { int j = -1; FOR(i, sz(weights)) { if (weights[i] < s && !vis[i] && (j == -1 || weights[j] < weights[i])) j = i; } if (j == -1) { outln(-1); return; } else { ans++; s += weights[j]; vis[j] = true; } } if (k >= s) { outln(ans); } } else if (t == 2) { LL w; in(w); weights.PB(w); } else { LL w; in(w); int i = 0; while (weights[i] != w) i++; swap(weights[i], weights.back()); weights.PP(); } } int main() { in(n); bsz = (int)sqrt(n) + 1; m = bsz * bsz; dbg("Bucket size", bsz, "Size", m); weights.RS(m); FOR(i, n) in(weights[i]); sort(A(weights)); cnt.RS(m, 1); cnt_sum.RS(m, bsz); sum.RS(bsz); skip.RS(bsz); dirty.RS(bsz); FOR(i, bsz) { sum[i] = SUM(RANGE(weights, i * bsz, (i + 1) * bsz), 0LL); } /* outln("Wagi szprotow:"); FOR(i, m) { cout << setw(3) << i << ' '; } outln(); FOR(w : weights) { cout << setw(3) << w << ' '; } outln(); */ /* FOR(w : weights) out(w); outln(); */ in(q); while (q--) { int t; in(t); if (brute_on || t != 1) { brute_on = true; brute(t); continue; } LL s, k; in(s, k); //outln("Przyplywa szczupak o wadze", s, "kg i chce przytyc do", k, "kg jedzac szproty"); int ans = 0; while (s < k) { int mx = lower_bound(A(weights), s) - weights.B; LL mx_w; if (mx == sz(weights)) { //outln("Szczupak: Umiem zjesc wszystkie szprotki, i co tera?"); mx_w = k; } else { mx_w = weights[mx]; //outln("Najwieksza szprota, ktorej szczupak nie moze zjesc ma indeks", mx, "i wazy", weights[mx]); } if (query(0, mx - 1) == 0) break; int l = 0, r = mx - 1; while (l < r) { int mid = (l + r + 1) / 2; if (query(mid, mx - 1) + s > mx_w) l = mid; else r = mid - 1; } if (query(0, mx - 1) + s >= k) { int ll = 0, rr = mx - 1; while (ll < rr) { int mid = (ll + rr + 1) / 2; if (query(mid, mx - 1) + s >= k) ll = mid; else rr = mid - 1; } if (mx - ll <= mx - l) { //outln("XD"); //outln("Szczupak zjada szproty", ll, mx - 1); ans += query_cnt(ll, mx - 1); s += query(ll, mx - 1); //outln("Teraz szczupak wazy", s, "kg"); break; } } //outln("Szczupak zjada szproty", l, mx - 1); ans += query_cnt(l, mx - 1); dbg(s, query(l, mx - 1)); s += query(l, mx - 1); //outln("Teraz szczupak wazy", s, "kg"); set2zero(l, mx - 1); } reset(); if (s >= k) { //outln("Szczupak sie najadl i odplywa"); outln(ans); } else { //outln("Szczupak nie moze jesc wiecej szprot, a wiec odplywa glodny i smutny :("); outln(-1); } } } |