library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub maspypy/library

:heavy_check_mark: test/mytest/cf940f.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "ds/offline_query/mo_3d.hpp"

using T = tuple<int, int, int>;

// https://codeforces.com/contest/940/problem/F
vc<int> solve_CF940F(int N, int Q, vc<int> A, vc<T> query) {
  vc<int> X;
  for (auto&& x: A) X.eb(x);
  for (auto&& [t, a, b]: query) {
    --a;
    if (t == 2) X.eb(b);
  }
  UNIQUE(X);
  for (auto&& x: A) x = LB(X, x);
  for (auto&& [t, a, b]: query) {
    if (t == 2) b = LB(X, b);
  }

  vc<T> change;
  vc<int> A0 = A;

  Q = 0;

  Mo_3d mo;
  for (auto&& [t, a, b]: query) {
    if (t == 1) {
      mo.add_query(len(change), a, b);
      ++Q;
    }
    if (t == 2) {
      change.eb(a, A[a], b);
      A[a] = b;
    }
  }
  A = A0;

  vc<int> CNT_1(len(X));
  vc<int> CNT_2(N + 1);
  CNT_2[0] = 1 << 30;
  vc<int> ANS(Q);

  auto ADD_ELEM = [&](int x, int cnt) -> void {
    int& n = CNT_1[x];
    CNT_2[n]--, n += cnt, CNT_2[n]++;
  };

  auto ADD = [&](int i) -> void { ADD_ELEM(A[i], 1); };
  auto RM = [&](int i) -> void { ADD_ELEM(A[i], -1); };
  auto ADD_CHANGE = [&](int t, int l, int r) -> void {
    auto [i, a, b] = change[t];
    if (l <= i && i < r) { ADD_ELEM(a, -1), ADD_ELEM(b, 1); }
    A[i] = b;
  };
  auto RM_CHANGE = [&](int t, int l, int r) -> void {
    auto [i, a, b] = change[t];
    if (l <= i && i < r) { ADD_ELEM(b, -1), ADD_ELEM(a, +1); }
    A[i] = a;
  };
  auto CALC = [&](int q) -> void {
    int mex = 0;
    while (CNT_2[mex]) ++mex;
    ANS[q] = mex;
  };

  mo.calc(ADD, ADD, RM, RM, ADD_CHANGE, RM_CHANGE, CALC);
  return ANS;
}

void test_CF940F() {
  int N = 10, Q = 4;
  vc<int> A = {1, 2, 3, 1, 1, 2, 2, 2, 9, 9};
  vc<T> query;
  query.eb(1, 1, 1);
  query.eb(1, 2, 8);
  query.eb(2, 7, 1);
  query.eb(1, 2, 8);
  auto ANS = solve_CF940F(N, Q, A, query);
  assert(ANS == vc<int>({2, 3, 2}));
}

void solve() {
  int a, b;
  cin >> a >> b;
  cout << a + b << "\n";
}

signed main() {
  test_CF940F();
  solve();
  return 0;
}
#line 1 "test/mytest/cf940f.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 1 "my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;

template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) \
  for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_mod_2(int x) { return __builtin_parity(x); }
int popcnt_mod_2(u32 x) { return __builtin_parity(x); }
int popcnt_mod_2(ll x) { return __builtin_parityll(x); }
int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
T floor(T a, T b) {
  return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
  return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
  return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

template <typename T, typename U>
T SUM(const vector<U> &A) {
  T sm = 0;
  for (auto &&a: A) sm += a;
  return sm;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) \
  sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()

template <typename T>
T POP(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}
template <typename T>
T POP(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(pqg<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(vc<T> &que) {
  T a = que.back();
  que.pop_back();
  return a;
}

template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
  if (check_ok) assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    (check(x) ? ok : ng) = x;
  }
  return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    (check(x) ? ok : ng) = x;
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
  vc<int> A(S.size());
  FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
  return A;
}

template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

// stable sort
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(len(A));
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  vc<T> B(len(I));
  FOR(i, len(I)) B[i] = A[I[i]];
  return B;
}
#endif
#line 1 "ds/offline_query/mo_3d.hpp"
// https://codeforces.com/contest/940/problem/F

// https://codeforces.com/contest/1476/problem/G

struct Mo_3d {
  vc<tuple<int, int, int>> query;

  void add_query(int t, int l, int r) { query.eb(t, l, r); }

  vc<int> get_mo_order(ll block_sz) {
    constexpr ll K = 1 << 20;
    int Q = len(query);
    vi key(Q);
    FOR(q, Q) {
      auto [t, l, r] = query[q];
      t /= block_sz;
      l /= block_sz;
      ll x = r;
      if (l & 1) x = -x;
      x += l * K;
      if (t & 1) x = -x;
      x += t * K * K;
      key[q] = x;
    }
    vc<int> I = argsort(key);

    // ランダムケースで5パーセント程度

    auto cost = [&](int a, int b) -> int {
      auto [t1, x1, y1] = query[I[a]];
      auto [t2, x2, y2] = query[I[b]];
      return abs(t1 - t2) + abs(x1 - x2) + abs(y1 - y2);
    };
    FOR(k, Q - 5) {
      if (cost(k, k + 2) + cost(k + 1, k + 3)
          < cost(k, k + 1) + cost(k + 2, k + 3)) {
        swap(I[k + 1], I[k + 2]);
      }
      if (cost(k, k + 3) + cost(k + 1, k + 4)
          < cost(k, k + 1) + cost(k + 3, k + 4)) {
        swap(I[k + 1], I[k + 3]);
      }
    }
    return I;
  }

  template <typename F1, typename F2, typename F3, typename F4, typename F5,
            typename F6, typename F7>
  void calc(F1 ADD_L, F2 ADD_R, F3 RM_L, F4 RM_R, F5 ADD_CHANGE, F6 RM_CHANGE,
            F7 CALC, ll block_sz = -1) {
    if (block_sz == -1) {
      ll Q = max(1LL, len(query));
      while (block_sz * block_sz * block_sz < Q * Q) { block_sz++; }
    }
    auto I = get_mo_order(block_sz);
    ll t = 0, l = 0, r = 0;
    for (auto&& qid: I) {
      auto [nt, nl, nr] = query[qid];
      while (l > nl) ADD_L(--l);
      while (r < nr) ADD_R(r++);
      while (l < nl) RM_L(l++);
      while (r > nr) RM_R(--r);
      while (t < nt) ADD_CHANGE(t++, l, r);
      while (t > nt) RM_CHANGE(--t, l, r);
      CALC(qid);
    }
  }
};
#line 4 "test/mytest/cf940f.test.cpp"

using T = tuple<int, int, int>;

// https://codeforces.com/contest/940/problem/F
vc<int> solve_CF940F(int N, int Q, vc<int> A, vc<T> query) {
  vc<int> X;
  for (auto&& x: A) X.eb(x);
  for (auto&& [t, a, b]: query) {
    --a;
    if (t == 2) X.eb(b);
  }
  UNIQUE(X);
  for (auto&& x: A) x = LB(X, x);
  for (auto&& [t, a, b]: query) {
    if (t == 2) b = LB(X, b);
  }

  vc<T> change;
  vc<int> A0 = A;

  Q = 0;

  Mo_3d mo;
  for (auto&& [t, a, b]: query) {
    if (t == 1) {
      mo.add_query(len(change), a, b);
      ++Q;
    }
    if (t == 2) {
      change.eb(a, A[a], b);
      A[a] = b;
    }
  }
  A = A0;

  vc<int> CNT_1(len(X));
  vc<int> CNT_2(N + 1);
  CNT_2[0] = 1 << 30;
  vc<int> ANS(Q);

  auto ADD_ELEM = [&](int x, int cnt) -> void {
    int& n = CNT_1[x];
    CNT_2[n]--, n += cnt, CNT_2[n]++;
  };

  auto ADD = [&](int i) -> void { ADD_ELEM(A[i], 1); };
  auto RM = [&](int i) -> void { ADD_ELEM(A[i], -1); };
  auto ADD_CHANGE = [&](int t, int l, int r) -> void {
    auto [i, a, b] = change[t];
    if (l <= i && i < r) { ADD_ELEM(a, -1), ADD_ELEM(b, 1); }
    A[i] = b;
  };
  auto RM_CHANGE = [&](int t, int l, int r) -> void {
    auto [i, a, b] = change[t];
    if (l <= i && i < r) { ADD_ELEM(b, -1), ADD_ELEM(a, +1); }
    A[i] = a;
  };
  auto CALC = [&](int q) -> void {
    int mex = 0;
    while (CNT_2[mex]) ++mex;
    ANS[q] = mex;
  };

  mo.calc(ADD, ADD, RM, RM, ADD_CHANGE, RM_CHANGE, CALC);
  return ANS;
}

void test_CF940F() {
  int N = 10, Q = 4;
  vc<int> A = {1, 2, 3, 1, 1, 2, 2, 2, 9, 9};
  vc<T> query;
  query.eb(1, 1, 1);
  query.eb(1, 2, 8);
  query.eb(2, 7, 1);
  query.eb(1, 2, 8);
  auto ANS = solve_CF940F(N, Q, A, query);
  assert(ANS == vc<int>({2, 3, 2}));
}

void solve() {
  int a, b;
  cin >> a >> b;
  cout << a + b << "\n";
}

signed main() {
  test_CF940F();
  solve();
  return 0;
}
Back to top page