oj.uz

Submission #932476

# Submission time Handle Problem Language Result Execution time Memory
932476 2024-02-23T13:27:30 Z VMaksimoski008 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 80 ms 2820 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

priority_queue<int> L;
priority_queue<int, vector<int>, greater<int> > R;
ll sumL = 0, sumR = 0;

void insert(int x) {
    int med = (L.empty() ? 1e9 + 1 : L.top());
    if(x <= med) L.push(x), sumL += x;
    else R.push(x), sumR += x;

    if(L.size() > R.size() + 1) {
        R.push(L.top());
        sumL -= L.top();
        sumR += L.top();
        L.pop();
    } else if(R.size() > L.size()) {
        L.push(R.top());
        sumL += R.top();
        sumR -= R.top();
        R.pop();
    }
}

int32_t main() {
    int k, n;
    cin >> k >> n;

    ll ans = 0, ans2 = 0;
    vector<pii> v;
    v.push_back({ 0, 0 });

    for(int i=0; i<n; i++) {
        char a, b;
        int c, d;
        cin >> a >> c >> b >> d;

        if(a == b) {
            ans2 += abs(c - d);
        } else {
            v.push_back({ c, d });
            ans2++;
        }
    }

    if(v.size() == 0) {
        cout << ans2 << '\n';
        return 0;
    }

    if(k == 1) {
        for(int i=1; i<v.size(); i++) {
            insert(v[i].first);
            insert(v[i].second);
        }

        ans = sumR - sumL;
    } else {
        ans = 1e18;

        sort(1+all(v), [&](pii &a, pii &b) { return (a.first + a.second) < (b.first + b.second); });

        for(int i=1; i<v.size(); i++) {
            ll res = 0;
            sumL = sumR = 0;

            while(!L.empty()) L.pop();
            while(!R.empty()) R.pop();

            for(int j=1; j<=i; j++) {
                insert(v[j].first);
                insert(v[j].second);
            }

            res += sumR - sumL;

            sumL = sumR = 0;
            while(!L.empty()) L.pop();
            while(!R.empty()) R.pop();

            for(int j=i+1; j<v.size(); j++) {
                insert(v[j].first);
                insert(v[j].second);
            }

            res += sumR - sumL;

            ans = min(ans, res);
        }
    }

    cout << ans + ans2 << '\n';
    return 0;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:70:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int i=1; i<v.size(); i++) {
      |                      ~^~~~~~~~~
bridge.cpp:81:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for(int i=1; i<v.size(); i++) {
      |                      ~^~~~~~~~~
bridge.cpp:99:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |             for(int j=i+1; j<v.size(); j++) {
      |                            ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 504 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 2 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 344 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 38 ms 2528 KB Output is correct
13 Correct 80 ms 2748 KB Output is correct
14 Correct 52 ms 2224 KB Output is correct
15 Correct 47 ms 1668 KB Output is correct
16 Correct 56 ms 2820 KB Output is correct
17 Correct 74 ms 2308 KB Output is correct
18 Correct 74 ms 2504 KB Output is correct
19 Correct 79 ms 2760 KB Output is correct
20 Correct 66 ms 2284 KB Output is correct
21 Correct 71 ms 2500 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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