Submission #65010
ソースコード
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 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 | #pragma GCC optimize "Ofast"#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include "bits/stdc++.h"// Begin Header {{{#pragma regionusing namespace std;using usize = size_t;using imax = intmax_t;using uimax = uintmax_t;#ifndef DEBUG#define dump(...)#endif#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)#define let const autoconstexpr size_t operator""_zu(unsigned long long value) { return value; };constexpr intmax_t operator""_jd(unsigned long long value) { return value; };constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };constexpr int INF = 0x3f3f3f3f;constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;template <class T, class Compare = less<>>using MaxHeap = priority_queue<T, vector<T>, Compare>;template <class T, class Compare = greater<>>using MinHeap = priority_queue<T, vector<T>, Compare>;inline void input() {}template <class Head, class... Tail>inline void input(Head&& head, Tail&&... tail) { cin >> head; input(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline istream& operator>>(istream &is, Container &vs) { for (auto &v: vs) is >> v; return is;}inline void output() { cout << "\n"; }template <class Head, class... Tail>inline void output(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail)) cout << " "; output(forward<Tail>(tail)...);}template <class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>inline ostream& operator<<(ostream &os, const Container &vs) { static constexpr const char *delim[] = {" ", ""}; for (auto it = begin(vs); it != end(vs); ++it) { os << delim[it == begin(vs)] << *it; } return os;}template <class Iterator>inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") { for (auto it = Begin; it != End; ++it) { cout << ((it == Begin) ? "" : delim) << *it; } cout << last;}template <class T>inline vector<T> makeVector(const T &init_value, size_t sz) { return vector<T>(sz, init_value);}template <class T, class... Args>inline auto makeVector(const T &init_value, size_t sz, Args... args) { return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));}template <class Func>class FixPoint : Func {public: explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {} template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(*this, std::forward<Args>(args)...); }};template <class Func>static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint<Func>{forward<Func>(f)};}template <class Container>struct reverse_t { Container &c; reverse_t(Container &c) : c(c) {} auto begin() { return c.rbegin(); } auto end() { return c.rend(); }};template <class Container>auto reversed(Container &c) { return reverse_t<Container>(c);}template <class T>inline bool chmax(T &a, const T &b) noexcept { return b > a && (a = b, true);}template <class T>inline bool chmin(T &a, const T &b) noexcept { return b < a && (a = b, true);}template <class T>inline T diff(const T &a, const T &b) noexcept { return a < b ? b - a : a - b;}void operator|=(vector<bool>::reference lhs, const bool rhs) { lhs = lhs | rhs;}void ioinit() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); clog << fixed << setprecision(10);}#pragma endregion// }}} End Header// ModInt {{{template <intmax_t Modulo>class ModInt {public: using value_type = intmax_t;private: static constexpr value_type cmod = Modulo; // compile-time static value_type rmod; // runtime value_type value = 0; static constexpr value_type inverse(value_type n, value_type m) { value_type a = n; value_type b = m; value_type x = 0; value_type y = 1; for (value_type u = y, v = x; a;) { const value_type t = b / a; swap(x -= t * u, u); swap(y -= t * v, v); swap(b -= t * a, a); } if ((x %= m) < 0) x += m; return x; } static value_type normalize(intmax_t n, value_type m) { if (n >= m) { n %= m; } else if (n < 0) { if ((n %= m) < 0) n += m; } return n; }public: ModInt() = default; ModInt(intmax_t n) : value(normalize(n, getModulo())) {} template <typename T> constexpr explicit operator T() const { return static_cast<T>(value); } ModInt& operator=(intmax_t n) { value = normalize(n, getModulo()); return *this; } ModInt& operator+=(const ModInt& other) { if ((value += other.value) >= getModulo()) value -= getModulo(); return *this; } ModInt& operator-=(const ModInt& other) { if ((value -= other.value) < 0) value += getModulo(); return *this; } ModInt& operator*=(const ModInt& other) { value = (value * other.value) % getModulo(); return *this; } ModInt& operator/=(const ModInt& other) { value = (value * inverse(other.value, getModulo())) % getModulo(); return *this; } ModInt& operator++() { if (++value == getModulo()) value = 0; return *this; } ModInt& operator--() { if (value-- == 0) value = getModulo() - 1; return *this; } ModInt operator++(int) { const ModInt tmp(*this); ++*this; return tmp; } ModInt operator--(int) { const ModInt tmp(*this); --*this; return tmp; } friend ModInt operator+(ModInt lhs, const ModInt& rhs) { return lhs += rhs; } friend ModInt operator-(ModInt lhs, const ModInt& rhs) { return lhs -= rhs; } friend ModInt operator*(ModInt lhs, const ModInt& rhs) { return lhs *= rhs; } friend ModInt operator/(ModInt lhs, const ModInt& rhs) { return lhs /= rhs; } ModInt operator+() const { return *this; } ModInt operator-() const { if (value == 0) return *this; return ModInt(getModulo() - value); } friend bool operator==(const ModInt& lhs, const ModInt& rhs) { return lhs.value == rhs.value; } friend bool operator!=(const ModInt& lhs, const ModInt& rhs) { return !(lhs == rhs); } friend ostream& operator<<(ostream& os, const ModInt& n) { return os << n.value; } friend istream& operator>>(istream& is, ModInt& n) { is >> n.value; n.value = normalize(n.value, getModulo()); return is; } static value_type getModulo() { return ((cmod > 0) ? cmod : rmod); } template <int M = Modulo, typename T = typename enable_if<(M <= 0)>::type> static T setModulo(value_type m) { rmod = m; }};template <intmax_t M>constexpr typename ModInt<M>::value_type ModInt<M>::cmod;template <intmax_t M>typename ModInt<M>::value_type ModInt<M>::rmod;// }}}// constexpr intmax_t MOD = intmax_t(1e9) + 7;// constexpr intmax_t MOD = 998244353;constexpr intmax_t MOD = 100000;using Mint = ModInt<MOD>;// Factorials {{{template <class ModInt>class Factorials {public: using value_type = ModInt;private: mutable vector<value_type> m_f, m_i, m_fi;public: Factorials() = default; explicit Factorials(intmax_t n) : m_f(n + 1), m_i(n + 1), m_fi(n + 1) { m_f[0] = 1; for (intmax_t i = 1; i <= n; ++i) { m_f[i] = m_f[i - 1] * i; } const intmax_t MOD = m_f[0].getModulo(); m_i[1] = 1; for (intmax_t i = 2; i <= n; ++i) { m_i[i] = -value_type(MOD / i) * m_i[MOD % i]; } m_fi[0] = 1; for (intmax_t i = 1; i <= n; ++i) { m_fi[i] = m_fi[i - 1] * m_i[i]; } } value_type inv(intmax_t n) const { return m_i[n]; } value_type fact(intmax_t n) const { return m_f[n]; } value_type finv(intmax_t n) const { m_fi[n]; } value_type C(intmax_t n, intmax_t k) const { if (k < 0 || n < k) return 0; return m_f[n] * m_fi[k] * m_fi[n - k]; } value_type P(intmax_t n, intmax_t k) const { if (k < 0 || n < k) return 0; return m_f[n] * m_fi[n - k]; } value_type H(intmax_t n, intmax_t k) const { return C(n + k - 1, k); }};// }}}Factorials<Mint> F(1'000'000);template <class T>T binomial(intmax_t n, intmax_t k) { if (k < 0 || n < k) return 0; T ret = 1; for (intmax_t i = 1; i <= k; ++i) { ret *= n--; ret /= i; } return ret;}template <class T>T power(const T& b, const intmax_t& e) { T ret = 1; T n = b; for (intmax_t p = abs(e); p > 0; p >>= 1) { if (p & 1) ret *= n; n *= n; } if (e < 0) return T(1) / ret; return ret;}template <class T>T power(const T& b, const string& e) { T ret = 1; for (const char& c: e) { ret = power(ret, 10) * power(b, c - '0'); } return ret;}// Edge {{{template <class Weight>struct Edge { size_t from, to; Weight weight; Edge() {} Edge(size_t from, size_t to, Weight weight = 1) : from(from), to(to), weight(weight) {} bool operator<(const Edge &rhs) const { return weight < rhs.weight; } bool operator>(const Edge &rhs) const { return weight > rhs.weight; } operator size_t() const { return to; }};// }}}// Graph {{{template <class Weight>class Graph : public vector<vector<Edge<Weight>>> { using graph = vector<vector<Edge<Weight>>>;public: Graph() {} Graph(const size_t V) : graph(V) {} void connect(size_t from, size_t to, Weight weight = 1) { (*this)[from].emplace_back(from, to, weight); } friend ostream& operator<<(ostream &strm, const Graph &G) { for (size_t v = 0; v < G.size(); ++v) { strm << '[' << setw(2) << v << ']'; for (const auto &e: G[v]) { strm << ' ' << setw(2) << e.to; } strm << '\n'; } return strm; }};// }}}// SegmentTree {{{template <typename Monoid, typename Func>struct SegmentTree { const size_t sz; const Func fn; const Monoid unity; vector<Monoid> seg; SegmentTree(const size_t n, const Monoid &u, Func f) : sz(1 << (__lg(n + 5) + 1)), fn(f), unity(u), seg(sz * 2, unity) {} void set(size_t k, const Monoid &v) { seg[k + sz] = v; } Monoid& operator[](size_t k) { return seg[k + sz]; } const Monoid& operator[](size_t k) const { return seg[k + sz]; } void build() { for (size_t k = sz - 1; k > 0; --k) { seg[k] = fn(seg[2 * k], seg[2 * k + 1]); } } void update(size_t k, const Monoid &x) { k += sz; seg[k] = x; while (k >>= 1) { seg[k] = fn(seg[2 * k], seg[2 * k + 1]); } } Monoid fold(size_t l, size_t r) const { Monoid L = unity; Monoid R = unity; for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) { if (l & 1) { L = fn(L, seg[l++]); } if (r & 1) { R = fn(seg[--r], R); } } return fn(L, R); }};// }}}// BinaryIndexedTree {{{template <class T>struct BinaryIndexedTree { vector<T> bit; const size_t SIZE; explicit BinaryIndexedTree(size_t n) : bit(n + 5, 0), SIZE(1 << (__lg(n + 5) + 1)) {} void add(int i, const T& v) { for (++i; i < bit.size(); i += i & -i) bit[i] += v; } // [0, i] T sum(int i) const { T ret = 0; for (++i; i > 0; i -= i & -i) ret += bit[i]; return ret; } // [s, t] T sum(int s, int t) const { if (s > t) swap(s, t); return sum(t) - sum(s - 1); } size_t lower_bound(T v) const { if (v <= 0) return 0; T x = 0; for (size_t k = SIZE; k > 0; k >>= 1) { if (x + k < bit.size() && bit[x + k] < v) { v -= bit[x + k]; x += k; } } return x; }};// }}}// dijkstra {{{template <class Weight>vector<Weight> dijkstra(const Graph<Weight> &G, const vector<size_t> &startNodes) { using P = pair<Weight, size_t>; vector<Weight> dp(G.size(), numeric_limits<Weight>::max()); priority_queue<P, vector<P>, greater<>> pq; for (const auto startNode: startNodes) { dp[startNode] = 0; pq.emplace(0, startNode); } while (!pq.empty()) { const Weight nowCost = pq.top().first; const size_t nowNode = pq.top().second; pq.pop(); if (dp[nowNode] < nowCost) { continue; } for (const auto &e: G[nowNode]) { const Weight newCost = dp[nowNode] + e.weight; const size_t newNode = e.to; if (newCost < dp[newNode]) { dp[newNode] = newCost; pq.emplace(newCost, newNode); } } } return dp;}// }}}// Compress {{{template <class T>class Compress { vector<T> xs;public: Compress() = default; Compress(const vector<T> &vs) { add(vs); } void add(const vector<T> &vs) { copy(vs.begin(), vs.end(), back_inserter(xs)); } void add(const T &x) { xs.emplace_back(x); } void build() { sort(xs.begin(), xs.end()); xs.erase(unique(xs.begin(), xs.end()), xs.end()); } vector<intmax_t> get(const vector<T> &vs) const { vector<intmax_t> ret; transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T &v) { return distance(xs.begin(), lower_bound(xs.begin(), xs.end(), v)); }); return ret; } unordered_map<T, intmax_t> dict() const { unordered_map<T, intmax_t> ret; for (intmax_t i = 0; i < xs.size(); ++i) { ret[xs[i]] = i; } return ret; } const size_t size() const { return xs.size(); } const T &operator[](size_t k) const { return xs[k]; }};// }}}const auto sigma = [](auto s, auto t) { return (s + t) * (t - s + 1) / 2; };// integerOptimizeConvex {{{template <class Tp, class Fn>auto integerOptimizeConvex(Tp xl, Tp xu, Fn fn, bool maximize = true) { while (xu - xl > 1) { const Tp xm = (xl + xu) / 2; if (maximize) { if (fn(xm - 1) < fn(xm)) xl = xm; else xu = xm; } else { if (fn(xm - 1) > fn(xm)) xl = xm; else xu = xm; } } return make_pair(xl, fn(xl));}// }}}signed main() { ioinit(); var(usize, N); var(imax, K); const imax M = 1e6; assert(2 <= N && N <= M); assert(0 <= K && K <= M); vector<imax> as(N); for (auto& a: as) { input(a); assert(0 <= a && a <= 5e5); } vector<imax> cumsum(1); partial_sum(all(as), back_inserter(cumsum)); vector<imax> min_pos(M + 1, LINF); rep(i, 0, N) chmin(min_pos[as[i]], i); repr(i, 5e5, 0) chmin(min_pos[i], min_pos[i + 1]); imax res = 0; rep(i, 0, N) { const imax need = K - as[i]; if (need >= 0 && min_pos[need] < i) { chmax(res, cumsum[i + 1] - cumsum[min_pos[need]]); } } output(res); return 0;} |
ステータス
| 項目 | データ |
|---|---|
| 問題 | 1466 - 2つの仕切り |
| ユーザー名 | syoribu |
| 投稿日時 | 2020-12-17 17:38:55 |
| 言語 | C++17 |
| 状態 | Accepted |
| 得点 | 10 |
| ソースコード長 | 16772 Byte |
| 最大実行時間 | 105 ms |
| 最大メモリ使用量 | 47760 KB |
セット
| セット | 得点 | Cases | |
|---|---|---|---|
| 1 | ALL | 10 / 10 | * |
テストケース
| ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
|---|---|---|---|---|
| in01.text | AC | 42 ms | 31836 KB |
1
|
| in02.text | AC | 46 ms | 31880 KB |
1
|
| in03.text | AC | 46 ms | 31928 KB |
1
|
| in04.text | AC | 44 ms | 32992 KB |
1
|
| in05.text | AC | 97 ms | 46740 KB |
1
|
| in06.text | AC | 49 ms | 33424 KB |
1
|
| in07.text | AC | 60 ms | 35608 KB |
1
|
| in08.text | AC | 50 ms | 34476 KB |
1
|
| in09.text | AC | 74 ms | 39156 KB |
1
|
| in10.text | AC | 82 ms | 43472 KB |
1
|
| in11.text | AC | 61 ms | 37836 KB |
1
|
| in12.text | AC | 83 ms | 42632 KB |
1
|
| in13.text | AC | 51 ms | 34696 KB |
1
|
| in14.text | AC | 104 ms | 46372 KB |
1
|
| in15.text | AC | 98 ms | 46040 KB |
1
|
| in16.text | AC | 45 ms | 33040 KB |
1
|
| in17.text | AC | 92 ms | 44252 KB |
1
|
| in18.text | AC | 86 ms | 40164 KB |
1
|
| in19.text | AC | 80 ms | 42528 KB |
1
|
| in20.text | AC | 95 ms | 44052 KB |
1
|
| in21.text | AC | 72 ms | 38852 KB |
1
|
| in22.text | AC | 105 ms | 46668 KB |
1
|
| in23.text | AC | 71 ms | 39076 KB |
1
|
| in24.text | AC | 66 ms | 38388 KB |
1
|
| in25.text | AC | 72 ms | 37404 KB |
1
|
| in26.text | AC | 84 ms | 42052 KB |
1
|
| in27.text | AC | 63 ms | 35312 KB |
1
|
| in28.text | AC | 95 ms | 43708 KB |
1
|
| in29.text | AC | 87 ms | 47760 KB |
1
|
| in30.text | AC | 103 ms | 47640 KB |
1
|