제출 #491413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491413		rrrr10000	Palembang Bridges (APIO15_bridge)	C++14	100 / 100	375 ms	16684 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define popcnt __builtin_popcountll
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
    ll n,k;cin>>k>>n;
    vp v;
    ll ans=0;
    rep(i,n){
        char c,d;ll a,b;cin>>c>>a>>d>>b;
        if(c==d)ans+=abs(a-b);
        else v.pb(min(a,b),max(a,b));
    }
    n=v.size();
    if(n==0)dame(ans);
    vi l(n+1),r(n+1);
    vp srt(n);rep(i,n)srt[i]=P(v[i].fi+v[i].se,i);
    sort(all(srt));
    {
        multiset<ll> S1,S2;
        rep(i,n){
            P x=v[srt[i].se];
            l[i+1]=l[i];
            S1.insert(x.fi);S2.insert(x.se);
            l[i+1]-=x.fi;l[i+1]+=x.se;
            {
                auto itr=S1.end();itr--;
                l[i+1]+=*itr*2;
                S2.insert(*itr);
                S1.erase(itr);
            }
            {
                auto itr=S2.begin();
                l[i+1]-=*itr*2;
                S1.insert(*itr);
                S2.erase(itr);
            }
        }
    }
    {
        multiset<ll> S1,S2;
        for(int i=n-1;i>=0;i--){
            P x=v[srt[i].se];
            r[i]=r[i+1];
            S1.insert(x.fi);S2.insert(x.se);
            r[i]-=x.fi;r[i]+=x.se;
            {
                auto itr=S1.end();itr--;
                r[i]+=*itr*2;
                S2.insert(*itr);
                S1.erase(itr);
            }
            {
                auto itr=S2.begin();
                r[i]-=*itr*2;
                S1.insert(*itr);
                S2.erase(itr);
            }
        }
    }
    ll mi=l[n];
    if(k==2)rep(i,n+1)chmin(mi,l[i]+r[i]);
    out(ans+mi+n);
}

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