제출 #1177364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177364		Zbyszek99	Dungeon 3 (JOI21_ho_t5)	C++20	11 / 100	4093 ms	6592 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;

ll A_pref[200'002];
ll cost[200'002];
ll lim[200'002];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    rep2(i,1,n)
    {
        ll a;
        cin >> a;
        A_pref[i] = A_pref[i-1] + a;
    }
    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)
        {
            lim[i] = A_pref[n] - A_pref[i-1];
        }
        else
        {
            lim[i] = A_pref[st.top()-1] - A_pref[i-1];
        }
        st.push(i);
    }
 //   rep2(i,1,n) cout << lim[i] << " ";
 //   cout << " lim\n";
    rep(qq,q)
    {
        int s,t;
        ll u;
        cin >> s >> t >> u;
        ll ans = 0;
        ll cur_e = 0;
        bool is_ok = 1;
        rep2(i,s,t-1)
        {
         //   cout << cur_e << " " << min(lim[i],u) << " " << is_ok << " " << ans << " move\n";
            if(cur_e >= min(lim[i],u))
            {

            }
            else
            {
                if(min(lim[i],u) - (A_pref[t-1] - A_pref[i-1]) >= 0)
                {
                    ans += cost[i] * ((A_pref[t-1] - A_pref[i-1]) - cur_e);
                    cur_e = (A_pref[t-1] - A_pref[i-1]);
                }
                else
                {
                    ans += cost[i] * (min(lim[i],u) - cur_e);
                    cur_e = min(lim[i],u);
                }
            }
            cur_e -= A_pref[i] - A_pref[i-1];
            if(cur_e < 0) is_ok = 0;
        }
        if(is_ok)
        {
            cout << ans << "\n";
        }
        else
        {
            cout << "-1\n";
        }
    }
}

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