제출 #660052

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

bridge

#include<iostream>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<map>
#include<utility>
#include<unordered_map>
#include<vector>
#include<set>
#define pii pair<int,int>
#define pll pair<ll, ll>
#define F first
#define S second
#define ll long long
#define pb push_back
using namespace std;

const int N = (int)1e5 + 5, mod = (ll)1e9 + 7;
int n, k, x, y;
char ch, hc;
ll sm = 0, sm2 = (ll)1e18 + 18;
vector<ll int> cv;
bool cmp(ll int i,ll int j){
//	cout << i << " " << j << endl;	
    return i < j;
}
void sub(){
	vector<pii> vc;
	cerr << "\n entered #sub 2 \n";
	for(int i = 0; i < n; i++){
		cin >> ch >>x >> hc >> y;
		if(ch == hc)sm += abs(x - y);
		else vc.pb({min(x,y), max(x,y)});
	}
    n = vc.size();
	for (int i = 0; i < n; ++i)
        cv.push_back(vc[i].F), cv.push_back(vc[i].S);
    for (int i = 0; i < (n << 1); i ++){
        for (int j = 0; j < (n << 1); j ++){
            ll tmt = 0;
            for (int k = 0; k < n; k ++){
                int tmv1 = abs(vc[k].F - cv[i]) + abs(vc[k].S - cv[i]);
                int tmv2 = abs(vc[k].F - cv[j]) + abs(vc[k].S - cv[j]);
                tmt += min(tmv1, tmv2);
            }
            sm2 = min(sm2, tmt);
        }
	}
	cout << sm + sm2 + vc.size() << endl;
	exit(0);
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> k >> n;
	vector<int> vc;
	if(k > 2)exit(0);
	if(k == 2) sub();
//	cerr << "\n enteres #sub1 \n";
	for(int i = 1; i <= n; i ++){
		cin >> ch >> x >> hc >> y;
		if(ch == hc) sm += abs(x - y);
		else sm ++, vc.pb(x), vc.pb(y);
	}
	sort(vc.begin(), vc.end());
	int pos = vc[(vc.size() - 1) / 2];
	for(auto x : vc)sm += abs(x - pos);
	cout << sm << endl;
}

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