| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1284779 | Muhammad_Aneeq | Fish 3 (JOI24_fish3) | C++20 | 2096 ms | 3376 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
inline void solve()
{
int n,D;
cin>>n>>D;
int c[n];
for (auto& i:c)
cin>>i;
int q;
cin>>q;
while (q--)
{
int l,r;
cin>>l>>r;
l--;r--;
int mn=c[r];
bool w=1;
int ans=0;
for (int i=r-1;i>=l;i--)
{
int op=min(c[i],mn);
int df=c[i]-op;
df=df+((D-(df%D)))%D;
mn=min(op,c[i]-df);
if (df>c[i])
{
w=0;
cout<<-1<<endl;
break;
}
ans+=df/D;
}
if (w)
cout<<ans<<endl;
}
}
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t=1;
for (int i=1;i<=t;i++)
{
solve();
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
