mmrz's library

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

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/aoj/dsl/2_A___segment_tree_0-indexed.test.cpp

Depends on

Code

# define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A"

#include "./../../../template/template.hpp"
#include "./../../../data_structure/segment_tree_0-indexed.hpp"

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	auto combine = [](int a, int b){return min(a, b); };
	segment_tree<int> seg(n, combine, inf<int>());
	while(q--){
		int com, x, y;
		cin >> com >> x >> y;
		if(com)cout << seg.fold(x, y + 1) << '\n';
		else seg.set(x, y);
	}
}
#line 1 "verify/aoj/dsl/2_A___segment_tree_0-indexed.test.cpp"
# define PROBLEM "https://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 ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "data_structure/segment_tree_0-indexed.hpp"

#line 5 "data_structure/segment_tree_0-indexed.hpp"

template<typename T>
struct [[deprecated("use 1-indexed segment tree (segment_tree.hpp)")]] segment_tree {
	using F = std::function<T(T, T)>;

	int n;
	std::vector<T> node;
	F combine;
	T identify;

	segment_tree(std::vector<T> v, F _combine, T _identity) : combine(_combine), identify(_identity) {
		int sz = (int)v.size();
		n = 1;
		while(n < sz)n *= 2;
		node.resize(2 * n - 1, identify);

		for(int i = 0;i < sz;i++)node[i + n - 1] = v[i];
		for(int i = n - 2;i >= 0;i--)node[i] = combine(node[2 * i + 1], node[2 * i + 2]);
	}

	segment_tree(int _n, F _combine, T _identify) : combine(_combine), identify(_identify){
		int sz = _n;
		n = 1;
		while(n < sz)n *= 2;
		node.resize(2 * n - 1, identify);
	}

	T operator[](int x) {return node[x + n - 1]; }

	void set(int x, T val){
		x += (n - 1);

		node[x] = val;
		while(x > 0){
			x = (x - 1) / 2;
			node[x] = combine(node[2 * x + 1], node[2 * x + 2]);
		}
	}

	T fold(int a, int b, int k = 0, int l = 0, int r = -1){
		if(r < 0) r = n;

		if(r <= a || b <= l)return identify;
		
		if(a <= l && r <= b)return node[k];

		T vl = fold(a, b, 2 * k + 1, l, (l + r) / 2);
		T vr = fold(a, b, 2 * k + 2, (l + r) / 2, r);
		return combine(vl, vr);
	}
};
#line 5 "verify/aoj/dsl/2_A___segment_tree_0-indexed.test.cpp"

void mmrz::solve(){
	int n, q;
	cin >> n >> q;
	auto combine = [](int a, int b){return min(a, b); };
	segment_tree<int> seg(n, combine, inf<int>());
	while(q--){
		int com, x, y;
		cin >> com >> x >> y;
		if(com)cout << seg.fold(x, y + 1) << '\n';
		else seg.set(x, y);
	}
}
Back to top page