Submission #1031811

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031811		_8_8_	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	49 ms	6716 KiB

bridge

#include <bits/stdc++.h>
 
using namespace std;
    
typedef long long ll;
const int  N = 1e6 + 21, MOD = (int)1e9+7;

int n,k;
ll res = 0;
array<int,2> a[N];
ll val[N];
ll solve(){
    if(!n) return 0;
    vector<pair<int,int>> sc;
    for(int i = 1;i <= n;i++){
        sc.push_back({a[i][0],0});
        sc.push_back({a[i][1],1});
    }
    sort(sc.begin(),sc.end());
    ll sum = 0,col = 0;
    for(int i = 0;i < (int)sc.size();i++){
        val[i] = (sc[i].first * 1ll * col) - sum;
        if(sc[i].second == 1){
            col++;
            sum += sc[i].first;
        }
    }
    col = sum =0 ;
    ll res = 1e18;
    for(int i = (int)sc.size() - 1;i >= 0;i--){
        val[i] += sum - (sc[i].first * 1ll * col);
        if(sc[i].second == 0){
            col++;
            sum += sc[i].first;
        }
        res = min(res,val[i] * 2);
    }
    return res;
}
void test() {
    cin >> k >> n;
    int _i = 0;
    for(int i = 1;i <= n;i++) {
        char x,y;
        int l,r;
        cin >> x >> l >> y >> r;
        if(l > r){
            swap(l,r);
            swap(x,y);
        }
        res += (r - l);
        if(x == y){
            continue;
        }
        res++;
        a[++_i] = {l,r};
    }
    n = _i;
    if(k == 1){
        cout << res + solve();
        return;
    }
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}

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