제출 #1179092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179092		Zbyszek99	Dungeon 3 (JOI21_ho_t5)	C++20	11 / 100	4094 ms	7840 KiB

Main

#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 rand(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 tree_siz = 1024*512-1;

int drzewo_A[tree_siz];

int get_max_A(int akt, int p1, int p2, int s1, int s2)
{
    if(p2 < s1 || p1 > s2) return 0;
    if(p1 >= s1 && p2 <= s2)
    {
        return drzewo_A[akt-1];
    }
    return max(get_max_A(akt*2,p1,(p1+p2)/2,s1,s2),get_max_A(akt*2+1,(p1+p2)/2+1,p2,s1,s2));
}

void updA(int v)
{
    drzewo_A[v-1] = max(drzewo_A[v*2-1],drzewo_A[v*2]);
    if(v != 1) updA(v/2);
}

void changeA(int ind, int x)
{
    drzewo_A[tree_siz/2+ind] = x;
    updA((tree_siz/2+ind+1)/2);
}

ll A_pref[200'002];
ll cost[200'002];
int prev_[200'002];
int nxt[200'002];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    A_pref[0] = 1e9;
    rep2(i,1,n)
    {
        ll a;
        cin >> a;
        A_pref[i] = A_pref[i-1] + a;
        changeA(i,a);
    }
    A_pref[n+1] = A_pref[n];
    rep2(i,1,n) cin >> cost[i];
    stack<int> st;
    for(int i = n; i >= 0; i--)
    {
        while(!st.empty() && cost[st.top()] > cost[i])
        {
            st.pop();
        }
        if(siz(st) == 0)
        {
            nxt[i] = n+1;
        }
        else
        {
            nxt[i] = st.top();
        }
        st.push(i);
    }
    st = {};
    rep2(i,1,n)
    {
        while(!st.empty() && cost[st.top()] >= cost[i])
        {
            st.pop();
        }
        if(siz(st) == 0)
        {
            prev_[i] = 0;
        }
        else
        {
            prev_[i] = st.top();
        }
        st.push(i);
    }
    rep(qq,q)
    {
        int s,t;
        ll u;
        cin >> s >> t >> u;
        t--;
        if(get_max_A(1,0,tree_siz/2,s,t) > u)
        {
            cout << "-1\n";
            continue;
        }
        ll ans = 0;
        rep2(i,s,t)
        {
            ll l = 0;
            if(prev_[i] >= s) l = A_pref[i-1] - A_pref[prev_[i]-1];
            else l = 1e18;
            ll r = 0;
            if(nxt[i] <= t) r = A_pref[nxt[i]-1] - A_pref[i-1];
            else r = A_pref[t] - A_pref[i-1];
           // cout << i << " " << l << " " << r << " " << u << " " << ans << " " << max(min(u,r) - max(u-l,0LL),0LL)<< " ans\n";
            ll val = 0;
            if(u >= l)
            {
                if(u >= r)
                {
                    if(l+r >= u)
                    {
                        val = l+r-u;
                    }
                    else
                    {
                        val = 0;
                    }
                }
                else
                {
                    val = l;
                }
            }
            else
            {
                if(u >= r)
                {
                    val = r;
                }
                else
                {
                    val = u;
                }
            }
            ans += val * cost[i];
        }
        cout << ans << "\n";
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 31
• Subtask 4: 0 / 44