#841032 (C++14) No.2223 Merged Med

提出ソース

結果

問題	No.2223 Merged Med
ユーザー	👑 hos.lyric
提出日時	2023-02-17 21:58:03
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	328 ms / 7,000 ms
コード長	6,587 bytes
コンパイル時間	1,203 ms
コンパイル使用メモリ	117,192 KB
実行使用メモリ	7,788 KB
最終ジャッジ日時	2024-07-19 13:11:02
合計ジャッジ時間	7,453 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	1 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	141 ms 5,376 KB
testcase_14	AC	90 ms 5,376 KB
testcase_15	AC	94 ms 6,400 KB
testcase_16	AC	239 ms 7,524 KB
testcase_17	AC	57 ms 5,376 KB
testcase_18	AC	82 ms 5,376 KB
testcase_19	AC	129 ms 5,376 KB
testcase_20	AC	307 ms 7,788 KB
testcase_21	AC	309 ms 7,784 KB
testcase_22	AC	316 ms 7,660 KB
testcase_23	AC	316 ms 7,788 KB
testcase_24	AC	315 ms 7,660 KB
testcase_25	AC	317 ms 7,660 KB
testcase_26	AC	312 ms 7,656 KB
testcase_27	AC	303 ms 7,656 KB
testcase_28	AC	316 ms 7,664 KB
testcase_29	AC	328 ms 7,784 KB
testcase_30	AC	96 ms 7,728 KB
testcase_31	AC	92 ms 7,732 KB
testcase_32	AC	14 ms 5,376 KB
testcase_33	AC	243 ms 7,788 KB
testcase_34	AC	163 ms 7,660 KB
testcase_35	AC	150 ms 7,660 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


constexpr int INF = 1001001001;

struct Node {
  int s, l, r, m;
  Node() : s(0), l(0), r(0), m(0) {}
  Node(int val) : s(val) {
    l = r = m = max(val, 0);
  }
  void pull(const Node &L, const Node &R) {
    s = L.s + R.s;
    l = max(L.l, L.s + R.l);
    r = max(L.r + R.s, R.r);
    m = max({L.m, L.r + R.l, R.m});
  }
};

int N, Q;
vector<int> A;
vector<int> L, R;

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    L.resize(Q);
    R.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d", &L[q], &R[q]);
      --L[q];
    }
    
    vector<pair<int, int>> as(N);
    for (int i = 0; i < N; ++i) {
      as[i] = make_pair(A[i], i);
    }
    sort(as.begin(), as.end());
    
    vector<int> los(Q, 0), his(Q, N);
    for (; ; ) {
      vector<pair<int, int>> mids;
      for (int q = 0; q < Q; ++q) {
        if (los[q] + 1 < his[q]) {
          mids.emplace_back((los[q] + his[q]) / 2, q);
        }
      }
      if (mids.empty()) {
        break;
      }
      sort(mids.begin(), mids.end());
      SegmentTreePoint<Node> seg(vector<int>(N, +1));
      int pos = 0;
      for (const auto &mid_q : mids) {
        const int mid = mid_q.first;
        const int q = mid_q.second;
        for (; pos < N && as[pos].first <= mid; ++pos) {
          seg.change(as[pos].second, -1);
        }
        const Node res = seg.get(L[q], R[q]);
        int score = res.s;
        if (res.m > 1) {
          score -= res.m;
          score += 1;
        }
        ((score < 0) ? his[q] : los[q]) = mid;
      }
    }
    for (int q = 0; q < Q; ++q) {
      printf("%d\n", his[q]);
    }
#ifdef LOCAL
cerr<<"========"<<endl;
#endif
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード