| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341466 | borisAngelov | Fish 3 (JOI24_fish3) | C++20 | 2095 ms | 4984 KiB |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300005;
int n, q;
long long a[maxn], d;
long long solve(int l, int r)
{
long long last = a[r];
long long ans = 0;
for (int i = r - 1; i >= l; --i)
{
if (a[i] <= last)
{
last = min(last, a[i]);
}
else
{
long long cnt = (a[i] - last - 1) / d + 1;
if (a[i] - cnt * d < 0)
{
return -1;
}
ans += cnt;
last = min(last, a[i] - cnt * d);
}
}
return ans;
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> d;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
cin >> q;
for (int i = 1; i <= q; ++i)
{
int l, r;
cin >> l >> r;
cout << solve(l, r) << "\n";
}
return 0;
}| # | 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... | ||||
