Submission #76666721

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

inline ll cost(ll a,ll b,ll H,ll V,ll A,ll B){
    ll H1=H+2*a,V1=V+2*b;
    ll S=H1+V1,O=(S+1)/2;
    ll h1=min(H1,O);
    ll v1=O-h1,h2=H1-h1,v2=V1-v1;
    return A*(h1+v2)+B*(v1+h2);
}

signed main(){
    int T;
    scanf("%d",&T);
    while(T--){
        ll A,B,X,Y;
        scanf("%lld%lld%lld%lld",&A,&B,&X,&Y);
        ll dx=abs(X),dy=abs(Y);
        if(A>B){ swap(A,B); swap(dx,dy); }
        ll H=dx,V=dy;
        ll base=(H+V+1)/2;
        ll C=base-H;
        ll ans=cost(0,0,H,V,A,B);
        ll b0=max(0LL,-C);
        ans=min(ans,cost(0,b0,H,V,A,B));
        ll a0=max(0LL,C);
        ans=min(ans,cost(a0,0,H,V,A,B));
        if(C<=-1){
            ll b1=-C-1;
            ans=min(ans,cost(0,b1,H,V,A,B));
        }
        ll a1=max(0LL,C+1);
        ans=min(ans,cost(a1,0,H,V,A,B));
        printf("%lld\n",ans);
    }
    return 0;
}

Submission Info

Judge Result