結果
問題 | No.2292 Interval Union Find |
ユーザー |
![]() |
提出日時 | 2023-05-05 22:41:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 222 ms / 5,000 ms |
コード長 | 5,538 bytes |
コンパイル時間 | 4,026 ms |
コンパイル使用メモリ | 265,964 KB |
最終ジャッジ日時 | 2025-02-12 19:00:04 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 44 |
ソースコード
#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 noya2using 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();}