結果
| 問題 |
No.2292 Interval Union Find
|
| コンテスト | |
| ユーザー |
 jabee
|
| 提出日時 | 2023-05-06 23:45:16 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 398 ms / 5,000 ms |
| コード長 | 6,386 bytes |
| コンパイル時間 | 4,515 ms |
| コンパイル使用メモリ | 266,004 KB |
| 最終ジャッジ日時 | 2025-02-12 20:52:10 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 44 |
ソースコード
#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";
}
}
}