oj.uz

Submission #950975

# Submission time Handle Problem Language Result Execution time Memory
950975 2024-03-21T03:22:57 Z daoquanglinh2007 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 2 ms 4588 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int NM = 5e5;

int n, a[NM+5], b[NM+5], c[NM+5], d[NM+5], cur = 0;
priority_queue <int> pq;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
        c[i] = c[i-1]+a[i];
        d[i] = d[i-1]+b[i];
    }
    pq.push(0);
    for (int i = 1; i < n; i++){
        if (c[i]-d[i] >= pq.top()){
            pq.push(c[i]-d[i]);
            continue;
        }
        cur += pq.top()-(c[i]-d[i]);
        pq.pop();
        pq.push(c[i]-d[i]);
        pq.push(c[i]-d[i]);
    }
    int lst = pq.top(), slope = 0;
    pq.pop();
    while (lst > c[n]-d[n]){
        cur += slope*(lst-pq.top());
        lst = pq.top();
        pq.pop();
        slope++;
    }
    cout << cur;
    return 0;
}

Subtask #1
0 / 24.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 36.0

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