oj.uz

답안 #978203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978203 2024-05-09T03:17:14 Z model_code Fish 3 (JOI24_fish3) C++17
100 / 100
 235 ms 40772 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);
    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
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 724 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 30944 KB Output is correct
2 Correct 119 ms 30412 KB Output is correct
3 Correct 55 ms 14164 KB Output is correct
4 Correct 134 ms 30176 KB Output is correct
5 Correct 116 ms 29984 KB Output is correct
6 Correct 117 ms 29720 KB Output is correct
7 Correct 138 ms 29728 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 18060 KB Output is correct
2 Correct 158 ms 37672 KB Output is correct
3 Correct 157 ms 37524 KB Output is correct
4 Correct 159 ms 37716 KB Output is correct
5 Correct 145 ms 37716 KB Output is correct
6 Correct 122 ms 31312 KB Output is correct
7 Correct 128 ms 31288 KB Output is correct
8 Correct 146 ms 34384 KB Output is correct
9 Correct 138 ms 34384 KB Output is correct
10 Correct 198 ms 40636 KB Output is correct
11 Correct 197 ms 40560 KB Output is correct
12 Correct 186 ms 38084 KB Output is correct
13 Correct 186 ms 38080 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 28392 KB Output is correct
2 Correct 121 ms 31056 KB Output is correct
3 Correct 89 ms 19536 KB Output is correct
4 Correct 133 ms 34128 KB Output is correct
5 Correct 139 ms 35300 KB Output is correct
6 Correct 150 ms 37484 KB Output is correct
7 Correct 134 ms 33364 KB Output is correct
8 Correct 152 ms 37476 KB Output is correct
9 Correct 138 ms 30180 KB Output is correct
10 Correct 120 ms 30112 KB Output is correct
11 Correct 139 ms 34132 KB Output is correct
12 Correct 137 ms 33512 KB Output is correct
13 Correct 149 ms 37324 KB Output is correct
14 Correct 153 ms 33204 KB Output is correct
15 Correct 152 ms 37204 KB Output is correct
16 Correct 143 ms 33108 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 119 ms 30944 KB Output is correct
15 Correct 119 ms 30412 KB Output is correct
16 Correct 55 ms 14164 KB Output is correct
17 Correct 134 ms 30176 KB Output is correct
18 Correct 116 ms 29984 KB Output is correct
19 Correct 117 ms 29720 KB Output is correct
20 Correct 138 ms 29728 KB Output is correct
21 Correct 63 ms 18060 KB Output is correct
22 Correct 158 ms 37672 KB Output is correct
23 Correct 157 ms 37524 KB Output is correct
24 Correct 159 ms 37716 KB Output is correct
25 Correct 145 ms 37716 KB Output is correct
26 Correct 122 ms 31312 KB Output is correct
27 Correct 128 ms 31288 KB Output is correct
28 Correct 146 ms 34384 KB Output is correct
29 Correct 138 ms 34384 KB Output is correct
30 Correct 198 ms 40636 KB Output is correct
31 Correct 197 ms 40560 KB Output is correct
32 Correct 186 ms 38084 KB Output is correct
33 Correct 186 ms 38080 KB Output is correct
34 Correct 117 ms 28392 KB Output is correct
35 Correct 121 ms 31056 KB Output is correct
36 Correct 89 ms 19536 KB Output is correct
37 Correct 133 ms 34128 KB Output is correct
38 Correct 139 ms 35300 KB Output is correct
39 Correct 150 ms 37484 KB Output is correct
40 Correct 134 ms 33364 KB Output is correct
41 Correct 152 ms 37476 KB Output is correct
42 Correct 138 ms 30180 KB Output is correct
43 Correct 120 ms 30112 KB Output is correct
44 Correct 139 ms 34132 KB Output is correct
45 Correct 137 ms 33512 KB Output is correct
46 Correct 149 ms 37324 KB Output is correct
47 Correct 153 ms 33204 KB Output is correct
48 Correct 152 ms 37204 KB Output is correct
49 Correct 143 ms 33108 KB Output is correct
50 Correct 150 ms 37656 KB Output is correct
51 Correct 126 ms 31316 KB Output is correct
52 Correct 143 ms 34128 KB Output is correct
53 Correct 223 ms 40772 KB Output is correct
54 Correct 228 ms 38216 KB Output is correct
55 Correct 226 ms 37468 KB Output is correct
56 Correct 151 ms 33168 KB Output is correct
57 Correct 144 ms 30184 KB Output is correct
58 Correct 124 ms 30068 KB Output is correct
59 Correct 166 ms 35528 KB Output is correct
60 Correct 178 ms 33260 KB Output is correct
61 Correct 235 ms 40620 KB Output is correct
62 Correct 171 ms 32856 KB Output is correct
63 Correct 208 ms 37548 KB Output is correct
64 Correct 204 ms 33188 KB Output is correct