제출 #154910

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154910		andrew	Segments (IZhO18_segments)	C++17	7 / 100	5090 ms	8340 KiB

segments

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1123456;
const ll N = 2e5;
const ll inf = 3e18;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T> void vout(T s){cout << s << endl;exit(0);}

int main(){
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    ll n, t;
    cin >> n >> t;

    ll last = 0;

    vector <pll> a;

    multiset <pll> s;

    while(n--){
        ll type;
        cin >> type;
        if(type == 1){
            ll l, r;
            cin >> l >> r;
            l = (l ^ (t * last));
            r = (r ^ (t * last));
            if(l > r)swap(l, r);
            a.p_b({l, r});
            s.insert({l, r});
        }else if(type == 2){
            ll id;
            cin >> id;
            s.erase(s.find(a[id - 1]));
        }else{
            ll l, r, k;
            cin >> l >> r >> k;
          	if(!k)while(1);
            l = (l ^ (t * last));
            r = (r ^ (t * last));
            if(l > r)swap(l, r);
            ll ans = 0;
            for(auto i : s){
                ll le = max(i.fi, l), ri = min(i.se, r);
                if(ri - le + 1 >= k)ans++;
            }
            cout << ans << "\n";
            last = ans;
        }
    }

    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25