結果

問題 No.1394 Changing Problems
ユーザー 👑 emthrmemthrm
提出日時 2021-02-20 05:50:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 10,185 bytes
コンパイル時間 2,336 ms
コンパイル使用メモリ 216,680 KB
実行使用メモリ 21,132 KB
最終ジャッジ日時 2024-09-17 08:13:44
合計ジャッジ時間 16,979 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 415 ms
20,972 KB
testcase_06 AC 500 ms
21,000 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 11 ms
6,940 KB
testcase_11 AC 11 ms
6,940 KB
testcase_12 AC 11 ms
6,940 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 585 ms
21,028 KB
testcase_17 AC 585 ms
20,944 KB
testcase_18 AC 604 ms
21,036 KB
testcase_19 AC 588 ms
20,972 KB
testcase_20 AC 588 ms
20,996 KB
testcase_21 AC 576 ms
21,004 KB
testcase_22 AC 558 ms
20,972 KB
testcase_23 AC 593 ms
20,972 KB
testcase_24 AC 620 ms
21,052 KB
testcase_25 AC 605 ms
20,972 KB
testcase_26 AC 601 ms
20,968 KB
testcase_27 AC 544 ms
20,932 KB
testcase_28 AC 555 ms
20,976 KB
testcase_29 AC 477 ms
21,076 KB
testcase_30 AC 474 ms
21,012 KB
testcase_31 AC 569 ms
20,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
struct LazySegmentTree {
  using Monoid = typename T::Monoid;
  using OperatorMonoid = typename T::OperatorMonoid;

  LazySegmentTree(int n) : LazySegmentTree(std::vector<Monoid>(n, T::m_id())) {}

  LazySegmentTree(const std::vector<Monoid> &a) : n(a.size()) {
    while ((1 << height) < n) ++height;
    p2 = 1 << height;
    lazy.assign(p2, T::o_id());
    dat.assign(p2 << 1, T::m_id());
    for (int i = 0; i < n; ++i) dat[i + p2] = a[i];
    for (int i = p2 - 1; i > 0; --i) dat[i] = T::m_merge(dat[i << 1], dat[(i << 1) + 1]);
  }

  void set(int idx, const Monoid val) {
    idx += p2;
    for (int i = height; i > 0; --i) propagate(idx >> i);
    dat[idx] = val;
    for (int i = 1; i <= height; ++i) {
      int current_idx = idx >> i;
      dat[current_idx] = T::m_merge(dat[current_idx << 1], dat[(current_idx << 1) + 1]);
    }
  }

  void apply(int idx, const OperatorMonoid val) {
    idx += p2;
    for (int i = height; i > 0; --i) propagate(idx >> i);
    dat[idx] = T::apply(dat[idx], val);
    for (int i = 1; i <= height; ++i) {
      int current_idx = idx >> i;
      dat[current_idx] = T::m_merge(dat[current_idx << 1], dat[(current_idx << 1) + 1]);
    }
  }

  void apply(int left, int right, const OperatorMonoid val) {
    if (right <= left) return;
    left += p2;
    right += p2;
    int left_ctz = __builtin_ctz(left);
    for (int i = height; i > left_ctz; --i) propagate(left >> i);
    int right_ctz = __builtin_ctz(right);
    for (int i = height; i > right_ctz; --i) propagate(right >> i);
    for (int l = left, r = right; l < r; l >>= 1, r >>= 1) {
      if (l & 1) sub_apply(l++, val);
      if (r & 1) sub_apply(--r, val);
    }
    for (int i = left >> (left_ctz + 1); i > 0; i >>= 1) dat[i] = T::m_merge(dat[i << 1], dat[(i << 1) + 1]);
    for (int i = right >> (right_ctz + 1); i > 0; i >>= 1) dat[i] = T::m_merge(dat[i << 1], dat[(i << 1) + 1]);
  }

  Monoid get(int left, int right) {
    if (right <= left) return T::m_id();
    left += p2;
    right += p2;
    int left_ctz = __builtin_ctz(left);
    for (int i = height; i > left_ctz; --i) propagate(left >> i);
    int right_ctz = __builtin_ctz(right);
    for (int i = height; i > right_ctz; --i) propagate(right >> i);
    Monoid l_res = T::m_id(), r_res = T::m_id();
    for (; left < right; left >>= 1, right >>= 1) {
      if (left & 1) l_res = T::m_merge(l_res, dat[left++]);
      if (right & 1) r_res = T::m_merge(dat[--right], r_res);
    }
    return T::m_merge(l_res, r_res);
  }

  Monoid operator[](const int idx) {
    int node = idx + p2;
    for (int i = height; i > 0; --i) propagate(node >> i);
    return dat[node];
  }

  template <typename G>
  int find_right(int left, G g) {
    if (left >= n) return n;
    left += p2;
    for (int i = height; i > 0; --i) propagate(left >> i);
    Monoid val = T::m_id();
    do {
      while (!(left & 1)) left >>= 1;
      Monoid nx = T::m_merge(val, dat[left]);
      if (!g(nx)) {
        while (left < p2) {
          propagate(left);
          left <<= 1;
          nx = T::m_merge(val, dat[left]);
          if (g(nx)) {
            val = nx;
            ++left;
          }
        }
        return left - p2;
      }
      val = nx;
      ++left;
    } while (__builtin_popcount(left) > 1);
    return n;
  }

  template <typename G>
  int find_left(int right, G g) {
    if (right <= 0) return -1;
    right += p2;
    for (int i = height; i > 0; --i) propagate((right - 1) >> i);
    Monoid val = T::m_id();
    do {
      --right;
      while (right > 1 && (right & 1)) right >>= 1;
      Monoid nx = T::m_merge(dat[right], val);
      if (!g(nx)) {
        while (right < p2) {
          propagate(right);
          right = (right << 1) + 1;
          nx = T::m_merge(dat[right], val);
          if (g(nx)) {
            val = nx;
            --right;
          }
        }
        return right - p2;
      }
      val = nx;
    } while (__builtin_popcount(right) > 1);
    return -1;
  }

private:
  int n, p2, height = 0;
  std::vector<Monoid> dat;
  std::vector<OperatorMonoid> lazy;

  void sub_apply(int idx, const OperatorMonoid &val) {
    dat[idx] = T::apply(dat[idx], val);
    if (idx < p2) lazy[idx] = T::o_merge(lazy[idx], val);
  }

  void propagate(int idx) {
    // assert(1 <= idx && idx < p2);
    sub_apply(idx << 1, lazy[idx]);
    sub_apply((idx << 1) + 1, lazy[idx]);
    lazy[idx] = T::o_id();
  }
};

namespace monoid {
template <typename T>
struct RangeMinimumAndUpdateQuery {
  using Monoid = T;
  using OperatorMonoid = T;
  static constexpr T m_id() { return std::numeric_limits<T>::max(); }
  static constexpr T o_id() { return std::numeric_limits<T>::max(); }
  static T m_merge(const T &a, const T &b) { return std::min(a, b); }
  static T o_merge(const T &a, const T &b) { return b == o_id() ? a : b; }
  static T apply(const T &a, const T &b) { return b == o_id()? a : b; }
};

template <typename T>
struct RangeMaximumAndUpdateQuery {
  using Monoid = T;
  using OperatorMonoid = T;
  static constexpr T m_id() { return std::numeric_limits<T>::lowest(); }
  static constexpr T o_id() { return std::numeric_limits<T>::lowest(); }
  static T m_merge(const T &a, const T &b) { return std::max(a, b); }
  static T o_merge(const T &a, const T &b) { return b == o_id() ? a : b; }
  static T apply(const T &a, const T &b) { return b == o_id()? a : b; }
};

template <typename T, T INF>
struct RangeMinimumAndAddQuery {
  using Monoid = T;
  using OperatorMonoid = T;
  static constexpr T m_id() { return INF; }
  static constexpr T o_id() { return 0; }
  static T m_merge(const T &a, const T &b) { return std::min(a, b); }
  static T o_merge(const T &a, const T &b) { return a + b; }
  static T apply(const T &a, const T &b) { return a + b; }
};

template <typename T, T INF>
struct RangeMaximumAndAddQuery {
  using Monoid = T;
  using OperatorMonoid = T;
  static constexpr T m_id() { return -INF; }
  static constexpr T o_id() { return 0; }
  static T m_merge(const T &a, const T &b) { return std::max(a, b); }
  static T o_merge(const T &a, const T &b) { return a + b; }
  static T apply(const T &a, const T &b) { return a + b; }
};

template <typename T>
struct RangeSumAndUpdateQuery {
  struct Node {
    T sum;
    int len;
  };
  static std::vector<Node> init(int n) { return std::vector<Node>(n, Node{0, 1}); }
  using Monoid = Node;
  using OperatorMonoid = T;
  static constexpr Node m_id() { return {0, 0}; }
  static constexpr T o_id() { return std::numeric_limits<T>::max(); }
  static Node m_merge(const Node &a, const Node &b) { return Node{a.sum + b.sum, a.len + b.len}; }
  static T o_merge(const T &a, const T &b) { return b == o_id() ? a : b; }
  static Node apply(const Node &a, const T &b) { return Node{b == o_id() ? a.sum : b * a.len, a.len}; }
};

template <typename T>
struct RangeSumAndAddQuery {
  struct Node {
    T sum;
    int len;
  };
  static std::vector<Node> init(int n) { return std::vector<Node>(n, Node{0, 1}); }
  using Monoid = Node;
  using OperatorMonoid = T;
  static constexpr Node m_id() { return {0, 0}; }
  static constexpr T o_id() { return 0; }
  static Node m_merge(const Node &a, const Node &b) { return Node{a.sum + b.sum, a.len + b.len}; }
  static T o_merge(const T &a, const T &b) { return a + b; }
  static Node apply(const Node &a, const T &b) { return Node{a.sum + b * a.len, a.len}; }
};
}  // monoid

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  int q; cin >> q;
  if (n == 1) {
    while (q--) {
      int i, x; cin >> i >> x; --i;
      a[i] = x;
      cout << max(a[0] - (-1), 0) << '\n';
    }
  } else {
    multiset<int> st(ALL(a));
    LazySegmentTree<monoid::RangeMinimumAndAddQuery<ll, LINF>> seg(n - 1);
    REP(i, n - 1) seg.set(i, i);
    REP(i, n) {
      seg.apply(0, n - 1, (a[i] + 1) / (n - 1));
      seg.apply((a[i] + 1) % (n - 1), n - 1, -1);
    }
    while (q--) {
      int i, x; cin >> i >> x; --i;
      st.erase(st.lower_bound(a[i]));
      seg.apply(0, n - 1, -((a[i] + 1) / (n - 1)));
      seg.apply((a[i] + 1) % (n - 1), n - 1, 1);
      st.emplace(x);
      seg.apply(0, n - 1, (x + 1) / (n - 1));
      seg.apply((x + 1) % (n - 1), n - 1, -1);
      a[i] = x;
      if (*st.rbegin() <= n - 2) {
        cout << 0 << '\n';
      } else {
        int q_max = (*st.rbegin() - (n - 2)) / (n - 1), r_max = (*st.rbegin() - (n - 2)) % (n - 1);
        ll ans = LINF;
        if (r_max > 0) {
          if (seg.get(0, r_max) <= q_max) {
            int r = seg.find_right(0, [&](ll v) { return v > q_max + 1; });
            chmin(ans, 1LL * (q_max + 1) * (n - 1) + r);
          } else {
            ll ans_q = seg.get(0, r_max);
            int r = seg.find_right(0, [&](ll v) { return v > ans_q; });
            chmin(ans, ans_q * (n - 1) + r);
          }
        }
        if (seg.get(r_max, n - 1) < q_max) {
          int r = seg.find_right(r_max, [&](ll v) { return v >= q_max; });
          chmin(ans, 1LL * q_max * (n - 1) + r);
        } else {
          ll ans_q = seg.get(r_max, n - 1);
          int r = seg.find_right(r_max, [&](ll v) { return v > ans_q; });
          chmin(ans, ans_q * (n - 1) + r);
        }
        cout << ans << '\n';
      }
      // REP(i, n - 1) cout << seg[i] << " \n"[i + 1 == n - 1];
    }
  }
  return 0;
}
0