結果
| 問題 | No.2292 Interval Union Find |
| ユーザー |
 emthrm
|
| 提出日時 | 2023-05-05 22:07:26 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 189 ms / 5,000 ms |
| コード長 | 6,070 bytes |
| コンパイル時間 | 3,150 ms |
| コンパイル使用メモリ | 256,220 KB |
| 実行使用メモリ | 16,000 KB |
| 最終ジャッジ日時 | 2024-11-23 07:57:01 |
| 合計ジャッジ時間 | 11,019 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 44 |
ソースコード
#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 = 998244353;// constexpr int MOD = 1000000007;constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};constexpr int 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 IntervalsManagedBySet {using IntervalsType = std::set<std::pair<T, T>>;IntervalsType intervals{{std::numeric_limits<T>::lowest(), std::numeric_limits<T>::lowest()},{std::numeric_limits<T>::max(), std::numeric_limits<T>::max()}};IntervalsManagedBySet() = default;bool contains(const T x) const { return contains(x, x); }bool contains(const T left, const T right) const {return find(left, right) != intervals.end();}std::pair<typename IntervalsType::const_iterator, bool> erase(const T x) {typename IntervalsType::const_iterator it = intervals.lower_bound({x, x});if (it->first == x) {const T right = it->second;it = intervals.erase(it);if (x + 1 <= right) it = intervals.emplace(x + 1, right).first;} else {it = std::prev(it);const auto [left, right] = *it;if (right < x) return {std::next(it), false};intervals.erase(it);it = std::next(intervals.emplace(left, x - 1).first);if (x + 1 <= right) it = intervals.emplace(x + 1, right).first;}return {it, true};}std::pair<typename IntervalsType::const_iterator, T> erase(const T left, const T right) {assert(left <= right);typename IntervalsType::const_iterator it =intervals.lower_bound({left, left});T res = 0;for (; it->second <= right; it = intervals.erase(it)) {res += it->second - it->first + 1;}if (it->first <= right) {res += right - it->first + 1;const T r = it->second;intervals.erase(it);it = intervals.emplace(right + 1, r).first;}if (left <= std::prev(it)->second) {it = std::prev(it);const auto [l, r] = *it;intervals.erase(it);if (right < r) {res += right - left + 1;intervals.emplace(right + 1, r);} else {res += r - left + 1;}it = std::next(intervals.emplace(l, left - 1).first);}return {it, res};}typename IntervalsType::const_iterator find(const T x) const {return find(x, x);}typename IntervalsType::const_iterator find(const T left, const T right) const {typename IntervalsType::const_iterator it =intervals.lower_bound({left, left});if (left < it->first) it = std::prev(it);return it->first <= left && right <= it->second ? it : intervals.end();}std::pair<typename IntervalsType::const_iterator, bool> insert(const T x) {typename IntervalsType::const_iterator it = intervals.lower_bound({x, x});if (it->first == x) return {it, false};if (x <= std::prev(it)->second) return {std::prev(it), false};T left = x, right = x;if (x + 1 == it->first) {right = it->second;it = intervals.erase(it);}if (std::prev(it)->second == x - 1) {it = std::prev(it);left = it->first;intervals.erase(it);}return {intervals.emplace(left, right).first, true};}std::pair<typename IntervalsType::const_iterator, T> insert(T left, T right) {assert(left <= right);typename IntervalsType::const_iterator it =intervals.lower_bound({left, left});if (left <= std::prev(it)->second) {it = std::prev(it);left = it->first;}T res = 0;if (left == it->first && right <= it->second) return {it, res};for (; it->second <= right; it = intervals.erase(it)) {res -= it->second - it->first + 1;}if (it->first <= right) {res -= it->second - it->first + 1;right = it->second;it = intervals.erase(it);}res += right - left + 1;if (right + 1 == it->first) {right = it->second;it = intervals.erase(it);}if (std::prev(it)->second == left - 1) {it = std::prev(it);left = it->first;intervals.erase(it);}return {intervals.emplace(left, right).first, res};}T mex(const T x = 0) const {auto it = intervals.lower_bound({x, x});if (x <= std::prev(it)->second) it = std::prev(it);return x < it->first ? x : it->second + 1;}friend std::ostream& operator<<(std::ostream& os,const IntervalsManagedBySet& x) {if (x.intervals.size() == 2) return os;auto it = next(x.intervals.begin());while (true) {os << '[' << it->first << ", " << it->second << ']';it = next(it);if (next(it) == x.intervals.end()) break;os << ' ';}return os;}};int main() {int n, q; cin >> n >> q;IntervalsManagedBySet<ll> s;while (q--) {int type; cin >> type;if (type == 1) {int l, r; cin >> l >> r;s.insert(l * 2, r * 2);} else if (type == 2) {int l, r; cin >> l >> r;s.erase((l + 1) * 2 - 1, (r - 1) * 2 + 1);} else if (type == 3) {int u, v; cin >> u >> v;if (u > v) swap(u, v);cout << (u == v || s.contains(u * 2, v * 2) ? "1\n" : "0\n");} else if (type == 4) {int v; cin >> v;const auto it = s.find(v * 2);cout << (it == s.intervals.end() ? 1 : (it->second - it->first + 2) / 2) << '\n';}// cout << s << '\n';}return 0;}