結果

問題 No.2292 Interval Union Find
ユーザー hitonanodehitonanode
提出日時 2023-05-05 21:46:24
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 488 ms / 5,000 ms
コード長 9,343 bytes
コンパイル時間 2,849 ms
コンパイル使用メモリ 201,560 KB
実行使用メモリ 60,764 KB
最終ジャッジ日時 2024-11-23 06:47:11
合計ジャッジ時間 22,021 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 329 ms
14,032 KB
testcase_05 AC 298 ms
13,844 KB
testcase_06 AC 309 ms
14,012 KB
testcase_07 AC 294 ms
13,464 KB
testcase_08 AC 451 ms
42,276 KB
testcase_09 AC 468 ms
42,464 KB
testcase_10 AC 471 ms
42,344 KB
testcase_11 AC 464 ms
42,220 KB
testcase_12 AC 470 ms
58,908 KB
testcase_13 AC 439 ms
41,448 KB
testcase_14 AC 458 ms
41,964 KB
testcase_15 AC 488 ms
42,172 KB
testcase_16 AC 458 ms
41,700 KB
testcase_17 AC 482 ms
42,516 KB
testcase_18 AC 300 ms
41,132 KB
testcase_19 AC 428 ms
60,636 KB
testcase_20 AC 421 ms
60,764 KB
testcase_21 AC 396 ms
59,708 KB
testcase_22 AC 386 ms
59,840 KB
testcase_23 AC 397 ms
59,752 KB
testcase_24 AC 387 ms
59,836 KB
testcase_25 AC 394 ms
59,844 KB
testcase_26 AC 401 ms
59,832 KB
testcase_27 AC 397 ms
59,712 KB
testcase_28 AC 387 ms
59,836 KB
testcase_29 AC 384 ms
59,836 KB
testcase_30 AC 382 ms
59,708 KB
testcase_31 AC 390 ms
59,836 KB
testcase_32 AC 385 ms
59,708 KB
testcase_33 AC 387 ms
59,712 KB
testcase_34 AC 390 ms
59,712 KB
testcase_35 AC 418 ms
59,712 KB
testcase_36 AC 393 ms
59,704 KB
testcase_37 AC 387 ms
59,860 KB
testcase_38 AC 374 ms
59,840 KB
testcase_39 AC 372 ms
59,712 KB
testcase_40 AC 373 ms
59,708 KB
testcase_41 AC 80 ms
13,912 KB
testcase_42 AC 88 ms
13,808 KB
testcase_43 AC 112 ms
14,048 KB
testcase_44 AC 183 ms
14,044 KB
testcase_45 AC 192 ms
14,016 KB
testcase_46 AC 196 ms
14,092 KB
testcase_47 AC 239 ms
14,532 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/lazysegtree>

using S = pint;  // (len, active sum)
S op(S l, S r) { return l + r; }
S e() { return {0, 0}; }

using F = pair<bool, bool>;  // (updated, 01)
S mapping(F f, S x) {
    if (f.first) {
        return {x.first, f.second ? x.first : 0};
    } else {
        return x;
    }
}
F composition(F fnew, F gold) { return fnew.first ? fnew : gold; }
F id() { return {false, false}; }

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<tuple<int, int, int>> query;

    vector<int> xs{1, 2, N - 1, N, N + 1};
    REP(q, Q) {
        int tp;
        cin >> tp;
        if (tp == 1 or tp == 2 or tp == 3) {
            int l, r;
            cin >> l >> r;
            query.emplace_back(tp, l, r);
            xs.emplace_back(l - 1);
            xs.emplace_back(l);
            xs.emplace_back(l + 1);
            xs.emplace_back(r - 1);
            xs.emplace_back(r);
            xs.emplace_back(r + 1);
        } else if (tp == 4) {
            int v;
            cin >> v;
            query.emplace_back(tp, v, -1);
            xs.emplace_back(v - 1);
            xs.emplace_back(v);
            xs.emplace_back(v + 1);
        } else {
            exit(1);
        }
    }
    dbg(query);
    for (auto &x : xs) x = clamp(x, 1, N + 1);
    xs = sort_unique(xs);
    dbg(xs);
    vector<S> init;
    REP(i, xs.size() - 1) {
        int d = xs.at(i + 1) - xs.at(i);
        init.emplace_back(S{d, 0});
    }
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> tree(init);

    dbg("DONE");

    for (auto [tp, l, r] : query) {
        if (tp == 1) {
            l = arglb(xs, l), r = arglb(xs, r);
            dbg(make_tuple(tp, l, r));
            tree.apply(l, r, {true, true});
        } else if (tp == 2) {
            l = arglb(xs, l), r = arglb(xs, r);
            dbg(make_tuple(tp, l, r));
            tree.apply(l, r, {true, false});
        } else if (tp == 3) {
            l = arglb(xs, l), r = arglb(xs, r);
            // dbg(make_tuple(l, r));
            if (l > r) swap(l, r);
            auto p = tree.prod(l, r);
            cout << (p.first == p.second) << '\n';
        } else if (tp == 4) {
            const int i = arglb(xs, l);

            auto f = [](S x) { return x.first == x.second; };

            int lo = tree.min_left(i, f);
            int hi = tree.max_right(i, f);
            cout << tree.prod(lo, hi).first + 1 << '\n';
        } else {
            exit(1);
        }
    }
}
0