답안 #993142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
993142 2024-06-05T11:00:47 Z vyshniak_n Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
107 ms 25040 KB
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll maxn = 5e5 + 10;
const ll mod = 1e9 + 7;
const ll K = 7e6 + 100;
const ll LOG = 20;

ll a[maxn], b[maxn], pref[maxn];

void solve() {
    ll n;
    cin >> n;

    for (ll i = 1; i <= n; i++)
        cin >> a[i] >> b[i];

    for (ll i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + a[i] - b[i];

    priority_queue <ll> pq;

    ll ans = 0;
    for (ll i = 1; i <= n; i++) {
        if (pref[i] < 0) {
            ans += abs(pref[i]);
            pref[i] = 0;
        } else if (pref[i] > pref[n]) {
            ans += pref[i] - pref[n];
            pref[i] = pref[n];
        }

        pq.push(pref[i]);
        pq.push(pref[i]);
        ans += pq.top() - pref[i];
        pq.pop();
    }

    cout << ans << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 7 ms 9692 KB Output is correct
5 Correct 14 ms 12508 KB Output is correct
6 Correct 38 ms 16464 KB Output is correct
7 Correct 83 ms 24524 KB Output is correct
8 Correct 77 ms 23244 KB Output is correct
9 Correct 67 ms 21664 KB Output is correct
10 Correct 56 ms 19660 KB Output is correct
11 Correct 56 ms 20224 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 7 ms 9692 KB Output is correct
5 Correct 14 ms 12508 KB Output is correct
6 Correct 38 ms 16464 KB Output is correct
7 Correct 83 ms 24524 KB Output is correct
8 Correct 77 ms 23244 KB Output is correct
9 Correct 67 ms 21664 KB Output is correct
10 Correct 56 ms 19660 KB Output is correct
11 Correct 56 ms 20224 KB Output is correct
12 Correct 21 ms 13524 KB Output is correct
13 Correct 52 ms 20800 KB Output is correct
14 Correct 84 ms 23376 KB Output is correct
15 Correct 71 ms 22476 KB Output is correct
16 Correct 63 ms 20936 KB Output is correct
17 Correct 62 ms 18632 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4592 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4592 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4576 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4592 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 7 ms 9692 KB Output is correct
12 Correct 14 ms 12508 KB Output is correct
13 Correct 38 ms 16464 KB Output is correct
14 Correct 83 ms 24524 KB Output is correct
15 Correct 77 ms 23244 KB Output is correct
16 Correct 67 ms 21664 KB Output is correct
17 Correct 56 ms 19660 KB Output is correct
18 Correct 56 ms 20224 KB Output is correct
19 Correct 21 ms 13524 KB Output is correct
20 Correct 52 ms 20800 KB Output is correct
21 Correct 84 ms 23376 KB Output is correct
22 Correct 71 ms 22476 KB Output is correct
23 Correct 63 ms 20936 KB Output is correct
24 Correct 62 ms 18632 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4576 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 29 ms 13532 KB Output is correct
34 Correct 63 ms 21192 KB Output is correct
35 Correct 107 ms 24264 KB Output is correct
36 Correct 97 ms 22472 KB Output is correct
37 Correct 83 ms 23240 KB Output is correct
38 Correct 101 ms 23496 KB Output is correct
39 Correct 65 ms 19400 KB Output is correct
40 Correct 71 ms 20156 KB Output is correct
41 Correct 63 ms 19144 KB Output is correct
42 Correct 72 ms 18636 KB Output is correct
43 Correct 66 ms 19912 KB Output is correct
44 Correct 68 ms 18640 KB Output is correct
45 Correct 88 ms 25040 KB Output is correct
46 Correct 87 ms 20080 KB Output is correct
47 Correct 70 ms 18380 KB Output is correct