제출 #105306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105306		win11905	Palembang Bridges (APIO15_bridge)	C++11	0 / 100	4 ms	512 KiB

bridge

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define x first
#define y second
#define long long long
using namespace std;

const int N = 1e5+5;

int k, n, sz;
vector<pii> vec;
long ans;
long dp[2][N];

void solve_median(long dp[]) {
    priority_queue<int> Q1;
    priority_queue<int, vector<int>, greater<int> > Q2;
    long sum1 = 0, sum2 = 0;
    for(int i = 0; i < sz; ++i) {
        Q1.emplace(vec[i].x), sum1 += vec[i].x;
        Q2.emplace(vec[i].y), sum2 += vec[i].y;
        while(Q1.top() > Q2.top()) {
            int u = Q1.top(), v = Q2.top();
            Q1.pop(), Q2.pop(); sum1 -= u, sum2 -= v;
            sum1 += v, sum2 += u;
            Q1.emplace(v), Q2.emplace(u);
        }
        dp[i] = ((i+1ll) * (Q1.top()) - sum1) + (sum2 - (i+1ll) * Q1.top());
    }
}


int main() {
    scanf("%d %d", &k, &n);
    for(int i = 0; i < n; ++i) {
        char a[3], b[3]; int c, d;
        scanf("%s %d %s %d", a, &c, b, &d);
        if(a[0] == b[0]) ans += abs(c - d);
        else vec.emplace_back(c, d);
    }
    sz = vec.size();
    if(!sz) return !printf("%lld\n", ans);
    ans += sz;
    sort(all(vec), [&](const pii &a, const pii &b) {
        return a.x + b.x < a.y + b.y;
    });
    solve_median(dp[0]);
    if(k == 1) return !printf("%lld\n", ans + dp[0][sz-1]);
    reverse(all(vec)); solve_median(dp[1]);
    long val = dp[0][sz-1];
    for(int i = 0; i < sz-1; ++i) val = min(val, dp[0][i] + dp[1][sz-i-2]);
    return !printf("%lld\n", ans + val);
}

컴파일 시 표준 에러 (stderr) 메시지

bridge.cpp: In function 'int main()':
bridge.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &k, &n);
     ~~~~~^~~~~~~~~~~~~~~~~
bridge.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s %d %s %d", a, &c, b, &d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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