Submission #1305249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305249		Zbyszek99	Fish 3 (JOI24_fish3)	C++20	100 / 100	195 ms	32824 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 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;

int n,q;
ll D;
ll arr[300001];
ll org_pref[300001];
ll dif_pref[300001];
ll dif2_pref[300001];
vector<pii> queries[300001];
ll query_ans[300001];

ll pref_seg[300001];

ll get_sum(ll l, ll r, ll beg)
{
    return beg*(r-l+1)-(dif_pref[r]*(r-l+1)-(dif2_pref[r]-dif2_pref[l-1]));
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    cin >> n >> D;
    rep2(i,1,n) cin >> arr[i];
    cin >> q;
    rep(qq,q)
    {
        int l,r;
        cin >> l >> r;
        queries[r].pb({l,qq});
    }
    rep2(i,1,n) org_pref[i] = org_pref[i-1]+arr[i];
    rep2(i,1,n) dif_pref[i] = dif_pref[i-1]+((arr[i]%D)-(arr[i-1]%D)+D)%D;
    rep2(i,1,n) dif2_pref[i] = dif2_pref[i-1]+dif_pref[i];
    vector<pii> st;
    st = {};
    rep2(i,1,n)
    {
        pii cur = {i,i};
        while(siz(st) != 0 && arr[st.back().ss] >= arr[i]-(dif_pref[i]-dif_pref[st.back().ss+1]))
        {
            cur.ff = st.back().ff;
            st.pop_back();
        }
        st.pb(cur);
        pref_seg[i] = pref_seg[cur.ff-1]+get_sum(cur.ff,cur.ss,arr[cur.ss]);
        forall(it,queries[i])
        {
            int l = 0;
            int r = siz(st)-1;
            int p = 0;
            while(l <= r)
            {
                int mid = (l+r)/2;
                if(st[mid].ss >= it.ff) 
                {
                    r = mid-1;
                    p = mid;
                }
                else
                {
                    l = mid+1;
                }
            }
            query_ans[it.ss] = ((org_pref[i]-org_pref[it.ff-1])-(pref_seg[i]-pref_seg[st[p].ss]+get_sum(it.ff,st[p].ss,arr[st[p].ss])))/D;
            if(arr[st[p].ss]-(dif_pref[st[p].ss]-dif_pref[it.ff]) < 0) query_ans[it.ss] = -1;
        }
    }
    rep(qq,q) cout << query_ans[qq] << "\n";
}

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36