#867091 (C++17) No.2292 Interval Union Find

提出ソース

結果

問題	No.2292 Interval Union Find
ユーザー	jabee
提出日時	2023-05-06 23:45:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	392 ms / 5,000 ms
コード長	6,386 bytes
コンパイル時間	4,282 ms
コンパイル使用メモリ	279,632 KB
実行使用メモリ	48,384 KB
最終ジャッジ日時	2024-05-03 06:15:48
合計ジャッジ時間	23,582 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 18,944 KB
testcase_01	AC	25 ms 18,944 KB
testcase_02	AC	24 ms 19,072 KB
testcase_03	AC	25 ms 18,944 KB
testcase_04	AC	287 ms 36,820 KB
testcase_05	AC	274 ms 36,992 KB
testcase_06	AC	273 ms 36,708 KB
testcase_07	AC	262 ms 36,852 KB
testcase_08	AC	382 ms 48,000 KB
testcase_09	AC	392 ms 48,000 KB
testcase_10	AC	383 ms 48,024 KB
testcase_11	AC	385 ms 48,000 KB
testcase_12	AC	378 ms 48,000 KB
testcase_13	AC	380 ms 47,616 KB
testcase_14	AC	373 ms 47,908 KB
testcase_15	AC	386 ms 48,000 KB
testcase_16	AC	382 ms 47,616 KB
testcase_17	AC	390 ms 48,128 KB
testcase_18	AC	296 ms 48,384 KB
testcase_19	AC	372 ms 48,384 KB
testcase_20	AC	367 ms 48,384 KB
testcase_21	AC	355 ms 48,204 KB
testcase_22	AC	354 ms 48,128 KB
testcase_23	AC	345 ms 48,256 KB
testcase_24	AC	364 ms 48,256 KB
testcase_25	AC	348 ms 48,256 KB
testcase_26	AC	357 ms 48,256 KB
testcase_27	AC	355 ms 48,256 KB
testcase_28	AC	345 ms 48,256 KB
testcase_29	AC	359 ms 48,200 KB
testcase_30	AC	345 ms 48,256 KB
testcase_31	AC	348 ms 48,228 KB
testcase_32	AC	347 ms 48,300 KB
testcase_33	AC	346 ms 48,212 KB
testcase_34	AC	344 ms 48,240 KB
testcase_35	AC	354 ms 48,352 KB
testcase_36	AC	352 ms 48,256 KB
testcase_37	AC	353 ms 48,128 KB
testcase_38	AC	346 ms 48,372 KB
testcase_39	AC	348 ms 48,256 KB
testcase_40	AC	352 ms 48,200 KB
testcase_41	AC	96 ms 33,024 KB
testcase_42	AC	101 ms 33,024 KB
testcase_43	AC	115 ms 33,024 KB
testcase_44	AC	163 ms 33,024 KB
testcase_45	AC	177 ms 33,024 KB
testcase_46	AC	172 ms 32,996 KB
testcase_47	AC	203 ms 33,408 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
ll op(ll a, ll b){return a&b;}
ll e(){return 1;}
ll mapping(ll f,ll a){
    if(f == -1)return a;
    else return f;
}
ll composition(ll f, ll g){
    if(f == -1)return g;
    else return f;
}
ll id(){return -1;}

void _main() {
    ll n,q;
    cin >> n >> q;
    vector<ll>comp(2*q+1);
    vector<vector<ll>>que(q);
    rep(qi,0,q){
        ll t;
        cin >> t;
        if(t == 1 || t == 2){
            ll l,r;
            cin >> l >> r;
            comp[2*qi] = l;
            comp[2*qi+1] = r;
            que[qi] = {t,l,r};
        }
        if(t == 3){
            ll u,v;
            cin >> u >> v;
            comp[2*qi] = u;
            comp[2*qi+1] = v;
            que[qi] = {t,u,v};
        }
        if(t == 4){
            ll v;
            cin >> v;
            comp[2*qi] = v;
            comp[2*qi+1] = 0;
            que[qi] = {t,v};      
        }
    }
    sort(all(comp));
    comp.erase(unique(all(comp)),comp.end());
    lazy_segtree<ll,op,e,ll,mapping,composition,id>seg(comp.size());
    rep(i,0,comp.size())seg.apply(i,i+1,0);
    rep(qi,0,q){
        vector<ll>vec = que[qi];
        ll t = vec[0];
        if(t == 1){
            ll l,r;
            l = vec[1];
            r = vec[2];
            l = lower_bound(comp.begin(),comp.end(),l) - comp.begin();
            r = lower_bound(comp.begin(),comp.end(),r) - comp.begin();
            seg.apply(l,r,1);
        }
        if(t == 2){
            ll l,r;
            l = vec[1];
            r = vec[2];
            l = lower_bound(comp.begin(),comp.end(),l) - comp.begin();
            r = lower_bound(comp.begin(),comp.end(),r) - comp.begin();
            seg.apply(l,r,0);    
        }  
        if(t == 3){
            ll u,v;
            u = vec[1];
            v = vec[2];
            u = lower_bound(comp.begin(),comp.end(),u) - comp.begin();
            v = lower_bound(comp.begin(),comp.end(),v) - comp.begin();
            if(v < u)swap(u,v);
            cout << seg.prod(u,v) << "\n";    
        }
        if(t == 4){
            ll v;
            v = vec[1];
            v = lower_bound(comp.begin(),comp.end(),v) - comp.begin();
            ll L = seg.min_left(v, [](int u){return u != 0;} );
            ll R = seg.max_right(v, [](int u){return u != 0;} );
            cout << comp[R] - comp[L] + 1 << "\n";
        }
    }
}

yukicoder

結果

テストケース

ソースコード