제출 #243299

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

bridge

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int k, n;
    cin >> k >> n;
    ll ans1 = 0, ans2 =0;
    vector<ll> a, b, c;
    for(int i=1; i<=n; i++){
        int s, t;
        char p, q;
        cin >> p >> s >> q >> t;
        if(p == q) ans1 += abs(s - t);
        else{
            if(p == 'B') swap(s, t);
            a.push_back(s);
            b.push_back(t);
        }
    }
    for(auto x : a) c.push_back(x);
    for(auto x : b) c.push_back(x);
    sort(c.begin(), c.end());
    ll opt = c[(int)c.size()/2];
    for(auto x : a) ans2 += abs(opt - x);
    for(auto x : b) ans2 += abs(opt - x);
    cout << ans1 + ans2 + (int)a.size() << "\n";
    return 0;
}

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