# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066525 | tamthegod | Fish 3 (JOI24_fish3) | C++17 | 2073 ms | 7784 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, d;
int a[maxN];
void ReadInput()
{
cin >> n >> d;
for(int i=1; i<=n; i++)
cin >> a[i];
}
void Solve()
{
int q;
cin >> q;
while(q--)
{
int l, r;
cin >> l >> r;
int val = oo;
int res = 0;
for(int i=r; i>=l; i--)
{
if(a[i] <= val)
{
val = a[i];
continue;
}
if(d > a[i] || val < a[i] % d)
{
res = oo;
break;
}
res += (a[i] - val - 1) / d + 1;
int cur = val;
val -= val % d;
val += a[i] % d;
if(val > cur) val -= d;
}
cout << (res < oo ? res : -1) << '\n';
}
}
#define taskname "sol"
int32_t main()
{
if (fopen(taskname ".inp", "r"))
{
freopen(taskname ".inp", "r", stdin);
//freopen(taskname ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
//cin >> T;
for(int itest=1; itest<=T; itest++)
{
ReadInput();
Solve();
}
}
Compilation message (stderr)
# | 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... |