제출 #489957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489957		JerryLiu06	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	332 KiB

bridge

// https://oj.uz/problem/view/APIO15_bridge

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 5e4 + 10;
const ll INF = 1e18;

int K, N; vector<array<int, 2>> ed; vi ansPref, ansSuff; 

vi genAns() {
    vi res; res.pb(0);

    priority_queue<int> L;
    priority_queue<int, vi, greater<int>> R; // R contains the median
    
    while (sz(L)) L.pop();
    while (sz(R)) R.pop();

    int lsum = 0, rsum = 0;

    int curMedian = 0;

    F0R(i, sz(ed)) {
        EACH(C, ed[i]) {
            if (C >= curMedian) {
                R.push(C); rsum += C;
            }
            else {
                L.push(C); lsum += C;
            }
        }
        if (sz(R) > sz(L)) {
            L.push(R.top()); lsum += R.top();

            rsum -= R.top(); R.pop();

            curMedian = R.top();
        }
        if (sz(L) > sz(R)) {
            R.push(L.top()); rsum += L.top();

            lsum -= L.top(); L.pop();

            curMedian = R.top();
        }
        res.pb(rsum - lsum);
    }
    return res;
}

int main() {
    FASTIO; 

    cin >> K >> N; 

    ll ans = 0;

    FOR(i, 1, N + 1) {
        char C1, C2; int A, B;

        cin >> C1 >> A >> C2 >> B;

        if (C1 == C2) {
            ans += abs(B - A);
        }
        else {
            ed.pb({A, B});
        }
    }
    sort(all(ed), [&](array<int, 2> a, array<int, 2> b) { return a[0] + a[1] < b[0] + b[1]; });

    ansPref = genAns();

    reverse(all(ed));

    ansSuff = genAns();
    
    if (K == 1) {
        return cout << ans + ansPref[sz(ed)] + sz(ed) << "\n", 0;
    }
    ll res = INF;

    F0R(i, sz(ed) + 1) {
        ckmin(res, ans + ansPref[i] + ansSuff[sz(ed) - i] + sz(ed));
    }
    cout << res;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37