제출 #170579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
170579		VEGAnn	Palembang Bridges (APIO15_bridge)	C++14	0 / 100	2 ms	632 KiB

bridge

#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pii pair<int, int>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const ll PW = 43;
const int N = 30010;
const int B = 100;
const int oo = 2e9;
const ll OO = 1e18;
vector<pii> seg;
vector<int> pts;
ll extra = 0, best = OO, al = 0, kol = 0;
int k, n;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("in.txt","r",stdin);
    cin >> k >> n;
    assert(k == 1);
    for (int i = 0; i < n; i++){
        char c1, c2; int l, r;
        cin >> c1 >> l >> c2 >> r;
        if (l > r) swap(l, r);
        extra += r - l;
        if (c1 != c2){
            extra++;
            al += r;
            al += l;
            kol += 2;
            seg.PB(MP(l, r));
        }
    }
    if (kol > 0){
        ll pot = al / kol;
        ll bd = min(pot + 5, ll(1e9));
        for (ll x = max(0ll, pot - 5); x <= bd; x++){
            ll cur = 0;
            for (pii cr : seg){
                if (cr.sd < x)
                    cur += x - cr.sd;
                if (cr.ft > x)
                    cur += cr.ft - x;
            }
            best = min(best, cur + cur);
        }
    }
    cout << best + extra;
    return 0;
}

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