"LibreOJ β Round" ZQC hand to do

Others 2019-06-23 23:08:33 views: null

https://loj.ac/problem/504

A kind of routine questions.

The first thing you can do two logn tree cover tree. . . .

naive to put all the numbers in the interval out into the pile. Constantly removed.

Too much.

So we began to keep only the minimum initial logn range, and then find the next pop up after about a range

The minimum segment tree maintenance and minimum position.

 

And super piano, XOR dumplings, K strings are the same.

K or short circuit.

But this is the tree line carrier.

#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il void rd(T &x){
    char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);
    for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);}
template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+'0');}
template<class T>il void ot(T x){if(x<0) putchar('-'),x=-x;output(x);putchar(' ');}
template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}
namespace Modulo{
const int mod=998244353;
il int ad(int x,int y){return x+y>=mod?x+y-mod:x+y;}
the you intended ( you get, you y) { return ad (x, mod- y)}
il int mul(int x,int y){return (ll)x*y%mod;}
il void inc(int &x,int y){x=ad(x,y);}
il void inc2(int &x,int y){x=mul(x,y);}
il int qm(int x,int y=mod-2){int ret=1;while(y){if(y&1) ret=mul(x,ret);x=mul(x,x);y>>=1;}return ret;}
template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}
template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}
}
// using namespace Modulo;
namespace Miracle{
const int N=5e5+5;
const int inf=0x3f3f3f3f;
int n,m;
struct tr{
    int mi,p;
    int tag;
}t[4*N];
#define ls (x<<1)
#define rs (x<<1|1)
#define mid ((l+r)>>1)
void pushup(int x){
    t[x].mi=min(t[ls].mi,t[rs].mi);
    if(t[ls].mi==t[x].mi) t[x].p=t[ls].p;
    else t[x].p=t[rs].p;
}
void Max(int x,int c){
    t[x].mi=max(t[x].mi,c);
    t[x].tag=max(t[x].tag,c);
}
void pushdown(int x){
    if(t[x].tag){
        Max(ls,t[x].tag);
        Max(rs,t[x].tag);
        t [x] .tag = 0 ;
    }
}
int a[N];
void build(int x,int l,int r){
    if(l==r){
        t[x].mi=a[l];
        t[x].p=l;
        return;
    }
    build(ls,l,mid);
    build(rs,mid+1,r);
    pushup(x);
}
void chan(int x,int l,int r,int L,int R,int c){
    if(L<=l&&r<=R){
        Max(x,c);
        return;
    }
    pushdown(x);
    if(L<=mid) chan(ls,l,mid,L,R,c);
    if(mid<R) chan(rs,mid+1,r,L,R,c);
    pushup(x);
}
PII query ( you get, you're the, you're down, you L, you R) {
    
    if(L<=l&&r<=R){
        return mk(t[x].p,t[x].mi);
    }
    pushdown(x);
    if(L>mid) return query(rs,mid+1,r,L,R);
    if(R<=mid) return query(ls,l,mid,L,R);
    the pii = query (bs, l, mid, L, R);
    pii ri=query(rs,mid+1,r,L,R);
    le.se = min (le.se, ri.se);
    forceful (ri.se == le.se) le.fi = ri.fi;
    return to;
}
struct po{
    int v,p,l,r;
    po () {}
    po ( you vv, you pp, you're not, you 're) {
        v = vv; p = pp; l = r = re;
    }
    bool friend operator <(po a,po b){
        return a.v>b.v;
    }
    void up () {
        cout<<" po "<<v<<" "<<p<<" "<<l<<" "<<r<<endl;
    }
};

priority_queue<po>q;
void push(int x,int l,int r,int L,int R,int k){
    if(L<=l&&r<=R){
        if(t[x].mi<k) q.push(po(t[x].mi,t[x].p,l,r));
        return;
    }
    pushdown(x);
    if(L<=mid) push(ls,l,mid,L,R,k);
    if(mid<R) push(rs,mid+1,r,L,R,k);
}

void clear(priority_queue<po>&q){
    priority_queue<po>tmp;
    q.swap(tmp);
}
Int Mem [ 5000000 + 4 ], num;
Int i () {
    rd (n);
    for(reg i=1;i<=n;++i){
        rd (a [i]);
    }    
    build(1,1,n);
//    return 0;
    
    
    rd (m);
//    cout<<" 22223 "<<endl;
    int op,l,r,k,x;
    while(m--){
        higher (op); rd (l); rd (r); rd (k);
        if(op==1){
//            continue;
//            cout<<" op==1 "<<endl;
            chan(1,1,n,l,r,k);
        }else{
//            cout<<" op==2 "<<endl;
            rd(x);
            clear(q);
            push(1,1,n,l,r,k);
//            cout<<" size "<<q.size()<<endl;
            num=0;
            while(x&&!q.empty()){
                po now=q.top();q.pop();
//                now.op();
                if(now.v>=k) break;
                mem[++num]=now.v;
                if(now.l<=now.p-1){
//                    cout<<" findl "<<endl;
                    pii lp=query(1,1,n,now.l,now.p-1);
//                    cout<<" endq "<<endl;
                    q.push(po(lp.se,lp.fi,now.l,now.p-1));
//                    cout<<" enl "<<endl;
                }
                if(now.p+1<=now.r){
//                    cout<<" findr "<<endl;
                    pii lp=query(1,1,n,now.p+1,now.r);
                    q.push(po(lp.se,lp.fi,now.p+1,now.r));
//                    cout<<" enr "<<endl;
                }
                --x;
            }
            if(x){
                puts("-1");
            }else{
                prt (m, 1 , num);
            }
        }
    }
    return 0;
}

}
signed main(){
//    freopen("data.in","r",stdin);
//    freopen("my.out","w",stdout);
    Miracle::main();
    return 0;
}

/*
   Author: *Miracle*
*/
#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il void rd(T &x){
    char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);
    for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);}
template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+'0');}
template<class T>il void ot(T x){if(x<0) putchar('-'),x=-x;output(x);putchar(' ');}
template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}
namespace Modulo{
const int mod=998244353;
il int ad(int x,int y){return x+y>=mod?x+y-mod:x+y;}
the you intended ( you get, you y) { return ad (x, mod- y)}
il int mul(int x,int y){return (ll)x*y%mod;}
il void inc(int &x,int y){x=ad(x,y);}
il void inc2(int &x,int y){x=mul(x,y);}
il int qm(int x,int y=mod-2){int ret=1;while(y){if(y&1) ret=mul(x,ret);x=mul(x,x);y>>=1;}return ret;}
template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}
template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}
}
// using namespace Modulo;
namespace Miracle{
const int N=5e5+5;
const int inf=0x3f3f3f3f;
int n,m;
struct tr{
    int mi,p;
    int tag;
}t[4*N];
#define ls (x<<1)
#define rs (x<<1|1)
#define mid ((l+r)>>1)
void pushup(int x){
    t[x].mi=min(t[ls].mi,t[rs].mi);
    if(t[ls].mi==t[x].mi) t[x].p=t[ls].p;
    else t[x].p=t[rs].p;
}
void Max(int x,int c){
    t[x].mi=max(t[x].mi,c);
    t[x].tag=max(t[x].tag,c);
}
void pushdown(int x){
    if(t[x].tag){
        Max(ls,t[x].tag);
        Max(rs,t[x].tag);
        t [x] .tag = 0 ;
    }
}
int a[N];
void build(int x,int l,int r){
    if(l==r){
        t[x].mi=a[l];
        t[x].p=l;
        return;
    }
    build(ls,l,mid);
    build(rs,mid+1,r);
    pushup(x);
}
void chan(int x,int l,int r,int L,int R,int c){
    if(L<=l&&r<=R){
        Max(x,c);
        return;
    }
    pushdown(x);
    if(L<=mid) chan(ls,l,mid,L,R,c);
    if(mid<R) chan(rs,mid+1,r,L,R,c);
    pushup(x);
}
PII query ( you get, you're the, you're down, you L, you R) {
    
    if(L<=l&&r<=R){
        return mk(t[x].p,t[x].mi);
    }
    pushdown(x);
    if(L>mid) return query(rs,mid+1,r,L,R);
    if(R<=mid) return query(ls,l,mid,L,R);
    the pii = query (bs, l, mid, L, R);
    pii ri=query(rs,mid+1,r,L,R);
    le.se = min (le.se, ri.se);
    forceful (ri.se == le.se) le.fi = ri.fi;
    return to;
}
struct po{
    int v,p,l,r;
    po () {}
    po ( you vv, you pp, you're not, you 're) {
        v = vv; p = pp; l = r = re;
    }
    bool friend operator <(po a,po b){
        return a.v>b.v;
    }
    void up () {
        cout<<" po "<<v<<" "<<p<<" "<<l<<" "<<r<<endl;
    }
};

priority_queue<po>q;
void push(int x,int l,int r,int L,int R,int k){
    if(L<=l&&r<=R){
        if(t[x].mi<k) q.push(po(t[x].mi,t[x].p,l,r));
        return;
    }
    pushdown(x);
    if(L<=mid) push(ls,l,mid,L,R,k);
    if(mid<R) push(rs,mid+1,r,L,R,k);
}

void clear(priority_queue<po>&q){
    priority_queue<po>tmp;
    q.swap(tmp);
}
Int Mem [ 5000000 + 4 ], num;
Int i () {
    rd (n);
    for(reg i=1;i<=n;++i){
        rd (a [i]);
    }    
    build(1,1,n);
//    return 0;
    
    
    rd (m);
//    cout<<" 22223 "<<endl;
    int op,l,r,k,x;
    while(m--){
        higher (op); rd (l); rd (r); rd (k);
        if(op==1){
//            continue;
//            cout<<" op==1 "<<endl;
            chan(1,1,n,l,r,k);
        }else{
//            cout<<" op==2 "<<endl;
            rd(x);
            clear(q);
            push(1,1,n,l,r,k);
//            cout<<" size "<<q.size()<<endl;
            num=0;
            while(x&&!q.empty()){
                po now=q.top();q.pop();
//                now.op();
                if(now.v>=k) break;
                mem[++num]=now.v;
                if(now.l<=now.p-1){
//                    cout<<" findl "<<endl;
                    pii lp=query(1,1,n,now.l,now.p-1);
//                    cout<<" endq "<<endl;
                    q.push(po(lp.se,lp.fi,now.l,now.p-1));
//                    cout<<" enl "<<endl;
                }
                if(now.p+1<=now.r){
//                    cout<<" findr "<<endl;
                    pii lp=query(1,1,n,now.p+1,now.r);
                    q.push(po(lp.se,lp.fi,now.p+1,now.r));
//                    cout<<" enr "<<endl;
                }
                --x;
            }
            if(x){
                puts("-1");
            }else{
                prt (m, 1 , num);
            }
        }
    }
    return 0;
}

}
signed main(){
//    freopen("data.in","r",stdin);
//    freopen("my.out","w",stdout);
    Miracle::main();
    return 0;
}

/*
   Author: *Miracle*
*/

 

Guess you like

Origin www.cnblogs.com/Miracevin/p/11073990.html
Recommended
Ranking
error: (-215:Assertion failed) !_img.empty() in function ‘cv::imwrite‘
Database migration between Navicat servers
Minimum number of rotation of the array: Array
balenaEtcher for mac (make a boot disk software) v1.5.67
Custom processing serialization and deserialization in jackson
Mu-en-mask system development software
Mastering Regular Expressions
Find mileage Java--
Web pages can not directly concern the public micro-channel number how to do? A key to arouse public concern number of micro-channel solutions
[CodeForces - 739B] Alyona and a tree Tree + [difference] + bipartite
Daily
More
2024-05-12(28)
2024-05-11(32)
2024-05-10(34)
2024-05-09(32)
2024-05-08(18)
2024-05-07(34)
2024-05-06(6)
2024-05-05(0)
2024-05-04(18)
2024-05-03(8)

Code World

© 2018 codetd.com