結果
問題 | No.2292 Interval Union Find |
ユーザー | kwm_t |
提出日時 | 2023-05-05 22:54:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 185 ms / 5,000 ms |
コード長 | 4,361 bytes |
コンパイル時間 | 3,226 ms |
コンパイル使用メモリ | 212,440 KB |
実行使用メモリ | 15,908 KB |
最終ジャッジ日時 | 2023-08-15 05:49:24 |
合計ジャッジ時間 | 12,827 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 61 ms
4,384 KB |
testcase_05 | AC | 101 ms
4,384 KB |
testcase_06 | AC | 60 ms
4,380 KB |
testcase_07 | AC | 89 ms
4,380 KB |
testcase_08 | AC | 94 ms
4,384 KB |
testcase_09 | AC | 95 ms
4,384 KB |
testcase_10 | AC | 82 ms
4,384 KB |
testcase_11 | AC | 78 ms
4,380 KB |
testcase_12 | AC | 95 ms
4,384 KB |
testcase_13 | AC | 69 ms
4,380 KB |
testcase_14 | AC | 75 ms
4,384 KB |
testcase_15 | AC | 77 ms
4,380 KB |
testcase_16 | AC | 72 ms
4,380 KB |
testcase_17 | AC | 88 ms
4,380 KB |
testcase_18 | AC | 171 ms
15,864 KB |
testcase_19 | AC | 183 ms
15,908 KB |
testcase_20 | AC | 185 ms
15,868 KB |
testcase_21 | AC | 161 ms
10,972 KB |
testcase_22 | AC | 158 ms
10,888 KB |
testcase_23 | AC | 153 ms
10,696 KB |
testcase_24 | AC | 154 ms
10,688 KB |
testcase_25 | AC | 153 ms
10,732 KB |
testcase_26 | AC | 150 ms
10,780 KB |
testcase_27 | AC | 152 ms
10,868 KB |
testcase_28 | AC | 152 ms
10,704 KB |
testcase_29 | AC | 154 ms
10,780 KB |
testcase_30 | AC | 150 ms
10,716 KB |
testcase_31 | AC | 153 ms
10,720 KB |
testcase_32 | AC | 154 ms
10,876 KB |
testcase_33 | AC | 157 ms
10,872 KB |
testcase_34 | AC | 158 ms
10,712 KB |
testcase_35 | AC | 164 ms
10,712 KB |
testcase_36 | AC | 169 ms
10,720 KB |
testcase_37 | AC | 167 ms
10,744 KB |
testcase_38 | AC | 177 ms
10,720 KB |
testcase_39 | AC | 160 ms
10,744 KB |
testcase_40 | AC | 156 ms
10,780 KB |
testcase_41 | AC | 42 ms
4,380 KB |
testcase_42 | AC | 44 ms
4,384 KB |
testcase_43 | AC | 51 ms
4,384 KB |
testcase_44 | AC | 54 ms
4,380 KB |
testcase_45 | AC | 55 ms
4,384 KB |
testcase_46 | AC | 56 ms
4,384 KB |
testcase_47 | AC | 64 ms
4,384 KB |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair<int,int> template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } template<typename T> struct RangeSet { // ReadMe:閉区間なことに注意 // member set<pair<T, T>>st; T TINF; // constructor RangeSet(T lim) { TINF = lim + 1; st.emplace(-TINF, -TINF); st.emplace(TINF, TINF); } // cover check bool IsCovered(T l, T r) { auto ite = prev(st.lower_bound({ l + 1,l + 1 })); return ((ite->first <= l) && (r <= ite->second)); } bool IsCovered(T x) { return IsCovered(x, x); } // get by covered pair<T, T> ByCovered(T l, T r) { auto ite = prev(st.lower_bound({ l + 1,l + 1 })); if ((ite->first <= l) && (r <= ite->second)) return *ite; return { -TINF, -TINF }; } pair<T, T> ByCovered(T x) { return ByCovered(x, x); } // getFront pair<T, T>getFront() { auto itr = st.begin(); itr++; return *itr; } // getBack pair<T, T>getBack() { auto itr = st.end(); itr--; itr--; return *itr; } // insert T Insert(T l, T r) { //insertでmargeしないver //st.emplace(l, r); //return 0; T sumErase = T(0); auto ite = prev(st.lower_bound({ l + 1,l + 1 })); // no need merge if (IsCovered(l, r))return sumErase; // first merge pos if ((ite->first <= l) && (l <= (ite->second + 1))) { l = ite->first; sumErase += ite->second - ite->first + 1; ite = st.erase(ite); } else ite = next(ite); // merge while (r > ite->second) { sumErase += ite->second - ite->first + 1; ite = st.erase(ite); } if (((ite->first - 1) <= r) && (r <= ite->second)) { r = ite->second; sumErase += ite->second - ite->first + 1; st.erase(ite); } st.emplace(l, r); return (r - l + 1) - sumErase; } T Insert(T x) { return Insert(x, x); } // erase T Erase(T l, T r) { T ret = T(0); auto get = ByCovered(l, r); if ((-TINF) != get.first) { st.erase(get); if (get.first != l)st.emplace(get.first, l - 1); if (get.second != r)st.emplace(r + 1, get.second); ret += r - l + 1; return ret; } auto ite = prev(st.lower_bound({ l + 1,l + 1 })); // first erase if ((ite->first <= l) && (l <= ite->second)) { ret += ite->second - l + 1; if (ite->first != l)st.emplace(ite->first, l - 1); ite = st.erase(ite); } else ite = next(ite); // erase while (ite->second <= r) { ret += ite->second - ite->first + 1; ite = st.erase(ite); } // last if ((ite->first <= r) && (r <= ite->second)) { ret += r - ite->first + 1; if (ite->second != r) st.emplace(r + 1, ite->second); st.erase(ite); } return ret; } T Erase(T x) { return Erase(x, x); } // range count int size() { return st.size() - 2; } // mex T Mex(T x = 0) { if (!IsCovered(x)) return x; auto ite = prev(st.lower_bound({ x + 1, x + 1 })); return ite->second + 1; } // debug void Debug() { for (auto[l, r] : st)cout << l / 2 << " " << r / 2 << endl; } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); RangeSet<long long>rs(LINF); int n, q; cin >> n >> q; while (q--) { int t; cin >> t; if (1 == t) { int l, r; cin >> l >> r; rs.Insert(l * 2, r * 2); } else if (2 == t) { int l, r; cin >> l >> r; rs.Erase(l * 2 + 1, r * 2 - 1); } else if (3 == t) { int l, r; cin >> l >> r; if (l > r)swap(l, r); if (l == r) { cout << 1 << endl; continue; } bool ans = rs.IsCovered(l * 2, r * 2); cout << ans << endl; } else { int v; cin >> v; auto get = rs.ByCovered(v * 2); long long l = get.first / 2; long long r = get.second / 2; long long ans = r - l + 1; cout << ans << endl; } //if (t <= 2) rs.Debug(); } return 0; }