제출 #1147845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147845		Theo830	Palembang Bridges (APIO15_bridge)	C++20	0 / 100	1 ms	1096 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll anss = 1e18;
char p[100005],q[100005];
ll x[100005],y[100005];
ll n;
ll dp[100005];
vector<ll>vale;
ll solve(ll a,ll b){
    ll ans = 0;
    f(i,0,n){
        if(p[i] != q[i])
            ans += min(abs(a - x[i]) + abs(a - y[i]),abs(b - x[i]) + abs(b - y[i]));
    }
    anss = min(ans,anss);
    return ans;
}
ll evre(ll z){
    if(dp[z] != -1){
        return dp[z];
    }
    ll x = vale[z];
    ll l = 0,r = vale.size()-2;
    ll C = 1e18;
    while(l <= r){
        ll mid = (l+r)/2;
        ll A = solve(x,vale[mid]);
        ll B = solve(x,vale[mid+1]);
        C = min(C,A);
        C = min(C,B);
        if(A >= B){
            l = mid + 1;
        }
        else{
            r = mid - 1;
        }
    }
    return dp[z] = C;
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll k;
    cin>>k>>n;
    assert(k == 2);
    set<ll>ex;
    ll res = 0;
    f(i,0,n){
        cin>>p[i]>>x[i]>>q[i]>>y[i];
        ex.insert(x[i]);
        ex.insert(y[i]);
        if(p[i] != q[i]){
            res++;
        }
        else{
            res += abs(x[i] - y[i]);
        }
    }
    memset(dp,-1,sizeof dp);
    for(auto x:ex){
        vale.pb(x);
    }
    vale.pb(1e9);
    ll l = 0,r = vale.size()-2;
    while(l <= r){
        ll mid = (l+r)/2;
        ll a1 = 1e18,a2 = 1e18;
        f(j,max(0LL,mid-40),mid+1){
            a1 = min(a1,evre(j));
        }
        f(j,mid+1,min((ll)vale.size(),mid+10)){
            a2 = min(a2,evre(j));
        }
        if(a1 >= a2){
            l = mid + 1;
        }
        else{
            r = mid - 1;
        }
    }
    cout<<anss + res<<"\n";
    bool ok = 1;
    bool ivra = 0;
    f(j,0,(ll)(vale.size()) - 1){
        if(evre(j) < evre(j+1)){
            ivra = 1;
        }
        if(evre(j) >= evre(j+1) && ivra){
            ok = 0;
        }
    }
    assert(ok);
}
/*
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