oj.uz

Submission #1005780

# Submission time Handle Problem Language Result Execution time Memory
1005780 2024-06-23T04:49:35 Z a5a7 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 68 ms 5076 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> 
using indexedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;

int main(){
    int k, n;
    cin >> k >> n;
    vector<pair<ll, ll>> deals;
    ll ans = 0;
    for (int i = 0; i < n; i++){
        char a, b;
        ll c, d;
        cin >> a >> c >> b >> d;
        if (a == b) ans += max(d,c)-min(d,c);
        else deals.push_back({min(c,d), max(c,d)});
    }
    ans += deals.size();
    if (k == 1){
        vector<ll> v;
        for (auto x : deals) v.push_back(x.first), v.push_back(x.second);
        sort(v.begin(), v.end());
        ll med = v[v.size()/2];
        for (ll x : v) ans += abs(x-med);
    }else{
        sort(deals.begin(), deals.end(), [&](auto x, auto y){
            return (x.first+x.second)<(y.first+y.second);
        });
        n = (int) deals.size();
        ll prefix[n+1];
        ll suffix[n+1];
        prefix[0] = suffix[n] = 0;
        ll sum = 0;
        ll other = 0;
        multiset<ll> values;
        for (int i = 0; i < n; i++){
            sum += deals[i].first + deals[i].second;
            values.insert(deals[i].first);
            values.insert(deals[i].second);
            other += *values.begin();
            values.erase(values.begin());
            prefix[i+1] = sum - other - other;
        }
        values.clear();
        sum = other = 0;
        for (int i = (n-1); i > -1; i--){
            sum += deals[i].first + deals[i].second;
            values.insert(deals[i].first);
            values.insert(deals[i].second);
            other += *values.begin();
            values.erase(values.begin());
            suffix[i] = sum - other - other;
        }
        ll best = prefix[0]+suffix[0];
        for (int i = 1; i <= n; i++) best = min(best, prefix[i]+suffix[i]);
        ans += best;
    }
    cout << ans << endl;
}

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 0 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 600 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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 30 ms 5076 KB Output is correct
13 Correct 68 ms 4920 KB Output is correct
14 Correct 38 ms 4800 KB Output is correct
15 Correct 36 ms 2760 KB Output is correct
16 Correct 60 ms 4896 KB Output is correct
17 Correct 59 ms 4912 KB Output is correct
18 Correct 55 ms 5052 KB Output is correct
19 Correct 68 ms 5056 KB Output is correct
20 Correct 48 ms 4832 KB Output is correct
21 Correct 60 ms 5056 KB Output is correct

Subtask #3
0 / 9.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 #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 1 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 344 KB Output is correct
2 Correct 0 ms 348 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 -