Submission #1269788

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269788		binminh01	Segments (IZhO18_segments)	C++20	75 / 100	5092 ms	6444 KiB

segments

#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt,tune=native")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

constexpr int mod = 1e9 + 7, mod2 = 998244353;
constexpr double eps = 1e-9;
const double PI = acos(-1);
constexpr ull npos = string::npos;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
mt19937_64 mt64(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
ll rand(ll l, ll r) {return uniform_int_distribution<ll>(l, r)(mt64);}
int Log2(int n) {return 31 - __builtin_clz(n);}
ll Log2(ll n) {return 63 - __builtin_clzll(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
template<class A, class B> bool ckmin(A &a, const B &b) {return a > b ? a = b, 1: 0;}
template<class A, class B> bool ckmax(A &a, const B &b) {return a < b ? a = b, 1: 0;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) a = a*10 + s[i] - '0'; a*=(s[0] == '-' ? -1: 1); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; if (a < 0) out << '-', a = -a; if (a == 0) s+='0'; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

int inter(int a, int b, int l, int r) {
    return min(b, r) - max(a, l) + 1;
}
constexpr int N = 200000, S = 700;
struct node {
    int l, r, i;
    node(int l = 0, int r = 0, int i = 0): l(l), r(r), i(i) {}
};
struct ds {
    vpair a;
    vvi b;
    void build(const vpair &c) {
        a = c; b.clear(); b.reserve((sz(a) + S - 1)/S);
        Sort(a);
        for (int i = 0; i < sz(a); i+=S) {
            b.pb(vi(min(S, sz(a) - i)));
            for (int j = 0; j < S && i + j < sz(a); ++j) b.back()[j] = a[i + j].second;
            Sort(b.back());
        }
    }
    //a[i] < l, b[i] < r
    int get00(int l, int r) {
        int x = 0;
        For(i,0,sz(b)){
            if (a[min((i + 1)*S, sz(a)) - 1].first < l) x+=Lower(b[i], r);
            else {
                for (int j = i*S; j < sz(a) && a[j].first < l; ++j) x+=a[j].second < r;
                return x;
            }
        }
        return x;
    }
    //a[i] < l, b[i] >= r
    int get01(int l, int r) {
        int x = 0;
        For(i,0,sz(b)){
            if (a[min((i + 1)*S, sz(a)) - 1].first < l) x+=sz(b[i]) - Lower(b[i], r);
            else {
                for (int j = i*S; j < sz(a) && a[j].first < l; ++j) x+=a[j].second >= r;
                return x;
            }
        }
        return x;
    }
    //a[i] >= l, b[i] < r
    int get10(int l, int r) {
        int x = 0;
        Fore(i,sz(b)-1,0){
            if (a[i*S].first >= l) x+=Lower(b[i], r);
            else {
                for (int j = min((i + 1)*S, sz(a)) - 1; j >= 0 && a[j].first >= l; --j) x+=a[j].second < r;
                return x;
            }
        }
        return x;
    }
    //a[i] >= l, b[i] >= r
    int get11(int l, int r) {
        int x = 0;
        Fore(i,sz(b)-1,0){
            if (a[i*S].first >= l) x+=sz(b[i]) - Lower(b[i], r);
            else {
                for (int j = min((i + 1)*S, sz(a)) - 1; j >= 0 && a[j].first >= l; --j) x+=a[j].second >= r;
                return x;
            }
        }
        return x;
    }
    //a[i] < v, b[i] in [l, r]
    int get0(int v, int l, int r) {
        int x = 0;
        For(i,0,sz(b)){
            if (a[min((i + 1)*S, sz(a)) - 1].first < v) x+=Upper(b[i], r) - Lower(b[i], l);
            else {
                for (int j = i*S; j < sz(a) && a[j].first < v; ++j) x+=a[j].second >= l && a[j].second <= r;
                return x;
            }
        }
        return x;
    }
    //a[i] >= v, b[i] in [l, r]
    int get1(int v, int l, int r) {
        int x = 0;
        Fore(i,sz(b)-1,0){
            if (a[i*S].first >= v) x+=Upper(b[i], r) - Lower(b[i], l);
            else {
                for (int j = min((i + 1)*S, sz(a)) - 1; j >= 0 && a[j].first >= v; --j) x+=a[j].second >= l && a[j].second <= r;
                return x;
            }
        }
        return x;
    }
    //a[i] < v
    int geta0(int v) {
        int x = 0;
        For(i,0,sz(b)){
            if (a[min((i + 1)*S, sz(a)) - 1].first < v) x+=sz(b[i]);
            else {
                for (int j = i*S; j < sz(a) && a[j].first < v; ++j) ++x;
                return x;
            }
        }
        return x;
    }
    //a[i] >= v
    int geta1(int v) {
        int x = 0;
        Fore(i,sz(b)-1,0){
            if (a[i*S].first >= v) x+=sz(b[i]);
            else {
                for (int j = min((i + 1)*S, sz(a)) - 1; j >= 0 && a[j].first >= v; --j) ++x;
                return x;
            }
        }
        return x;
    }
};
bool ck[N];
pii w[N];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int Q, T; cin >> Q >> T;
    vector<node> p;
    ds ab, ac;
    // ab.build({{1, 2}, {3, 5}});
    // cout << ab.geta1(2);
    int n = 0, m = 0, ans = 0;
    vi ad, dl;
    For(q,0,Q){
        if (q % 1500 == 0) {
            // cout << "adding\n";
            // For(i,0,n) if (!ck[i]) cout << w[i] << '\n';
            // cout << "finish\n";
            m = 0;
            For(i,0,n) m+=!ck[i];
            vpair d; d.reserve(m);
            For(i,0,n) if (!ck[i]) d.pb(w[i]);
            ab.build(d);
            for (auto &[l, r]: d) r-=l - 1;
            ac.build(d);
            m = n, ad.clear(), dl.clear();
        }
        int o; cin >> o;
        if (o == 1) {
            int l, r; cin >> l >> r;
            l^=T*ans, r^=T*ans;
            if (l > r) swap(l, r);
            // cout << "new seg " << l << ' ' << r << '\n';
            ad.pb(n), w[n] = {l, r}, ++n;
        } else if (o == 2) {
            int i; cin >> i;
            ck[--i] = 1;
            // cout << "del seg " << w[i] << '\n';
            if (i < m) dl.pb(i);
        } else {
            int l, r, k; cin >> l >> r >> k;
            l^=T*ans, r^=T*ans;
            if (l > r) swap(l, r);
            // cout << "query " << l << ' ' << r << ' ' << k << '\n';
            if (r - l + 1 < k) {cout << (ans = 0) << '\n'; continue;}
            ans = ab.get01(r - k + 2, l + k - 1);
            ans += ab.get0(min(l + k - 1, r - k + 2), l, l + k - 2) - ab.get0(l, l, l + k - 2);
            ans -= ac.get0(r - k + 2, 0, k - 1) - ac.get0(l, 0, k - 1);
            // cout << ans << ' ';
            trav(i,ad) ans+=(!ck[i] && inter(w[i].first, w[i].second, l, r) >= k);
            // cout << ans << ' ';
            trav(i,dl) ans-=inter(w[i].first, w[i].second, l, r) >= k;
            cout << ans << '\n';
        }
    }
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 1.0*clock()/CLOCKS_PER_SEC << " s";
    return 0;
}

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