# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
984693 |
2024-05-17T02:56:22 Z |
vjudge2 |
Fish 3 (JOI24_fish3) |
C++17 |
|
113 ms |
22608 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, k, q;
cin >> n >> k;
vector<int> c(n+1), ac(n+1, 0), a(n+1, 0), b(n+1, 0);
for (int i = 1; i <= n; i++) {
cin >> c[i];
ac[i] = c[i];
}
for (int i = n - 1; i >= 1; i--) {
if (ac[i] > ac[i + 1]) {
int diff = ac[i] - ac[i + 1];
diff = (diff + k - 1) / k;
a[i] += diff;
ac[i] -= diff * k;
}
}
for (int i = 1; i <= n; i++) a[i] += a[i - 1];
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
// cout << a[r] - a[l - 1] << '\n';
// cout << ((c[r] - ac[r]) / k) * (r - l + 1) << '\n';
int L = ac[l], R = ac[r];
L += (c[r] - R);
if (L < 0) cout << "-1\n";
else cout << a[r] - a[l - 1] - ((c[r] - ac[r]) / k) * (r - l + 1) << '\n';
}
}
# |
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 |
1 ms |
344 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
94 ms |
16156 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
61 ms |
7752 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
14684 KB |
Output is correct |
2 |
Correct |
85 ms |
15968 KB |
Output is correct |
3 |
Correct |
65 ms |
8200 KB |
Output is correct |
4 |
Correct |
99 ms |
19060 KB |
Output is correct |
5 |
Correct |
109 ms |
20812 KB |
Output is correct |
6 |
Correct |
113 ms |
22348 KB |
Output is correct |
7 |
Correct |
98 ms |
19536 KB |
Output is correct |
8 |
Correct |
108 ms |
22608 KB |
Output is correct |
9 |
Correct |
71 ms |
15204 KB |
Output is correct |
10 |
Correct |
76 ms |
15044 KB |
Output is correct |
11 |
Correct |
97 ms |
19280 KB |
Output is correct |
12 |
Correct |
113 ms |
18388 KB |
Output is correct |
13 |
Correct |
107 ms |
22516 KB |
Output is correct |
14 |
Correct |
81 ms |
18288 KB |
Output is correct |
15 |
Correct |
109 ms |
22096 KB |
Output is correct |
16 |
Correct |
82 ms |
18256 KB |
Output is correct |
# |
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 |
1 ms |
344 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |