oj.uz

Submission #1012846

# Submission time Handle Problem Language Result Execution time Memory
1012846 2024-07-02T17:05:49 Z underwaterkillerwhale Fish 3 (JOI24_fish3) C++17
9 / 100
 2000 ms 5456 KB 

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rd);
}

const int N  = 3e5 + 7;
const int Mod = 998244353;
const int szBL = 916;
const ll INF = 1e9;
const int BASE = 137;

int n, Q;
ll D;
ll a[N], b[N];

void solution() {
    cin >> n >> D;
    rep (i, 1, n)
        cin >> a[i];
    cin >> Q;
    rep (q, 1, Q) {
        int L, R;
        cin >> L >> R;
        rep (i, L, R) b[i] = a[i];
        ll res = 0;
        reb (i, R, L + 1) {
            if (b[i] >= b[i - 1]) continue;
            else {
                res += ceil(1.0 * (b[i - 1] - b[i]) / D);
                b[i - 1] = b[i - 1] - D * ceil(1.0 * (b[i - 1] - b[i]) / D);
            }
        }
//        rep (i, L, R) cout << b[i] <<" ";
        if (b[L] >= 0)
            cout << res <<"\n";
        else cout << -1 <<"\n";
    }
}


#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    file ("c");
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
10 3
558103292241 930416975101 878795845384 804480358330 767898782842 927334443478 767423599302 776338370164 666494289968 823066426292
5
6 7
4 9
1 5
1 5
8 9

*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 48 ms 2636 KB Output is correct
5 Correct 51 ms 2608 KB Output is correct
6 Correct 34 ms 2612 KB Output is correct
7 Correct 29 ms 2584 KB Output is correct
8 Correct 54 ms 2556 KB Output is correct
9 Correct 52 ms 2392 KB Output is correct
10 Correct 54 ms 2648 KB Output is correct
11 Correct 55 ms 2396 KB Output is correct
12 Correct 4 ms 2392 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 48 ms 2636 KB Output is correct
5 Correct 51 ms 2608 KB Output is correct
6 Correct 34 ms 2612 KB Output is correct
7 Correct 29 ms 2584 KB Output is correct
8 Correct 54 ms 2556 KB Output is correct
9 Correct 52 ms 2392 KB Output is correct
10 Correct 54 ms 2648 KB Output is correct
11 Correct 55 ms 2396 KB Output is correct
12 Correct 4 ms 2392 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Execution timed out 2088 ms 4956 KB Time limit exceeded
15 Halted 0 ms 0 KB -