제출 #1260222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1260222		Zbyszek99	Sushi (JOI16_sushi)	C++20	100 / 100	7469 ms	40680 KiB

sushi

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

const int sqr = 1300;

struct seg
{
    vi arr;
    int bl,br;
    multiset<int> elms;
    multiset<int> opers;
    int add_all(int x)
    {
        opers.insert(x);
        if(siz(opers) > (br-bl+1))
        {
            opers.erase(--opers.end());
        }
        elms.insert(x);
        int val = *(--elms.end());
        elms.erase(--elms.end());
        return val;
    }
    void upd()
    {
        if(siz(opers) == 0) return;
        int n = siz(arr);
        rep(i,n)
        {
            if(arr[i] > *(opers.begin()))
            {
                int arr2 = *opers.begin();
                opers.erase(opers.begin());
                opers.insert(arr[i]);
                arr[i] = arr2;
            }
        }
    }
    int add_elm(int l, int r, int elm)
    {
        l -= bl;
        r -= bl;
        upd();
        elms.insert(elm);
        rep2(i,l,r)
        {
            if(arr[i] > elm)
            {
                swap(arr[i],elm);
            }
        }
        elms.erase(elms.find(elm));
        return elm;
    }
};

seg block[400000/sqr+5];
int n,q;

int solve(int l, int r, int elm)
{
    if(l <= r)
    {
        int start_block = l/sqr;
        elm = block[start_block].add_elm(l,min(block[start_block].br,r),elm);
        start_block++;
        while(block[start_block].br <= r)
        {
            elm = block[start_block++].add_all(elm);
        }
        if(r >= block[start_block].bl)
        {
            elm = block[start_block].add_elm(max(l,block[start_block].bl),r,elm);
        }
        return elm;
    }
    elm = solve(l,n-1,elm);
    return solve(0,r,elm);
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    cin >> n >> q;
    rep(i,n/sqr+5)
    {
        block[i].bl = sqr*i;
        block[i].br = sqr*(i+1)-1;
    }
    rep(i,n)
    {
        int x;
        cin >> x;
        int b = i/sqr;
        block[b].arr.pb(x);
        block[b].elms.insert(x);
    }
    rep(qq,q)
    {
        int l,r,x;
        cin >> l >> r >> x;
        l--;
        r--;
        cout << solve(l,r,x) << "\n";
    }
}

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