oj.uz

Submission #981825

# Submission time Handle Problem Language Result Execution time Memory
981825 2024-05-13T15:26:36 Z shadow_sami Fish 3 (JOI24_fish3) C++17
20 / 100
 188 ms 37468 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 456 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 30996 KB Output is correct
2 Correct 120 ms 30236 KB Output is correct
3 Incorrect 55 ms 14416 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 18000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 28376 KB Output is correct
2 Correct 153 ms 31108 KB Output is correct
3 Correct 90 ms 19392 KB Output is correct
4 Correct 157 ms 34240 KB Output is correct
5 Correct 168 ms 35328 KB Output is correct
6 Correct 154 ms 37468 KB Output is correct
7 Correct 132 ms 33428 KB Output is correct
8 Correct 188 ms 37456 KB Output is correct
9 Correct 120 ms 30152 KB Output is correct
10 Correct 135 ms 30100 KB Output is correct
11 Correct 138 ms 34324 KB Output is correct
12 Correct 140 ms 33364 KB Output is correct
13 Correct 144 ms 37204 KB Output is correct
14 Correct 135 ms 33104 KB Output is correct
15 Correct 150 ms 37232 KB Output is correct
16 Correct 137 ms 33104 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 456 KB Output isn't correct
4 Halted 0 ms 0 KB -