Submission #829537

#	Time	Username	Problem	Language	Result	Execution time	Memory
829537		bachhoangxuan	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	324 KiB

bridge

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

multiset<int> l[2],r[2];
int sl[2],sr[2],cost[2];

void update(int t){
    while((int)r[t].size()>(int)l[t].size()){
        int d=*r[t].begin();
        l[t].insert(d);sl[t]+=d;
        r[t].erase(r[t].begin());sr[t]-=d;
    }
    while((int)l[t].size()>(int)r[t].size()){
        int d=*l[t].rbegin();
        r[t].insert(d);sr[t]+=d;
        l[t].erase(l[t].lower_bound(d));sl[t]-=d;
    }
    int d=*r[t].begin();
    cost[t]=d*(int)l[t].size()-sl[t]+sr[t]-d*(int)r[t].size();
}
void add(int t,int x){
    if(r[t].empty() || *r[t].begin()>=x) l[t].insert(x),sl[t]+=x;
    else r[t].insert(x),sr[t]+=x;
    update(t);
}

void del(int t,int x){
    auto it=l[t].lower_bound(x);
    if(it!=l[t].end()){
        l[t].erase(it);sl[t]-=x;
    }
    else{
        it=r[t].lower_bound(x);
        r[t].erase(it);sr[t]-=x;
    }
    update(t);
}

void solve(){
    int k,n,ans=0;cin >> k >> n;
    vector<pii> x;
    for(int i=1;i<=n;i++){
        char a,b;int xa,xb;cin >> a >> xa >> b >> xb;
        if(a==b) ans+=abs(xa-xb);
        else{
            ans++;
            if(xa>xb) swap(xa,xb);
            x.push_back({xa,xb});
        }
    }
    sort(x.begin(),x.end());
    int sz=(int)x.size(),res=inf;
    for(int i=0;i<sz;i++) add(1,x[i].fi),add(1,x[i].se);
    for(int i=0;i<sz;i++){
        add(0,x[i].fi);add(0,x[i].se);
        del(1,x[i].fi);del(1,x[i].se);
        if(k==1 && i==sz-1) res=min(res,cost[0]);
        if(k==2) res=min(res,cost[0]+cost[1]);
    }
    cout << ans+res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}
/*
2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/

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