結果

問題 No.2292 Interval Union Find
ユーザー noya2noya2
提出日時 2023-05-05 22:41:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 255 ms / 5,000 ms
コード長 5,538 bytes
コンパイル時間 5,096 ms
コンパイル使用メモリ 277,508 KB
実行使用メモリ 14,856 KB
最終ジャッジ日時 2024-05-02 17:39:43
合計ジャッジ時間 15,109 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 73 ms
5,376 KB
testcase_05 AC 112 ms
5,376 KB
testcase_06 AC 73 ms
5,376 KB
testcase_07 AC 109 ms
5,376 KB
testcase_08 AC 110 ms
5,376 KB
testcase_09 AC 110 ms
5,376 KB
testcase_10 AC 97 ms
5,376 KB
testcase_11 AC 94 ms
5,376 KB
testcase_12 AC 114 ms
5,376 KB
testcase_13 AC 81 ms
5,376 KB
testcase_14 AC 88 ms
5,376 KB
testcase_15 AC 93 ms
5,376 KB
testcase_16 AC 88 ms
5,376 KB
testcase_17 AC 110 ms
5,376 KB
testcase_18 AC 135 ms
13,056 KB
testcase_19 AC 210 ms
13,056 KB
testcase_20 AC 255 ms
14,856 KB
testcase_21 AC 171 ms
9,216 KB
testcase_22 AC 172 ms
9,088 KB
testcase_23 AC 172 ms
9,216 KB
testcase_24 AC 180 ms
9,216 KB
testcase_25 AC 185 ms
9,344 KB
testcase_26 AC 184 ms
9,216 KB
testcase_27 AC 175 ms
9,088 KB
testcase_28 AC 179 ms
9,088 KB
testcase_29 AC 186 ms
9,088 KB
testcase_30 AC 182 ms
9,088 KB
testcase_31 AC 181 ms
9,088 KB
testcase_32 AC 179 ms
9,088 KB
testcase_33 AC 183 ms
9,088 KB
testcase_34 AC 181 ms
9,088 KB
testcase_35 AC 184 ms
9,216 KB
testcase_36 AC 178 ms
9,088 KB
testcase_37 AC 179 ms
9,088 KB
testcase_38 AC 182 ms
9,216 KB
testcase_39 AC 184 ms
9,216 KB
testcase_40 AC 182 ms
9,216 KB
testcase_41 AC 50 ms
5,376 KB
testcase_42 AC 51 ms
5,376 KB
testcase_43 AC 57 ms
5,376 KB
testcase_44 AC 65 ms
5,376 KB
testcase_45 AC 65 ms
5,376 KB
testcase_46 AC 68 ms
5,376 KB
testcase_47 AC 84 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,m,n) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}


void solve(){
    int n, q; cin >> n >> q;
    set<P> st;
    while (q--){
        int t; cin >> t;
        if (t == 1){
            int l, r; cin >> l >> r;
            auto ite = st.upper_bound(P(l,INF));
            if (ite != st.begin() && prev(ite)->second >= l) ite = prev(ite);
            int nl = l, nr = r;
            vector<P> del;
            for (; ite != st.end() && ite->first <= r; ite++){
                chmin(nl,ite->first);
                chmax(nr,ite->second);
                del.emplace_back(*ite);
            }
            for (auto p : del) st.erase(p);
            st.insert(PL(nl,nr)); //out(nl,nr);
        }
        if (t == 2){
            int l, r; cin >> l >> r;
            auto ite = st.upper_bound(P(l,INF));
            if (ite != st.begin() && prev(ite)->second > l) ite = prev(ite);
            vector<P> del, add;
            for (; ite != st.end() && ite->first < r; ite++){
                del.emplace_back(*ite);
                if (ite->first < l) add.emplace_back(ite->first,l);
                if (ite->second > r) add.emplace_back(r,ite->second);
            }
            for (auto p : del) st.erase(p);
            for (auto p : add) st.insert(p);
        }
        if (t == 3){
            int u, v; cin >> u >> v;
            if (u == v){
                out(1);
                continue;
            }
            if (u > v) swap(u,v);
            auto ite = st.upper_bound(P(u,INF));
            if (ite != st.begin() && prev(ite)->second >= u){
                ite = prev(ite);
                out(ite->second >= v ? 1 : 0);
            }
            else out(0);
        }
        if (t == 4){
            int v; cin >> v;
            auto ite = st.upper_bound(P(v,INF));
            if (ite != st.begin() && prev(ite)->second >= v){
                ite = prev(ite); //out(*ite);
                out(ite->second-ite->first+1);
            }
            else {
                out(1);
            }
        } //out();
    }
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0