oj.uz

답안 #950971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950971 2024-03-21T03:21:42 Z daoquanglinh2007 Potatoes and fertilizers (LMIO19_bulves) C++17
24 / 100
 134 ms 21644 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();
        if (c[i]-d[i] > 0){
            pq.push(c[i]-d[i]);
            pq.push(c[i]-d[i]);
        }
        if (pq.empty()) pq.push(0);
    }
    int lst = pq.top(), slope = 0;
    while (lst > c[n]-d[n]){
        cur += slope*(lst-pq.top());
        lst = pq.top();
        pq.pop();
        slope++;
    }
    cout << cur;
    return 0;
}

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 12 ms 9564 KB Output is correct
5 Correct 24 ms 13792 KB Output is correct
6 Correct 78 ms 15312 KB Output is correct
7 Correct 79 ms 16420 KB Output is correct
8 Correct 134 ms 21644 KB Output is correct
9 Correct 79 ms 16600 KB Output is correct
10 Correct 68 ms 18392 KB Output is correct
11 Correct 72 ms 20940 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 12 ms 9564 KB Output is correct
5 Correct 24 ms 13792 KB Output is correct
6 Correct 78 ms 15312 KB Output is correct
7 Correct 79 ms 16420 KB Output is correct
8 Correct 134 ms 21644 KB Output is correct
9 Correct 79 ms 16600 KB Output is correct
10 Correct 68 ms 18392 KB Output is correct
11 Correct 72 ms 20940 KB Output is correct
12 Incorrect 43 ms 14292 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Incorrect 1 ms 4444 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Incorrect 1 ms 4444 KB Output isn't correct
6 Halted 0 ms 0 KB -