提出 #75728914

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int H, W, N; cin >> H >> W >> N;
    vector<ll> va;
    map<ll,vector<ll>> m;
    for (int i = 0; i < N; i++) {
        ll a, b; cin >> a >> b;
        m[a].push_back(b);
        va.push_back(a);
    }
    compress(va);
    ll ans = 0;
    for (auto a : va) {
        sort(all(m[a]));
        ans += 2 * (m[a].back()-1);
    }
    vector<ll> tv;
    for (auto a : va) {
        auto v = m[a]; v.push_back(W);
        ll m = 2*(W-v[0]);
        for (int i = 1; i < sz(v); i++) {
            m = min(m, 2*(v[i-1]-1) + 2*(W-v[i]));
        }
        tv.push_back(m);
    }
    sort(rall(tv));
    ll sum = 0; for (auto i : tv) sum += i;
    for (int i = 2; i <= sz(tv); i += 2) {
        for (int j = i-2; j < i; j++) {
            sum -= tv[j];
            sum += W-1;
        }
        ans = min(sum, ans);
    }
    cout << ans << "\n";
    return 0;
}

提出情報

ジャッジ結果