Submission #519506

#	Time	Username	Problem	Language	Result	Execution time	Memory
519506		rrrr10000	Sushi (JOI16_sushi)	C++14	100 / 100	10850 ms	159324 KiB

sushi

#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define popcnt __builtin_popcountll
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
const ll B=600;
vi sol(ll n,ll q,vi v,vector<PP> query){
    vi ans(q);
    vector<PQ(ll)> pq(n/B+1);
    vector<SPQ(ll)> spq(n/B+1);
    rep(i,n)pq[i/B].push(v[i]);
    auto eval=[&](ll i){
        while(pq[i].size())pq[i].pop();
        REP(j,i*B,min((i+1)*B,n)){
            spq[i].push(v[j]);
            v[j]=spq[i].top();spq[i].pop();
            pq[i].push(v[j]);
        }
        while(spq[i].size())spq[i].pop();
    };
    auto f=[&](ll l,ll r,ll c){
        eval(l/B);eval(r/B);
        rep(i,n/B+1){
            if(r<i*B||(i+1)*B<=l)continue;
            if(l<=i*B&&(i+1)*B-1<=r){
                spq[i].push(c);
                pq[i].push(c);
                c=pq[i].top();pq[i].pop();
            }
            else{
                REP(j,max(l,i*B),min(r+1,(i+1)*B))if(c<v[j])swap(c,v[j]);
                while(pq[i].size())pq[i].pop();
                REP(j,i*B,min((i+1)*B,n))pq[i].push(v[j]);
            }
        }
        return c;
    };
    rep(i,q){
        ll l,r,c;tie(l,r,c)=query[i];
        if(l>r){
            c=f(l,n-1,c);l=0;
        }
        ans[i]=f(l,r,c);
    }
    return ans;
}
int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    ll n,q;cin>>n>>q;
    vi v(n);vector<PP> query(q);
    rep(i,n)cin>>v[i];
    rep(i,q){
        ll a,b,c;cin>>a>>b>>c;
        query[i]={a-1,b-1,c};
    }
    vi res=sol(n,q,v,query);
    for(ll x:res)out(x);
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80