제출 #45010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45010		RezwanArefin01	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	174 ms	20940 KiB

bridge

    #include <bits/stdc++.h>
    using namespace std;
     
    typedef long long ll;
    typedef pair<int, int> ii; 
     
    vector<ii> v;
     
    ll get(ll x) {
    	ll ret = 0;
    	for(ii a : v) ret += abs(a.first - x) + abs(a.second - x);
    	return ret;
    }
    int main(int argc, char const *argv[]) {
    #ifdef LOCAL_TESTING
    	freopen("in", "r", stdin);
    #endif
    	int k, n; cin >> k >> n; 
    	ll pre = 0;
    	vector<int> pos; 
    	for(int i = 0; i < n; i++) {
    		char p, q; int s, t; 
    		cin >> p >> s >> q >> t; 
    		if(p == q) pre += abs(s - t);
    		else v.push_back({s, t}), pos.push_back(s), pos.push_back(t);
    	}
    	int m = pos.size();
        if(m){
    	sort(pos.begin(), pos.end());
     
    	ll mn = get(pos[m/2]);
    	if(m/2+1 < m) mn = min(mn, get(pos[m/2 + 1])); 
    	cout << mn + v.size() + pre << endl;
        } else cout << pre << endl;
    }

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