test/RangeSet.test.cpp

• View this file on GitHub
• Last update: 2021-03-02 07:38:17+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/problems/2880

Depends on

• DataStructure/RangeSet.cpp

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/2880"
#include "./../DataStructure/RangeSet.cpp"
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#include <algorithm>
using namespace std;

struct Data {
	bool query;
	int a, b, i;
	Data() = default;
	Data(bool _q, int _a, int _b, int _i) : query(_q), a(_a), b(_b), i(_i) {}
	friend bool operator<(const Data& d1, const Data& d2) {
		return !d1.query < !d2.query;
	}
};

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);

	int n, m, q;
	cin >> n >> m >> q;
	map<int, vector<Data>> data_map;
	for (int i = 0; i < m; ++i) {
		int d, a, b;
		cin >> d >> a >> b;
		data_map[d].emplace_back(false, a, b, i);
	}
	for (int i = 0; i < q; ++i) {
		int e, s, t;
		cin >> e >> s >> t;
		data_map[e].emplace_back(true, s, t, i);
	}

	vector<bool> ans(q);
	RangeSet<int> range_set;
	for (auto [time, datas] : data_map) {
		sort(datas.begin(), datas.end());
		for (const Data& data : datas) {
			if (data.query) {
				if (data.a < data.b) {
					ans[data.i] = range_set.contains(data.a, data.b - 1);
				} else {
					ans[data.i] = true;
				}
			} else {
				range_set.insert(data.a, data.b - 1);
			}
		}
	}
	for (bool f : ans) {
		cout << (f ? "Yes" : "No") << '\n';
	}
}

#line 1 "test/RangeSet.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/2880"
#line 2 "DataStructure/RangeSet.cpp"
#include <set>
#include <utility>
#include <optional>
#include <limits>
#include <cassert>

template <class T> class RangeSet {
public:
	using size_type = std::size_t;
	using value_type = T;
	using range_type = std::pair<value_type, value_type>;

private:
	constexpr static value_type MIN = std::numeric_limits<value_type>::min();
	constexpr static value_type MAX = std::numeric_limits<value_type>::max();
	std::set<range_type> ranges;
	value_type size_m;

	auto prev_range_iterator(value_type x) const {
		return prev(ranges.lower_bound({x + 1, x + 1}));
	}
	range_type prev_range(value_type x) const {
		return *prev_range_iterator(x);
	}

public:
	RangeSet() : size_m(0) {
		ranges.emplace(MIN, MIN);
		ranges.emplace(MAX, MAX);
	};
	value_type size() const {
		return size_m;
	}
	size_type count_ranges() const {
		return ranges.size() - 2;
	}
	bool empty() const {
		return size() == 0;
	}
	void clear() {
		ranges.clear();
		ranges.emplace(MIN, MIN);
		ranges.smplace(MAX, MAX);
		size_m = 0;
	}
	const std::set<range_type>& data() const {
		return ranges;
	}
	bool contains(value_type l, value_type r) const {
		assert(l <= r);
		auto [L, R] = prev_range(l);
		return L <= l && r <= R;
	}
	bool contains(value_type x) const {
		return contains(x, x);
	}
	value_type insert(value_type l, value_type r) {
		assert(l <= r);
		auto it = prev_range_iterator(l);
		value_type inserted_count = 0;
		if (l < it->first || it->second < r) {
			if (it->first <= l && l <= it->second + 1) {
				l = it->first;
				inserted_count -= it->second - it->first + 1;
				it = ranges.erase(it);
			} else {
				it = next(it);
			}
			while (r > it->second) {
				inserted_count -= it->second - it->first + 1;
				it = ranges.erase(it);
			}
			if (it->first - 1 <= r && r <= it->second) {
				r = it->second;
				inserted_count -= it->second - it->first + 1;
				ranges.erase(it);
			}
			inserted_count += r - l + 1;
			ranges.emplace(l, r);
		}
		size_m += inserted_count;
		return inserted_count;
	}
	value_type insert(value_type x) {
		return insert(x, x);
	}
	value_type erase(value_type l, value_type r) {
		assert(l <= r);
		auto it = prev_range_iterator(l);
		value_type erased_count = 0;
		if (it->first <= l && r <= it->second) {
			if (it->first < l) {
				ranges.emplace(it->first, l - 1);
			}
			if (r < it->second) {
				ranges.emplace(r + 1, it->second);
			}
			ranges.erase(it);
			erased_count = r - l + 1;
		} else {
			if (it->first <= l && l <= it->second) {
				erased_count += it->second - l + 1;
				if (it->first < l) {
					ranges.emplace(it->first, l - 1);
				}
				it = ranges.erase(it);
			} else {
				it = next(it);
			}
			while (it->second <= r) {
				erased_count += it->second - it->first + 1;
				it = ranges.erase(it);
			}
			if (it->first <= r && r <= it->second) {
				erased_count += r - it->first + 1;
				if (r < it->second) {
					ranges.emplace(r + 1, it->second);
				}
				ranges.erase(it);
			}
		}
		size_m -= erased_count;
		return erased_count;
	}
	value_type erase(value_type x) {
		return erase(x, x);
	}
	value_type find_next(value_type x) const {
		auto [l, r] = prev_range(x);
		if (l <= x && x <= r) {
			return x;
		} else {
			return l;
		}
	}
	value_type mex(value_type x) const {
		auto [l, r] = prev_range(x);
		if (l <= x && x <= r) {
			return r + 1;
		} else {
			return x;
		}
	}
	std::optional<range_type> find_range(value_type x) const {
		range_type r = prev_range(x);
		if (r.first <= x && x <= r.second) {
			return r;
		} else {
			return std::nullopt;
		}
	}
};
#line 3 "test/RangeSet.test.cpp"
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#include <algorithm>
using namespace std;

struct Data {
	bool query;
	int a, b, i;
	Data() = default;
	Data(bool _q, int _a, int _b, int _i) : query(_q), a(_a), b(_b), i(_i) {}
	friend bool operator<(const Data& d1, const Data& d2) {
		return !d1.query < !d2.query;
	}
};

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);

	int n, m, q;
	cin >> n >> m >> q;
	map<int, vector<Data>> data_map;
	for (int i = 0; i < m; ++i) {
		int d, a, b;
		cin >> d >> a >> b;
		data_map[d].emplace_back(false, a, b, i);
	}
	for (int i = 0; i < q; ++i) {
		int e, s, t;
		cin >> e >> s >> t;
		data_map[e].emplace_back(true, s, t, i);
	}

	vector<bool> ans(q);
	RangeSet<int> range_set;
	for (auto [time, datas] : data_map) {
		sort(datas.begin(), datas.end());
		for (const Data& data : datas) {
			if (data.query) {
				if (data.a < data.b) {
					ans[data.i] = range_set.contains(data.a, data.b - 1);
				} else {
					ans[data.i] = true;
				}
			} else {
				range_set.insert(data.a, data.b - 1);
			}
		}
	}
	for (bool f : ans) {
		cout << (f ? "Yes" : "No") << '\n';
	}
}

Back to top page