oj.uz

Submission #883820

# Submission time Handle Problem Language Result Execution time Memory
883820 2023-12-06T07:13:36 Z MisterReaper Palembang Bridges (APIO15_bridge) C++17
22 / 100
 102 ms 11408 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

const i64 INF = 1E18;

char ch[2];
int x[2];

template <typename T>
ostream& operator<< (ostream &out, vector <T> vec) {
    out << "{";
    for(int i = 0; i < int(vec.size()); i++) {
        out << vec[i];
        if(i +1 < int(vec.size())) {
            out << ", ";
        }
    }

    return out << "}";
}

#define ONLINE_JUDGE

i64 suml = 0, sumr = 0;
multiset <int> low, up;

void balance() {
    while(int(low.size()) > int(up.size())) {
        int x = *low.rbegin();
        up.emplace(x);
        suml -= x;
        sumr += x;
        low.erase(low.find(x));
    }


    while(int(up.size()) > int(low.size())) {
        int x = *up.begin();
        low.emplace(x);
        suml += x;
        sumr -= x;
        up.erase(up.find(x));
    }
}

void add(int x) {
    low.emplace(x);
    suml += x;

    balance();
}

void solve() {
    int k, n;
    cin >> k >> n;

    i64 total = 0;
    vector <pair <int, int>> a;
    for(int i = 0; i < n; i++) {
        cin >> ch[0] >> x[0] >> ch[1] >> x[1];
        if(ch[0] != ch[1]) {
            a.emplace_back(x[0], x[1]);
        } else {
            total += abs(x[0] - x[1]);
        }
    }

    n = int(a.size());
    i64 ans = INF;

    sort(a.begin(), a.end());

    vector <i64> pref(n +1);
    for(int i = 0; i < n; i++) {
        add(a[i].first);
        add(a[i].second);

        //cerr << a[i].first << " " << a[i].second << " :: " << sumr << " " << suml << "\n";
        pref[i +1] = sumr - suml;
    }

    ans = min(ans, pref[n]);

    if(k == 2) {
        low.clear();
        up.clear();
        suml = sumr = 0;

        for(int i = n; i >= 1; i--) {
            add(a[i -1].first);
            add(a[i -1].second);

            ans = min(ans, pref[i -1] + sumr - suml);
        }
    }

    cout << ans + total + n;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    solve();

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 97 ms 11392 KB Output is correct
13 Correct 95 ms 11384 KB Output is correct
14 Correct 94 ms 10184 KB Output is correct
15 Correct 55 ms 6684 KB Output is correct
16 Correct 99 ms 11408 KB Output is correct
17 Correct 88 ms 11272 KB Output is correct
18 Correct 102 ms 11296 KB Output is correct
19 Correct 98 ms 11248 KB Output is correct
20 Correct 93 ms 11188 KB Output is correct
21 Correct 95 ms 11216 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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