1792B - Stand-up Comedian - CodeForces Solution


greedy

Please click on ads to support us..

Python Code:

t = int(input())
for i in range(0,t):
    w, x, y, z = map(int, input().split())
    ans = w
    min_m = min(x,y)
    ans+=2*min_m
    tmp = x+y-(2*min_m)+z
    ans+= min(w+1,tmp)
    if w==0 and x+y+z>0:
        ans=1
    print(ans)

C++ Code:

// RAHUL MALAKAR 2112022

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

#define ll long long
#define ld long double

#define sp setprecision
#define eb emplace_back

#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define sll set<int>

#define sorti(v) sort(v.begin(), v.end())

int main()
{

    ios_base::sync_with_stdio(false);

    ll t;
    cin >> t;
    while (t--)
    {
        ll a, b, c, d;
        cin >> a >> b >> c >> d;
        if(b<c){swap(b,c);}
        if(a){
            cout<<a+2*c+min(a+1,b-c+d)<<endl;
        }
        else{cout<<1<<endl;}

    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture