oj.uz

Submission #1005778

# Submission time Handle Problem Language Result Execution time Memory
1005778 2024-06-23T04:38:11 Z a5a7 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 2000 ms 7336 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);
        });
        multiset<ll> fh, fb, lh, lb;
        ll last = 0;
        ll first = 0;
        ll best = 1e9;
        for (int i = 0; i < (int) deals.size(); i++){
            last += deals[i].first + deals[i].second;
            lh.insert(deals[i].first);
            lh.insert(deals[i].second);
        }
        while (lh.size() > lb.size()){
            lb.insert(*lh.begin());
            last -= 2 * (*lh.begin());
            lh.erase(lh.begin());
        }
        best = last;
        for (int i = 0; i < deals.size(); i++){
            first += deals[i].second + deals[i].first;
            fh.insert(deals[i].first);
            fh.insert(deals[i].second);    
            while (fh.size() > fb.size()){
                fb.insert(*fh.begin());
                first -= 2 * (*fh.begin());
                fh.erase(fh.begin());
            }
            if (lh.count(deals[i].first)) lh.erase(lh.find(deals[i].first)), last -= deals[i].first;
            else lb.erase(lb.find(deals[i].first)), last += deals[i].first;
            if (lh.count(deals[i].second)) lh.erase(lh.find(deals[i].second)), last -= deals[i].second;
            else lb.erase(lb.find(deals[i].second)), last += deals[i].second;
            while (lh.size() > lb.size()){
                lb.insert(*lh.begin());
                last -= 2 * (*lh.begin());
                lh.erase(lh.begin());
            }
            while (lh.size() < lb.size()){
                ll number = *--lb.end();
                lh.insert(number);
                last += 2 * number;
                lh.erase(lh.find(number));
            }
            best = min(best, first+last);
        }
        ans += best;
    }
    cout << ans << endl;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int i = 0; i < deals.size(); i++){
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 452 KB Output is correct
10 Correct 1 ms 348 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 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 444 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 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 31 ms 5612 KB Output is correct
13 Correct 69 ms 7100 KB Output is correct
14 Correct 44 ms 6084 KB Output is correct
15 Correct 41 ms 4048 KB Output is correct
16 Correct 46 ms 6608 KB Output is correct
17 Correct 61 ms 7044 KB Output is correct
18 Correct 56 ms 6852 KB Output is correct
19 Correct 68 ms 7336 KB Output is correct
20 Correct 53 ms 6844 KB Output is correct
21 Correct 58 ms 6848 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 Execution timed out 2072 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Execution timed out 2097 ms 348 KB Time limit exceeded
4 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 Execution timed out 2058 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -