test/verify/aoj-dsl-2-a.test.cpp

• View this file on GitHub
• Last update: 2024-04-27 01:27:28+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

Depends on

• Segment Tree(セグメント木) (structure/segment-tree/segment-tree.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

#include "../../template/template.hpp"

#include "../../structure/segment-tree/segment-tree.hpp"

int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);
  auto seg = get_segment_tree(N, [](int a, int b) { return min(a, b); }, INT_MAX);
  while(Q--) {
    int T, X, Y;
    scanf("%d %d %d", &T, &X, &Y);
    if(T == 0) seg.set(X, Y);
    else printf("%d\n", seg.prod(X, Y + 1));
  }
}

#line 1 "test/verify/aoj-dsl-2-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-dsl-2-a.test.cpp"

#line 1 "structure/segment-tree/segment-tree.hpp"
/**
 * @brief Segment Tree(セグメント木)
 *
 */
template <typename T, typename F>
struct SegmentTree {
  int n, sz;
  vector<T> seg;

  const F f;
  const T ti;

  SegmentTree() = default;

  explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {
    sz = 1;
    while (sz < n) sz <<= 1;
    seg.assign(2 * sz, ti);
  }

  explicit SegmentTree(const vector<T> &v, const F f, const T &ti)
      : SegmentTree((int)v.size(), f, ti) {
    build(v);
  }

  void build(const vector<T> &v) {
    assert(n == (int)v.size());
    for (int k = 0; k < n; k++) seg[k + sz] = v[k];
    for (int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void set(int k, const T &x) {
    k += sz;
    seg[k] = x;
    while (k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  T get(int k) const { return seg[k + sz]; }

  T operator[](const int &k) const { return get(k); }

  void apply(int k, const T &x) {
    k += sz;
    seg[k] = f(seg[k], x);
    while (k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  T prod(int l, int r) const {
    T L = ti, R = ti;
    for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
      if (l & 1) L = f(L, seg[l++]);
      if (r & 1) R = f(seg[--r], R);
    }
    return f(L, R);
  }

  T all_prod() const { return seg[1]; }

  template <typename C>
  int find_first(int l, const C &check) const {
    if (l >= n) return n;
    l += sz;
    T sum = ti;
    do {
      while ((l & 1) == 0) l >>= 1;
      if (check(f(sum, seg[l]))) {
        while (l < sz) {
          l <<= 1;
          auto nxt = f(sum, seg[l]);
          if (not check(nxt)) {
            sum = nxt;
            l++;
          }
        }
        return l + 1 - sz;
      }
      sum = f(sum, seg[l++]);
    } while ((l & -l) != l);
    return n;
  }

  template <typename C>
  int find_last(int r, const C &check) const {
    if (r <= 0) return -1;
    r += sz;
    T sum = ti;
    do {
      r--;
      while (r > 1 and (r & 1)) r >>= 1;
      if (check(f(seg[r], sum))) {
        while (r < sz) {
          r = (r << 1) + 1;
          auto nxt = f(seg[r], sum);
          if (not check(nxt)) {
            sum = nxt;
            r--;
          }
        }
        return r - sz;
      }
      sum = f(seg[r], sum);
    } while ((r & -r) != r);
    return -1;
  }
};

template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(int N, const F &f, const T &ti) {
  return SegmentTree{N, f, ti};
}

template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(const vector<T> &v, const F &f,
                                   const T &ti) {
  return SegmentTree{v, f, ti};
}
#line 6 "test/verify/aoj-dsl-2-a.test.cpp"

int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);
  auto seg = get_segment_tree(N, [](int a, int b) { return min(a, b); }, INT_MAX);
  while(Q--) {
    int T, X, Y;
    scanf("%d %d %d", &T, &X, &Y);
    if(T == 0) seg.set(X, Y);
    else printf("%d\n", seg.prod(X, Y + 1));
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_small_00.in	AC	6 ms	4 MB
g++	00_small_01.in	AC	6 ms	4 MB
g++	00_small_02.in	AC	6 ms	4 MB
g++	00_small_03.in	AC	6 ms	4 MB
g++	01_rand_00.in	AC	6 ms	4 MB
g++	01_rand_01.in	AC	6 ms	4 MB
g++	01_rand_02.in	AC	6 ms	4 MB
g++	01_rand_03.in	AC	6 ms	4 MB
g++	02_biased_00.in	AC	6 ms	4 MB
g++	02_biased_01.in	AC	6 ms	4 MB
g++	02_biased_02.in	AC	6 ms	4 MB
g++	02_biased_03.in	AC	24 ms	4 MB
g++	03_rand_00.in	AC	6 ms	4 MB
g++	03_rand_01.in	AC	8 ms	4 MB
g++	03_rand_02.in	AC	8 ms	4 MB
g++	03_rand_03.in	AC	8 ms	4 MB
g++	03_rand_04.in	AC	32 ms	4 MB
g++	03_rand_05.in	AC	32 ms	4 MB
g++	04_maximum_00.in	AC	31 ms	4 MB
g++	04_maximum_01.in	AC	32 ms	4 MB
clang++	00_small_00.in	AC	6 ms	4 MB
clang++	00_small_01.in	AC	6 ms	4 MB
clang++	00_small_02.in	AC	6 ms	4 MB
clang++	00_small_03.in	AC	6 ms	4 MB
clang++	01_rand_00.in	AC	6 ms	4 MB
clang++	01_rand_01.in	AC	6 ms	4 MB
clang++	01_rand_02.in	AC	6 ms	4 MB
clang++	01_rand_03.in	AC	6 ms	4 MB
clang++	02_biased_00.in	AC	6 ms	4 MB
clang++	02_biased_01.in	AC	6 ms	4 MB
clang++	02_biased_02.in	AC	6 ms	4 MB
clang++	02_biased_03.in	AC	23 ms	4 MB
clang++	03_rand_00.in	AC	7 ms	4 MB
clang++	03_rand_01.in	AC	8 ms	4 MB
clang++	03_rand_02.in	AC	8 ms	4 MB
clang++	03_rand_03.in	AC	9 ms	4 MB
clang++	03_rand_04.in	AC	32 ms	4 MB
clang++	03_rand_05.in	AC	32 ms	4 MB
clang++	04_maximum_00.in	AC	32 ms	4 MB
clang++	04_maximum_01.in	AC	32 ms	4 MB

Back to top page