Submission #2374944

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;


int main(){
    int R,G,B;
    cin >> R >> G >> B;
    int rl,rr,r,l,bl,br;
    LL res=LINF;
    for(int i=-300;i+G<=300;i++){
        LL ans=0;
        l=i;
        r=l+(G-1);
        rr=-100+(R-1)/2;
        bl=100-(B-1)/2;
        if(bl<=r){
            bl=r+1;
        }
        if(l<=rr){
            rr=l-1;
        }
        rl=rr-(R-1);
        br=bl+(B-1);
        if(r<=0){
            ans+=abs(r)*G+abs(r-l)*(abs(r-l)+1)/2;
        }
        else if(0<=l){
            ans+=l*G+(r-l)*(r-l+1)/2;
        }
        else{
            ans+=abs(l)*(abs(l)+1)/2+r*(r+1)/2;
        }
        if(100<bl){
            ans+=(bl-100)*B+abs(br-bl)*(abs(br-bl)+1)/2;
        }
        else{
            ans+=abs(bl-100)*(abs(bl-100)+1)/2+(abs(br-100))*(abs(br-100)+1)/2;
        }
        if(rr<-100){
            ans+=abs(rr+100)*R+abs(rr-rl)*(abs(rr-rl)+1)/2;
        }
        else{
            ans+=abs(rl+100)*(abs(rl+100)+1)/2+abs(rr+100)*(abs(rr+100)+1)/2;
        }
        res=min(ans,res);
    }
    cout << res << endl;
    return 0;
}

Submission Info

Judge Result