oj.uz

Submission #978294

# Submission time Handle Problem Language Result Execution time Memory
978294 2024-05-09T05:41:50 Z mannshah1211 Fish 3 (JOI24_fish3) C++17
9 / 100
 2000 ms 4900 KB 
/**
 *  author: hashman
 *  created:
**/

#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() {
  cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

using Int = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  Int d;
  cin >> d;
  vector<Int> c(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    --l; --r;
    Int ans = 0, prv = c[r];
    for (int j = r - 1; j >= l; j--) {
      Int cur = c[j] - prv;
      if (cur < 0) {
        prv = c[j];
      } else {
        Int x = (cur + d - 1) / d;
        ans += x;
        prv = c[j] - (d * x);
      }
    }
    if (prv < 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 31 ms 572 KB Output is correct
5 Correct 20 ms 348 KB Output is correct
6 Correct 21 ms 556 KB Output is correct
7 Correct 10 ms 516 KB Output is correct
8 Correct 18 ms 500 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 19 ms 548 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 2792 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 2055 ms 4900 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 2060 ms 2644 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 31 ms 572 KB Output is correct
5 Correct 20 ms 348 KB Output is correct
6 Correct 21 ms 556 KB Output is correct
7 Correct 10 ms 516 KB Output is correct
8 Correct 18 ms 500 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 19 ms 548 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Execution timed out 2062 ms 2792 KB Time limit exceeded
15 Halted 0 ms 0 KB -