제출 #1156814

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156814		steveonalex	Segments (IZhO18_segments)	C++17	7 / 100	1064 ms	131072 KiB

segments

/*

 ________  ___  ________  ________          ________   ___  ________  ________  ________     
    |\   ____\|\  \|\   ____\|\   __  \        |\   ___  \|\  \|\   ____\|\   ____\|\   __  \    
    \ \  \___|\ \  \ \  \___|\ \  \|\  \       \ \  \\ \  \ \  \ \  \___|\ \  \___|\ \  \|\  \   
     \ \  \  __\ \  \ \  \  __\ \   __  \       \ \  \\ \  \ \  \ \  \  __\ \  \  __\ \   __  \  
      \ \  \|\  \ \  \ \  \|\  \ \  \ \  \       \ \  \\ \  \ \  \ \  \|\  \ \  \|\  \ \  \ \  \ 
       \ \_______\ \__\ \_______\ \__\ \__\       \ \__\\ \__\ \__\ \_______\ \_______\ \__\ \__\
        \|_______|\|__|\|_______|\|__|\|__|        \|__| \|__|\|__|\|_______|\|_______|\|__|\|__|
                                                                                                 
                                                                                             
                                                                                             
     ________  ________  ________  ________  ___  ___  ________ _________  ___  ________  ________      
|\   __  \|\   __  \|\   __  \|\   ___ \|\  \|\  \|\   ____\\___   ___\\  \|\   __  \|\   ___  \    
\ \  \|\  \ \  \|\  \ \  \|\  \ \  \_|\ \ \  \\\  \ \  \___\|___ \  \_\ \  \ \  \|\  \ \  \\ \  \   
 \ \   ____\ \   _  _\ \  \\\  \ \  \ \\ \ \  \\\  \ \  \       \ \  \ \ \  \ \  \\\  \ \  \\ \  \  
  \ \  \___|\ \  \\  \\ \  \\\  \ \  \_\\ \ \  \\\  \ \  \____   \ \  \ \ \  \ \  \\\  \ \  \\ \  \ 
   \ \__\    \ \__\\ _\\ \_______\ \_______\ \_______\ \_______\  \ \__\ \ \__\ \_______\ \__\\ \__\
    \|__|     \|__|\|__|\|_______|\|_______|\|_______|\|_______|   \|__|  \|__|\|_______|\|__| \|__|
                                                                                                    
                                                                                                    
    Written by: giga nigga                                                                               

*/

// #include "largest.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double wow = (double) ((ull) rng()) / ((ull)(0-1));
    return wow * (r - l) + l;
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int BLOCK = 2000;
const int INF = 2e9 + 69;

struct FenwickTreeFake{
    static const int BLOCK = 100;
    vector<pair<int, int>> points;
    vector<int> X, Y;
    vector<vector<int>> pos;
    vector<vector<int>> pref;
    
    FenwickTreeFake(){
    }

    void add_points(pair<int, int> p){
        points.push_back(p);
    }

    void build_tree(){
        for(auto i: points){
            X.push_back(i.first);
            Y.push_back(i.second);
        }
        X.push_back(-INF); Y.push_back(-INF);
        remove_dup(X); remove_dup(Y);

        pos.resize(X.size());
        pref.resize(X.size() / BLOCK + 1, vector<int> (Y.size()));

        for(auto i: points){
            i.first = lower_bound(ALL(X), i.first) - X.begin();
            pos[i.first].push_back(i.second);

            i.second = lower_bound(ALL(Y), i.second) - Y.begin();
            pref[i.first / BLOCK][i.second]++;
        }

        for(int i = 0; i < (int) pos.size(); ++i)
            sort(ALL(pos[i]));

        for(int i = 0; i < (int) pref.size(); ++i){
            for(int j = 1; j < (int) pref[i].size(); ++j) pref[i][j] += pref[i][j-1];
            if (i > 0){
                for(int j = 0; j < (int) pref[i].size(); ++j) pref[i][j] += pref[i-1][j];
            }
        }
    }

    int get(int i, int j){
        i = upper_bound(ALL(X), i) - X.begin() - 1;
        int _j = upper_bound(ALL(Y), j) - Y.begin() - 1;

        int ans = 0;
        if (i >= BLOCK) ans += pref[i / BLOCK - 1][_j];
        for(int _i = i - i % BLOCK; _i <= i; ++_i){
            ans += upper_bound(ALL(pos[_i]), j) - pos[_i].begin();
        }

        return ans;
    }

    void clear(){
        points.clear(); X.clear(); Y.clear();
        pos.clear(); pref.clear();
    }
};


void solve(){
    int q, t; cin >> q >> t;
    vector<pair<int, int>> range_list;
    vector<bool> activated;

    vector<array<int, 3>> ranges;

    int last_ans = 0;
    FenwickTreeFake st1, st2;
    int tot = 0;
    vector<int> len_list;

    for(int it = 1; it <= q; ++it){
        if (it % BLOCK == 0){
            tot = 0;
            len_list.clear();
            st1.clear(); st2.clear();
            ranges.clear();
            for(int i = 0; i < (int) range_list.size(); ++i) if (activated[i]){
                tot++;
                int l, r; tie(l, r) = range_list[i];
                int len = r - l + 1;
                st1.add_points(make_pair(-len, r));
                st2.add_points(make_pair(-len, -l));

                len_list.push_back(len);
            }
            sort(ALL(len_list));
            st1.build_tree(); st2.build_tree();
        }
        int type; cin >> type;
        if (type == 1){
            int a, b; cin >> a >> b;
            a ^= t * last_ans;
            b ^= t * last_ans;
            if (a > b) swap(a, b);
            range_list.push_back({a, b});
            activated.push_back(1);
            ranges.push_back({{a, b, 1}});
        }
        else if (type == 2){
            int id; cin >> id;
            id--;
            activated[id] = 0;

            int a, b; tie(a, b) = range_list[id];
            ranges.push_back({{a, b, -1}});
        }
        else{
            int l, r, k; cin >> l >> r >> k;
            l ^= t * last_ans;
            r ^= t * last_ans;

            if (l > r) swap(l, r);

            if (r - l + 1 < k){
                cout << 0 << "\n";
                last_ans = 0;
                continue;
            }

            int ans = tot;
            for(auto i: ranges){
                int L = max(l, i[0]);
                int R = min(r, i[1]);
                if (R - L + 1 >= k) ans += i[2];
            }
            ans -= lower_bound(ALL(len_list), k) - len_list.begin();
            ans -= st1.get(-k, l + k - 2);
            ans -= st2.get(-k, -(r - k + 2));

            cout << ans << "\n";
            last_ans = ans;
        }
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    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