제출 #981825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981825		shadow_sami	Fish 3 (JOI24_fish3)	C++17	20 / 100	188 ms	37468 KiB

Main

#include <bits/stdc++.h>
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=5001001001001001001;
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;}

int main(){
    cin.tie(0); ios::sync_with_stdio(false);
    //  #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE
    ll n,d;cin>>n>>d;

    vi a(n);rep(i,n)cin>>a[i];
    ll q;cin>>q;
    vvp query(n);
    rep(i,q){
        ll l,r;cin>>l>>r;l--;r--;
        query[r].pb(l,i);
    }
    vi v(n),ans(q);
    for(ll i=n-2;i>=0;i--){
        if(a[i]>=a[i+1])v[i]=v[i+1]+(a[i]-a[i+1]+d-1)/d;
        // else v[i]=v[i+1]-(a[i+1]-a[i])/d;
    }
    vi rui(n+1);
    rep(i,n)rui[i+1]=rui[i]+v[i];
    vp st;st.pb(-1,0);
    rep(i,n){
        while(st.size()>1&&v[st.back().fi]>=v[i])st.pop_back();
        st.pb(i,st.back().se+v[i]*(i-st.back().fi));
        for(auto x:query[i]){
            ll idx=lb(st,P(x.fi,-inf));
            ans[x.se]=st.back().se-st[idx-1].se-v[st[idx].fi]*(x.fi-1-st[idx-1].fi);
            ans[x.se]=rui[i+1]-rui[x.fi]-ans[x.se];
            if(a[x.fi]<d*(v[x.fi]-v[st[idx].fi]))ans[x.se]=-1;
        }
    }
    for(ll x:ans)out(x);
}

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