제출 #1139707

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1139707		Persia	Palembang Bridges (APIO15_bridge)	C++20	0 / 100	0 ms	328 KiB

bridge

#include <bits/stdc++.h>
#define bit(i, x) (x >> i & 1)
#define ll long long
const int N = 2e5 + 5;
const int mod = 998244353;
using namespace std;

int k, n;
vector<int> a;

ll bonus;

signed main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> k >> n;
    for(int i = 1; i <= n; i++) {
        char p, q; int s, t;
        cin >> p >> s >> q >> t;
        if(p == q) {
            bonus += abs(t - s);
            continue;
        }
        bonus++;
        a.push_back(s);
        a.push_back(t);

//        auto [x, y] = a.back();
//        cout << x << " " << y << "\n";
    }

    sort(a.begin(), a.end());
    ll res = 2e18;
    for(auto i : a) {
        ll val = 0;
        for(auto j : a) val += abs(j - i);
        res = min(res, val);
    }

    cout << res + bonus;

    return 0 ^ 0;
}

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