제출 #851836

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

bridge

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vi;
typedef pair <int,int> pi;
#define pb push_back
#define f first
#define s second
#define OO 1e9
#define all(x) (x).begin(), (x).end()
 
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    // freopen("art2.in", "r", stdin);
    // freopen("art2.out", "w", stdout);    
    int n, k; cin >> k >> n;
    vector <pi> home(n), work(n);
    for(int i=0; i<n; ++i){
        int h, w;char a, b; cin >> a >> h >> b >> w;
        home[i].f = h; home[i].s = (a == 'A');
        work[i].f = w; work[i].s = (b == 'A');
    }
    vi v; 
    for(int i=0; i<n; ++i){
        if(home[i].s == work[i].s){ continue; }
        v.pb(home[i].f); v.pb(work[i].f);
    }
    sort(all(v));
    v.resize(unique(all(v)) - v.begin());
    int median = v[(v.size()-1)/2];
    vi ans(10000);
    for(int i=0; i<n; ++i){
        if(home[i].s == work[i].s){
            for(int j=0; j<10000; ++j){
                ans[j] += abs(home[i].f - work[i].f);
            }   
            continue;
        }
        for(int j=0; j<5000; ++j){
            ans[j] += (abs(home[i].f-(median-j)) + abs(median-j-work[i].f)+1);
            ans[j+5000] += (abs(home[i].f-(median+j)) + abs(median+j-work[i].f)+1);
        }
    }
    cout << *min_element(all(ans));
    return 0;
}

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