結果

問題 No.2292 Interval Union Find
ユーザー miiemiie
提出日時 2024-11-08 21:03:52
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 205 ms / 5,000 ms
コード長 6,805 bytes
コンパイル時間 12,140 ms
コンパイル使用メモリ 350,072 KB
実行使用メモリ 13,056 KB
最終ジャッジ日時 2024-11-08 21:04:22
合計ジャッジ時間 21,817 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 58 ms
5,248 KB
testcase_05 AC 91 ms
5,248 KB
testcase_06 AC 57 ms
5,248 KB
testcase_07 AC 86 ms
5,248 KB
testcase_08 AC 91 ms
5,248 KB
testcase_09 AC 90 ms
5,248 KB
testcase_10 AC 77 ms
5,248 KB
testcase_11 AC 79 ms
5,248 KB
testcase_12 AC 100 ms
5,248 KB
testcase_13 AC 68 ms
5,248 KB
testcase_14 AC 68 ms
5,248 KB
testcase_15 AC 72 ms
5,248 KB
testcase_16 AC 69 ms
5,248 KB
testcase_17 AC 85 ms
5,248 KB
testcase_18 AC 142 ms
12,928 KB
testcase_19 AC 188 ms
12,800 KB
testcase_20 AC 205 ms
13,056 KB
testcase_21 AC 153 ms
8,832 KB
testcase_22 AC 180 ms
8,960 KB
testcase_23 AC 152 ms
8,960 KB
testcase_24 AC 151 ms
8,960 KB
testcase_25 AC 154 ms
8,960 KB
testcase_26 AC 158 ms
8,960 KB
testcase_27 AC 175 ms
8,832 KB
testcase_28 AC 156 ms
8,960 KB
testcase_29 AC 154 ms
8,832 KB
testcase_30 AC 154 ms
8,960 KB
testcase_31 AC 153 ms
8,960 KB
testcase_32 AC 153 ms
8,960 KB
testcase_33 AC 152 ms
8,960 KB
testcase_34 AC 154 ms
8,832 KB
testcase_35 AC 180 ms
8,960 KB
testcase_36 AC 152 ms
8,960 KB
testcase_37 AC 179 ms
9,088 KB
testcase_38 AC 152 ms
8,960 KB
testcase_39 AC 150 ms
8,960 KB
testcase_40 AC 155 ms
8,960 KB
testcase_41 AC 44 ms
5,248 KB
testcase_42 AC 46 ms
5,248 KB
testcase_43 AC 49 ms
5,248 KB
testcase_44 AC 54 ms
5,248 KB
testcase_45 AC 54 ms
5,248 KB
testcase_46 AC 54 ms
5,248 KB
testcase_47 AC 62 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all> 
using namespace atcoder;

// 数値型
using mint = modint998244353;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int,int>;
using Pll = pair<ll, ll>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;

// vector関連
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
template<typename T>
using vc = vector<T>;
template<typename T>
using vvc = vector<vc<T>>;
template<typename T>
using vvvc = vector<vvc<T>>;
template<typename T>
using vvvvc = vector<vvvc<T>>;

// priority_queue
template<typename T>
using pq = priority_queue<T>;
template<typename T>
using pqg = priority_queue<T, vc<T>, greater<T>>;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = a; i < (int)(b); i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define MIN(vec) *min_element(vec)
#define MAX(vec) *max_element(vec)
#define next_perm(vec) (vec).begin(), (vec).end()
#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define el "\n"
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define minus1 cout << -1 << el
#define EPS 1e-8
#define Equal(a, b) (fabs((a)-(b)) < EPS) 
#define dbg(x) cerr << #x << "=" << x << el 

// 定数
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};
constexpr int DX8[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int DY8[] = {0, 1, 0, -1, 1, -1, 1, -1};

template<typename T1, typename T2>
ostream &operator<< (ostream &os, pair<T1, T2> p) {
    os << "{" << p.first << "," << p.second << "}";
    return os;
}
template<typename T>
ostream &operator<< (ostream &os, vc<T> &vec) {
    int sz = vec.size();
    rep(i, sz){
        os << vec[i] << (i==sz-1?"":" ");
    }
    return os;
}

istream &operator>> (istream &is, mint &a) {
    ll x;
    is >> x;
    a = x;
    return is;
}
template<typename T1, typename T2>
istream &operator>> (istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}
template<typename T>
istream &operator>> (istream &is, vc<T> &vec) {
    int sz = vec.size();
    rep(i, sz) { is >> vec[i]; }
    return is;
}
/// @brief aとｂの最大値をaに格納。更新があったかbool値を返す
/// @tparam T1 
/// @tparam T2 
/// @param a 
/// @param b 
/// @return bool
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b){
    bool ret = a<b;
    if(ret) a = b;
    return ret;
}

/// @brief aとｂの最小値をaに格納。更新があったかbool値を返す
/// @tparam T1 
/// @tparam T2 
/// @param a 
/// @param b 
/// @return bool
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b){
    bool ret = a>b;
    if(ret) {a = b;}
    return ret;
}

inline void YesNo(bool flag){
    if(flag) {Yes;}
    else {No;}
    return;
}

inline void YESNO(bool flag){
    if(flag) {YES;}
    else {NO;}
    return;
}

inline bool outof(ll x, ll xlim){
    return (x<0 || x>=xlim);
}

template<typename T>
inline T sqnorm(T x, T y){
    return x*x+y*y;
}

/// @brief char->int
/// @param c 
/// @return int
inline int ctoi(char c){
    return c-'0';
}

/// @brief xを素因数分解
/// @param x 
/// @return vector<Pli>, 素因数の昇順に {p, cnt}
vector<Pli> prime_fact(ll x){
    vector<Pli> ret;
    for(ll i=2; i*i<=x; i++){
        if(x%i == 0){
            ret.emplace_back(i, 0);
            while(x%i == 0){
                ret.back().second++;
                x /= i;
            }
        }
    }
    if(x != 1) ret.emplace_back(x, 1);
    return ret;
}

/// @brief xの約数列挙
/// @param x 
/// @return vll, 約数の昇順
vll divisor_enum(ll x){
    vector<ll> ret;
    for(ll i=1; i*i<=x; i++){
        if(x%i == 0){
            ret.push_back(x/i);
            ret.push_back(i);
        }
    }
    sort(all(ret));
    UNIQUE(ret);
    return ret;
}

/// @brief 繰り返し二乗法。
/// @tparam T 
/// @param x 
/// @param k 
/// @param op 
/// @param e 
/// @return 
template<typename T>
T pow_t(T x, ll k, T (*op)(T, T), T (*e)()){
    T ret = e();
    while(k){
        if(k&1) ret *= x;
        x *= x;
        k >>= 1;
    }
    return ret;
}

ll powll(ll x, ll k){
    return pow_t<ll>(x, k, [](ll a, ll b) -> ll{return a*b;}, []() -> ll{return 1;});
}

inline int pop_cnt(ll x) { return __builtin_popcountll(x); }
inline int top_bit(ll x) { return (x==0?-1:63-__builtin_clzll(x));}

void main2();

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main2();
}


void main2(){
  int n, q;
  cin >> n >> q;
  set<P> st;
  auto add = [&](int l, int r) -> void{
    while(1){
      auto it = st.upper_bound({l, n+1});
      if(it == st.end()) break;
      if(it->first >= r) break;
      chmax(r, it->second);
      st.erase(it);
    }
    auto it = st.upper_bound({l, n+1});
    if(it == st.begin() || prev(it)->second <= l) st.insert({l, r});
    else{
      l = prev(it)->first;
      chmax(r, prev(it)->second);
      st.erase(prev(it));
      st.insert({l, r});
    }
    return;
  };
  
  auto del = [&](int l, int r) -> void{
    while(1){
      auto it = st.lower_bound({l, -1});
      if(it == st.end() || it->first >= r) break;
      int nr = it->second;
      st.erase(it);
      if(nr > r) st.insert({r, nr});
    }
    auto it = st.lower_bound({l, -1});
    if(it != st.begin() && prev(it)->second > l){
      int nl = prev(it)->first;
      int nr = prev(it)->second;
      st.erase(prev(it));
      if(nl < l) st.insert({nl, l});
      if(r < nr) st.insert({r, nr});
    } 
    return;
  };
  
  auto same = [&](int u, int v) -> bool{
    auto it = st.upper_bound({u, INF});
    if(it == st.begin() || prev(it)->second <= v) return u == v;
    return true;
  };
  
  auto size = [&](int x) -> int{
    auto it = st.upper_bound({x, INF});
    if(it == st.begin() || prev(it)->second <= x) return 1;
    return prev(it)->second - prev(it)->first;
  };
  rep(i, q){
    int t;
    cin >> t;
    if(t == 1){
      int l, r;
      cin >> l >> r;
      add(l-1, r);
    }
    if(t == 2){
      int l, r;
      cin >> l >> r;
      del(l, r-1);
    }
    if(t == 3){
      int u, v;
      cin >> u >> v;
      u--;v--;
      if(u > v) swap(u, v);
      cout << (same(u, v)?1:0) << el;
    }
    if(t == 4){
      int v;
      cin >> v;
      v--;
      cout << size(v) << el;
    }
  }
}
0