oj.uz

Submission #891414

# Submission time Handle Problem Language Result Execution time Memory
891414 2023-12-23T01:15:01 Z ClHg2 Potatoes and fertilizers (LMIO19_bulves) C++14
24 / 100
 69 ms 16984 KB 
#include <bits/stdc++.h>
#define EVAL(x) #x " = " << (x)

using std::cin;
using std::cout;
using i64 = int64_t;

auto main() -> int {
  std::ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  auto n = 0;
  cin >> n;

  auto a = std::vector<int>(n);
  for (auto i = 0; i < n; ++i) {
    auto x = 0, y = 0;
    cin >> x >> y;
    a[i] = x - y;
  }

  auto pre = std::vector<i64>(n + 1);
  for (auto i = 0; i < n; ++i) pre[i + 1] = pre[i] + a[i];
  auto suf = std::vector<i64>(n + 1);
  for (auto i = n - 1; ~i; --i) suf[i] = suf[i + 1] + a[i];

  auto ans = i64{0};
  for (auto i = 1; i < n; ++i) {
    if (pre[i] < 0)
      ans -= pre[i];
    else if (suf[i] < 0)
      ans -= suf[i];
  }
  cout << ans << "\n";
}

Compilation message

bulves.cpp:2: warning: "EVAL" redefined
    2 | #define EVAL(x) #x " = " << (x)
      | 
<command-line>: note: this is the location of the previous definition

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 1628 KB Output is correct
5 Correct 11 ms 3028 KB Output is correct
6 Correct 32 ms 8588 KB Output is correct
7 Correct 69 ms 16984 KB Output is correct
8 Correct 55 ms 15060 KB Output is correct
9 Correct 55 ms 14428 KB Output is correct
10 Correct 40 ms 12116 KB Output is correct
11 Correct 40 ms 12132 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 1628 KB Output is correct
5 Correct 11 ms 3028 KB Output is correct
6 Correct 32 ms 8588 KB Output is correct
7 Correct 69 ms 16984 KB Output is correct
8 Correct 55 ms 15060 KB Output is correct
9 Correct 55 ms 14428 KB Output is correct
10 Correct 40 ms 12116 KB Output is correct
11 Correct 40 ms 12132 KB Output is correct
12 Incorrect 17 ms 4440 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -