Submission #2374759

---

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 ans=0;
    r=(G-1)/2;
    l=-(G-1)/2;
    if(G%2==0){
        if(B>=R) l--;
        else r++;
    }
    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);
    cout << bl <<" "<< br << endl;
    ans+=r*(r+1)/2+abs(l)*(abs(l)+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;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result