oj.uz

Submission #475772

# Submission time Handle Problem Language Result Execution time Memory
475772 2021-09-24T04:08:22 Z NhatMinh0208 Segments (IZhO18_segments) C++14
7 / 100
 1686 ms 51180 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 500
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
struct node
{
    int l=0,r=0,val=0;
    node(int _l=0, int _r=0, int _val=0)
    {
        l=_l;
        r=_r;
        val=_val;
    }
};
struct seg
{
    vector<node> tre[80001];
    void reset(int c, int l, int r)
    {
        tre[c].clear();
        tre[c].emplace_back(0,0,0);
        if (l<r)
        {
            int mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
        }
    }
    int upd(int c, int l, int r, int t, int x)
    {
        if ((l<=t)and(t<=r))
        {
            node prv=tre[c][tre[c].size()-1];
            if (l==r)
            {
                prv.l=0;
                prv.r=0;
                prv.val=x;
            }
            else
            {
                int mid=(l+r)/2;
                prv.l=upd((c<<1),l,mid,t,x);
                prv.r=upd((c<<1)+1,mid+1,r,t,x);
                prv.val=tre[(c<<1)][prv.l].val+tre[(c<<1)+1][prv.r].val;
            }

                tre[c].push_back(prv);
        }
        return tre[c].size()-1;
    }
    int get(int c, int ind, int l, int r, int tl, int tr)
    {
        if ((tl>r)or(tr<l)) return 0;
        if ((l>=tl)and(r<=tr))
        {
            return tre[c][ind].val;
        }
        else
        {
            int mid=(l+r)/2;
            int a=get((c<<1),tre[c][ind].l,l,mid,tl,tr);
            int b=get((c<<1)+1,tre[c][ind].r,mid+1,r,tl,tr);
            return (a+b);
        }
    }
};

seg str,stl;

vector<pair<ll,int>> vr,vl,vc;

vector<int> vec;
ll n,m,i,j,k,t,x,t1,u,v,a,b,u1,u2,u3,u4;
int res;
int l[200001],r[200001];
int pl[200001];
int pr[200001];
int active[200001];
int main()
{
	fio;
    cin>>t>>x;
    for (t1=0;t1<t;t1++) {
        cin>>u;
        if (u==1) {
            cin>>a>>b;
            a^=(x*res);
            b^=(x*res);
            if (a>b) swap(a,b);
            n++;
            active[n]=1;
            l[n]=a;
            r[n]=b;
            vec.push_back(n);
        } else if (u==2) {
            cin>>v;
            active[v]=0;
            vec.push_back(-v);
        } else {
            cin>>a>>b>>v;
            a^=(x*res);
            b^=(x*res);
            if (a>b) swap(a,b);
            res=0;
            if (b-a+1<v) {
            } else {
                for (auto g : vec) {
                    if (r[abs(g)]-l[abs(g)]+1>=v && r[abs(g)]>=a+v-1 && l[abs(g)]<=b-v+1) {
                        if (g>0) res++; else res--;
                    }
                }
                if (m) {
                    auto it=lower_bound(vc.begin(),vc.end(),pair<ll,int>(v,-1));
                    res+=vc.end()-it;
                    auto it2=lower_bound(vr.begin(),vr.end(),pair<ll,int>(a+v-2,1e9));
                    if (it2!=vr.begin()) {
                        res-=str.get(1,(vc.end()-it),1,m,1,(it2-vr.begin()));
                    }
                    auto it3=lower_bound(vl.begin(),vl.end(),pair<ll,int>(b-v+2,-1));
                    if (it3!=vl.end()) {
                        res-=stl.get(1,(vc.end()-it),1,m,(it3-vl.begin()+1),m);
                    }
                }
            }
            cout<<res<<endl;
        }
        if (t1%mag==mag-1) {
            vec.clear();
            vl.clear();
            vr.clear();
            vc.clear();
            for (i=1;i<=n;i++) if (active[i]) {
                vr.push_back({r[i],i});
                vl.push_back({l[i],i});
                vc.push_back({r[i]-l[i]+1,i});
            }
            m=vl.size();
            str.reset(1,1,m);
            stl.reset(1,1,m);
            sort(vl.begin(),vl.end());
            sort(vr.begin(),vr.end());
            sort(vc.begin(),vc.end());
            for (i=0;i<m;i++) pl[vl[i].se]=i+1;
            for (i=0;i<m;i++) pr[vr[i].se]=i+1;
            for (i=m-1;i>=0;i--) {
                str.upd(1,1,m,pr[vc[i].se],1);
            }
            for (i=m-1;i>=0;i--) {
                stl.upd(1,1,m,pl[vc[i].se],1);
            }
        }
    }    
}
// N;

Compilation message

segments.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4044 KB Output is correct
2 Correct 2 ms 4044 KB Output is correct
3 Correct 7 ms 4172 KB Output is correct
4 Correct 8 ms 4172 KB Output is correct
5 Correct 25 ms 7004 KB Output is correct
6 Correct 27 ms 6184 KB Output is correct
7 Correct 11 ms 4596 KB Output is correct
8 Correct 23 ms 5836 KB Output is correct
9 Correct 20 ms 5708 KB Output is correct
10 Correct 24 ms 7100 KB Output is correct
11 Correct 26 ms 5708 KB Output is correct
12 Correct 22 ms 5728 KB Output is correct
13 Correct 33 ms 7072 KB Output is correct
14 Correct 20 ms 5708 KB Output is correct
15 Correct 8 ms 4172 KB Output is correct
16 Correct 8 ms 4268 KB Output is correct
17 Correct 15 ms 4968 KB Output is correct
18 Correct 23 ms 6272 KB Output is correct
19 Correct 14 ms 4984 KB Output is correct
20 Correct 15 ms 5068 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1420 ms 50952 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 5452 KB Output is correct
2 Correct 104 ms 6608 KB Output is correct
3 Correct 130 ms 7000 KB Output is correct
4 Correct 97 ms 6632 KB Output is correct
5 Runtime error 1686 ms 51180 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 4872 KB Output is correct
2 Correct 102 ms 4928 KB Output is correct
3 Correct 103 ms 5068 KB Output is correct
4 Correct 110 ms 4932 KB Output is correct
5 Runtime error 1362 ms 51120 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4044 KB Output is correct
2 Correct 2 ms 4044 KB Output is correct
3 Correct 7 ms 4172 KB Output is correct
4 Correct 8 ms 4172 KB Output is correct
5 Correct 25 ms 7004 KB Output is correct
6 Correct 27 ms 6184 KB Output is correct
7 Correct 11 ms 4596 KB Output is correct
8 Correct 23 ms 5836 KB Output is correct
9 Correct 20 ms 5708 KB Output is correct
10 Correct 24 ms 7100 KB Output is correct
11 Correct 26 ms 5708 KB Output is correct
12 Correct 22 ms 5728 KB Output is correct
13 Correct 33 ms 7072 KB Output is correct
14 Correct 20 ms 5708 KB Output is correct
15 Correct 8 ms 4172 KB Output is correct
16 Correct 8 ms 4268 KB Output is correct
17 Correct 15 ms 4968 KB Output is correct
18 Correct 23 ms 6272 KB Output is correct
19 Correct 14 ms 4984 KB Output is correct
20 Correct 15 ms 5068 KB Output is correct
21 Runtime error 1420 ms 50952 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4044 KB Output is correct
2 Correct 2 ms 4044 KB Output is correct
3 Correct 7 ms 4172 KB Output is correct
4 Correct 8 ms 4172 KB Output is correct
5 Correct 25 ms 7004 KB Output is correct
6 Correct 27 ms 6184 KB Output is correct
7 Correct 11 ms 4596 KB Output is correct
8 Correct 23 ms 5836 KB Output is correct
9 Correct 20 ms 5708 KB Output is correct
10 Correct 24 ms 7100 KB Output is correct
11 Correct 26 ms 5708 KB Output is correct
12 Correct 22 ms 5728 KB Output is correct
13 Correct 33 ms 7072 KB Output is correct
14 Correct 20 ms 5708 KB Output is correct
15 Correct 8 ms 4172 KB Output is correct
16 Correct 8 ms 4268 KB Output is correct
17 Correct 15 ms 4968 KB Output is correct
18 Correct 23 ms 6272 KB Output is correct
19 Correct 14 ms 4984 KB Output is correct
20 Correct 15 ms 5068 KB Output is correct
21 Runtime error 1420 ms 50952 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -