oj.uz

Submission #146909

# Submission time Handle Problem Language Result Execution time Memory
146909 2019-08-26T14:55:58 Z bortoz Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 6 ms 888 KB 
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define fi first
#define se second

int main() {
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> V(N);
  set<int> L;
  for (int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    V[i] = a - b;
    if (V[i] > 0) {
      L.insert(i);
    }
  }
  ll res = 0;
  for (int i = 0; i < N; i++) {
    // print(i, L);
    auto itR = L.lower_bound(i);
    if (itR == L.end() && itR != L.begin()) {
      itR--;
    }
    auto itL = itR;
    if (itL != L.begin()) {
      itL--;
    }
    while (V[i] < 0) {
      // print(i, V[i], L, *itL, *itR);
      if (abs(i - *itL) < abs(i - *itR)) {
        int m = min(-V[i], V[*itL]);
        res += 1ll * m * abs(i - *itL);
        V[i] += m;
        V[*itL] -= m;
        if (V[*itL] == 0) {
          itL = L.erase(itL);
        }
        if (itL != L.begin()) {
          itL--;
        }
      } else {
        int m = min(-V[i], V[*itR]);
        res += 1ll * m * abs(i - *itR);
        V[i] += m;
        V[*itR] -= m;
        if (V[*itR] == 0) {
          itR = L.erase(itR);
        }
      }
    }
  }
  cout << res << endl;

  return 0;
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Runtime error 6 ms 888 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Runtime error 6 ms 888 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Runtime error 6 ms 888 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Runtime error 6 ms 888 KB Execution killed with signal 11 (could be triggered by violating memory limits)