oj.uz

Submission #990831

# Submission time Handle Problem Language Result Execution time Memory
990831 2024-05-31T13:07:44 Z grt Fish 3 (JOI24_fish3) C++17
9 / 100
 2000 ms 5132 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

const int nax = 300 * 1000 + 10;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    ll d;
    cin >> n >> d;
    vector<ll> a(n);
    for (ll &x : a) cin >> x;
    cin >> q;

    while (q--) {
        int l, r;
        cin >> l >> r;
        l--, r--;
        ll ans = 0;
        ll open = 0;
        for (int i = r; i >= l; --i) {
            ll dif = (i == l ? a[i] : a[i] - a[i - 1]);
            ll demand = 0;
            if (dif < 0) {
                demand = (abs(dif) - 1) / d + 1;
            } else {
                demand = - (dif / d);
            }
            if (demand > 0) {
                ans += (ll)i * demand;
                open += demand;
            } else {
                ll me = min(-demand, open);
                ans -= me * i;
                open -= me;
            }
        }
        if (open > 0) cout << "-1\n";
        else cout << ans << "\n";

    }
}

Subtask #1
9.0 / 9.0

# 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 Correct 0 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 8 ms 516 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 552 KB Output is correct
13 Correct 9 ms 348 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2088 ms 2792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 5132 KB Output is correct
2 Execution timed out 2054 ms 3060 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2071 ms 2396 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 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 Correct 0 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 8 ms 516 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 552 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Execution timed out 2088 ms 2792 KB Time limit exceeded
15 Halted 0 ms 0 KB -