Submission #953624

#	Time	Username	Problem	Language	Result	Execution time	Memory
953624		PieArmy	Palembang Bridges (APIO15_bridge)	C++17	100 / 100	160 ms	14116 KiB

bridge

typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}

multiset<int>s1,s2;

void dengele(){
    while(s2.size()>s1.size()){
        s1.insert(*s2.begin());
        s2.erase(s2.begin());
    }
    while(ll(s1.size())-1>s2.size()){
        s2.insert(*s1.rbegin());
        s1.erase(--s1.end());
    }
}

void code(){
    int k,n;cin>>k>>n;
    ll ans=0;
    vector<pair<int,int>>v={{sonsuz,sonsuz}};
    for(int i=0;i<n;i++){
        char a,b;
        int x,y;
        cin>>a>>x>>b>>y;
        if(a==b){
            ans+=abs(x-y);
        }
        else{
            ans++;
            v.pb({min(x,y),max(x,y)});
        }
    }
    n=v.size()-1;
    if(k==1){
        vector<int>arr;
        for(pair<int,int>x:v){
            if(x.fr==sonsuz)continue;
            arr.pb(x.fr);
            arr.pb(x.sc);
        }
        sort(arr.begin(),arr.end());
        for(int x:arr)
            ans+=abs(arr[n]-x);
        cout<<ans;
        return;
    }
    sort(v.begin(),v.end(),[&](const pair<int,int>&x,const pair<int,int>&y){return x.fr+x.sc<y.fr+y.sc;});
    ll dp[n+1];dp[0]=0;
    int med=-1;
    for(int i=1;i<=n;i++){
        if(s1.size()&&v[i].fr>*s1.rbegin())
            s2.insert(v[i].fr);
        else s1.insert(v[i].fr);
        if(s1.size()&&v[i].sc>*s1.rbegin())
            s2.insert(v[i].sc);
        else s1.insert(v[i].sc);
        dp[i]=dp[i-1];
        dp[i]+=abs(v[i].fr-med)+abs(v[i].sc-med);
        dengele();
        if(*s1.rbegin()>med){
            dp[i]+=abs(med-(*s1.rbegin()))*(s1.size()-s2.size()-2);
        }
        med=*s1.rbegin();
    }
    s1.clear();s2.clear();
    ll cur=0;
    med=-1;
    for(int i=n;i;i--){
        if(s1.size()&&v[i].fr>*s1.rbegin())
            s2.insert(v[i].fr);
        else s1.insert(v[i].fr);
        if(s1.size()&&v[i].sc>*s1.rbegin())
            s2.insert(v[i].sc);
        else s1.insert(v[i].sc);
        cur+=abs(v[i].fr-med)+abs(v[i].sc-med);
        dp[i-1]+=cur;
        dengele();
        if(*s1.rbegin()>med){
            cur+=abs(med-(*s1.rbegin()))*(s1.size()-s2.size()-2);
        }
        med=*s1.rbegin();
    }
    ll ek=inf;
    for(ll x:dp){
        ek=min(ek,x);
    }
    cout<<ans+ek;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
    int t=1;
    if(!t)cin>>t;
    while(t--){code();cout<<endl;}
    return 0;
}

Compilation message (stderr)

bridge.cpp: In function 'void dengele()':
bridge.cpp:21:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     while(ll(s1.size())-1>s2.size()){
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:102:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~
bridge.cpp:102:60: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
      |                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~

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