oj.uz

Submission #805802

# Submission time Handle Problem Language Result Execution time Memory
805802 2023-08-03T23:50:46 Z farhan132 Segments (IZhO18_segments) C++17
22 / 100
 1106 ms 8956 KB 
/***Farhan132***/
// #pragma GCC optimize("Ofast,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
const ll inf = numeric_limits<int>::max()-1;
const ll INF = (ll)2e18;
 
// ll dx[]={0,1,0,-1};
// ll dy[]={1,0,-1,0};
// ll dxx[]={0,1,0,-1,1,1,-1,-1};
// ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 450;

vector < ll > R[450], sz[450];
vector < ii > req[450];
ll lx[450], rx[450], S[450]; ii range[450 * 450];
ll block_cnt = 1;

void add(ll l, ll r){
    for(ll block = 0; block < block_cnt; block++){
        if(lx[block] <= l && l <= rx[block]){
            S[block]++;
            R[block].pb(r);
            sz[block].pb(r - l + 1);
            req[block].pb({l, r});
            for(ll i = S[block] - 1; i >= 1; i--){
                if(R[block][i - 1] > R[block][i]) swap(R[block][i], R[block][i - 1]);
                if(sz[block][i - 1] > sz[block][i]) swap(sz[block][i], sz[block][i - 1]);
                if(req[block][i - 1] > req[block][i]) swap(req[block][i], req[block][i - 1]);
            }
            return;
        }
    }
}
void remove(ll l, ll r){
    // NOTE: must TLE for multiple l
    for(ll block = 0; block < block_cnt; block++){
        if(lx[block] <= l && l <= rx[block] && S[block]){
            auto it = *lower_bound(req[block].begin(), req[block].begin() + S[block], make_pair(l, r)); 
            if(it != make_pair(l, r)) continue;
            S[block]--;
            for(ll i = 0; i < req[block].size(); i++){
                if(req[block][i] == make_pair(l, r)){
                    req[block].erase(req[block].begin() + i);
                    break;
                }
            }
            for(ll i = 0; i < R[block].size(); i++){
                if(R[block][i] == r){
                    R[block].erase(R[block].begin() + i);
                    break;
                }
            }
            for(ll i = 0; i < sz[block].size(); i++){
                if(sz[block][i] == r - l + 1){
                    sz[block].erase(sz[block].begin() + i);
                    break;
                }
            }
            return;
        }
    }
}
ll query(ll lastans, ll t){
    ll l, r, k; cin >> l >> r >> k;

    l ^= t * lastans;
    r ^= t * lastans;

    if(l > r) swap(l, r);
    if(r - l + 1 < k){
        return 0;
    } 

    ll ans = 0;
    if(k == 0){
        for(ll i = 0; i < block_cnt; i++) ans += req[i].size();
        return ans;
    }

    for(ll i = 0; i < block_cnt; i++){
        if(lx[i] + k - 1 > r) break;
        if(rx[i] <= l){
            if(!S[i]) continue;
            ans += (S[i] - (upper_bound(R[i].begin(), R[i].begin() + S[i], l + k - 2) - R[i].begin()));
            
            // for(auto u : R[i]){
            //     ans += (u >= l + k - 1);
            // }
            continue;
        }
        if(l <= lx[i] && rx[i] + k - 1 <= r){
            if(!S[i]) continue;
            ans += (S[i] - (upper_bound(sz[i].begin(), sz[i].begin() + S[i], k - 1) - sz[i].begin()));            
            continue;
        }

        for(auto [x, y] : req[i]){
            ans += ( (min(y, r) - max(l, x) + 1) >= k);
        }
    }
    return ans;
}
void build(){
    vector < ii > a;
    for(ll i = 0; i < block_cnt; i++){
        for(auto x : req[i]) a.pb(x);
        R[i].clear(); sz[i].clear(); req[i].clear();
        S[i] = 0;
    }
    sort(a.begin(), a.end());
    block_cnt = (a.size() - 1) / N; block_cnt++;
    for(ll i = 0; i < a.size(); i++){
        auto [l, r] = a[i];
        R[i / N].pb(r);
        sz[i / N].pb(r - l + 1);
        req[i / N].pb(a[i]);
        S[i / N]++;
    }

    for(ll i = 0; i < block_cnt; i++){
        sort(R[i].begin(), R[i].end());
        sort(sz[i].begin(), sz[i].end());
    }
    lx[0] = 0; rx[block_cnt - 1] = inf;
    for(ll i = 1; i < block_cnt; i++){
        lx[i] = rx[i - 1] = req[i][0].ff;
    }

    return;
}

void solve(){

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

    ll changes = 0;

    ll cur = 0;
    lx[0] = 0; rx[0] = inf; S[0] = 0;
    ll lastans = 0;
    mem(S, 0);

    while(n--){
        ll T; cin >> T;
        if(T == 1){
            cin >> range[++cur].ff >> range[cur].ss;
            range[cur].ff ^= (t * lastans);
            range[cur].ss ^= (t * lastans);
            if(range[cur].ff > range[cur].ss) swap(range[cur].ff, range[cur].ss);
            add(range[cur].ff, range[cur].ss);
            changes++;
        }
        if(T == 2){
            ll id; cin >> id;
            remove(range[id].ff, range[id].ss);
        }
        if(T == 3){
            lastans = query(lastans, t);
            cout << lastans << '\n';
        }
        if(changes >= N){
            changes = 0;
            build();
        }
    }
    
   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0; //cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

segments.cpp: In function 'void remove(ll, ll)':
segments.cpp:74:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:80:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             for(ll i = 0; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp:86:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |             for(ll i = 0; i < sz[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~
segments.cpp: In function 'void build()':
segments.cpp:145:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
segments.cpp: In function 'void solve()':
segments.cpp:179:26: warning: operation on 'cur' may be undefined [-Wsequence-point]
  179 |             cin >> range[++cur].ff >> range[cur].ss;
      |                          ^~~~~
segments.cpp: In function 'int main()':
segments.cpp:217:15: warning: unused variable 'CT' [-Wunused-variable]
  217 |     ll T = 1, CT = 0; //cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 728 KB Output is correct
9 Correct 7 ms 700 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 8 ms 664 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 592 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 589 ms 4792 KB Output is correct
2 Correct 587 ms 4848 KB Output is correct
3 Correct 617 ms 4776 KB Output is correct
4 Correct 631 ms 5164 KB Output is correct
5 Correct 1082 ms 8796 KB Output is correct
6 Correct 1106 ms 8956 KB Output is correct
7 Correct 589 ms 4772 KB Output is correct
8 Correct 593 ms 4876 KB Output is correct
9 Correct 592 ms 4724 KB Output is correct
10 Correct 296 ms 2212 KB Output is correct
11 Correct 380 ms 2768 KB Output is correct
12 Correct 789 ms 7232 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1020 KB Output is correct
2 Correct 34 ms 964 KB Output is correct
3 Correct 78 ms 940 KB Output is correct
4 Correct 36 ms 976 KB Output is correct
5 Correct 785 ms 7372 KB Output is correct
6 Correct 684 ms 5532 KB Output is correct
7 Correct 728 ms 6100 KB Output is correct
8 Correct 1070 ms 8884 KB Output is correct
9 Correct 1040 ms 8640 KB Output is correct
10 Correct 748 ms 6148 KB Output is correct
11 Correct 148 ms 1356 KB Output is correct
12 Correct 773 ms 7312 KB Output is correct
13 Correct 684 ms 5716 KB Output is correct
14 Correct 383 ms 3352 KB Output is correct
15 Correct 359 ms 3136 KB Output is correct
16 Correct 275 ms 2376 KB Output is correct
17 Correct 569 ms 4844 KB Output is correct
18 Correct 568 ms 4752 KB Output is correct
19 Correct 560 ms 4780 KB Output is correct
20 Correct 587 ms 4836 KB Output is correct
21 Correct 174 ms 1564 KB Output is correct
22 Correct 469 ms 4384 KB Output is correct
23 Incorrect 599 ms 5232 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 884 KB Output is correct
2 Correct 39 ms 972 KB Output is correct
3 Correct 37 ms 932 KB Output is correct
4 Correct 45 ms 872 KB Output is correct
5 Correct 882 ms 7824 KB Output is correct
6 Correct 251 ms 1716 KB Output is correct
7 Correct 931 ms 8072 KB Output is correct
8 Correct 307 ms 2332 KB Output is correct
9 Incorrect 449 ms 4292 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 728 KB Output is correct
9 Correct 7 ms 700 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 8 ms 664 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 592 KB Output is correct
21 Correct 589 ms 4792 KB Output is correct
22 Correct 587 ms 4848 KB Output is correct
23 Correct 617 ms 4776 KB Output is correct
24 Correct 631 ms 5164 KB Output is correct
25 Correct 1082 ms 8796 KB Output is correct
26 Correct 1106 ms 8956 KB Output is correct
27 Correct 589 ms 4772 KB Output is correct
28 Correct 593 ms 4876 KB Output is correct
29 Correct 592 ms 4724 KB Output is correct
30 Correct 296 ms 2212 KB Output is correct
31 Correct 380 ms 2768 KB Output is correct
32 Correct 789 ms 7232 KB Output is correct
33 Correct 35 ms 884 KB Output is correct
34 Correct 39 ms 972 KB Output is correct
35 Correct 37 ms 932 KB Output is correct
36 Correct 45 ms 872 KB Output is correct
37 Correct 882 ms 7824 KB Output is correct
38 Correct 251 ms 1716 KB Output is correct
39 Correct 931 ms 8072 KB Output is correct
40 Correct 307 ms 2332 KB Output is correct
41 Incorrect 449 ms 4292 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 728 KB Output is correct
9 Correct 7 ms 700 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 8 ms 664 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 592 KB Output is correct
21 Correct 589 ms 4792 KB Output is correct
22 Correct 587 ms 4848 KB Output is correct
23 Correct 617 ms 4776 KB Output is correct
24 Correct 631 ms 5164 KB Output is correct
25 Correct 1082 ms 8796 KB Output is correct
26 Correct 1106 ms 8956 KB Output is correct
27 Correct 589 ms 4772 KB Output is correct
28 Correct 593 ms 4876 KB Output is correct
29 Correct 592 ms 4724 KB Output is correct
30 Correct 296 ms 2212 KB Output is correct
31 Correct 380 ms 2768 KB Output is correct
32 Correct 789 ms 7232 KB Output is correct
33 Correct 50 ms 1020 KB Output is correct
34 Correct 34 ms 964 KB Output is correct
35 Correct 78 ms 940 KB Output is correct
36 Correct 36 ms 976 KB Output is correct
37 Correct 785 ms 7372 KB Output is correct
38 Correct 684 ms 5532 KB Output is correct
39 Correct 728 ms 6100 KB Output is correct
40 Correct 1070 ms 8884 KB Output is correct
41 Correct 1040 ms 8640 KB Output is correct
42 Correct 748 ms 6148 KB Output is correct
43 Correct 148 ms 1356 KB Output is correct
44 Correct 773 ms 7312 KB Output is correct
45 Correct 684 ms 5716 KB Output is correct
46 Correct 383 ms 3352 KB Output is correct
47 Correct 359 ms 3136 KB Output is correct
48 Correct 275 ms 2376 KB Output is correct
49 Correct 569 ms 4844 KB Output is correct
50 Correct 568 ms 4752 KB Output is correct
51 Correct 560 ms 4780 KB Output is correct
52 Correct 587 ms 4836 KB Output is correct
53 Correct 174 ms 1564 KB Output is correct
54 Correct 469 ms 4384 KB Output is correct
55 Incorrect 599 ms 5232 KB Output isn't correct
56 Halted 0 ms 0 KB -