/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 2ms 324.0 KiB
#4 Wrong Answer 2ms 576.0 KiB
#5 Wrong Answer 5ms 576.0 KiB
#6 Wrong Answer 39ms 1.309 MiB
#7 Wrong Answer 40ms 1.32 MiB
#8 Wrong Answer 40ms 1.316 MiB
#9 Wrong Answer 41ms 1.316 MiB
#10 Wrong Answer 1ms 320.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

int main ()
{
    Tasrik;
    ll t=1,n,a,b,d;
    cin>>t;
    while(t--)
    {
        cin>>n>>d>>a>>b;

        ll ans=0;
        if(n>d)
        {
            ans=d*a;
            ll x=(n-d);
            ans+=(b*x);
        }

        else
            ans=b*n;

        cout<<ans<<endl;

    }

}


Information

Submit By
Type
Submission
Problem
P1090 Summer trip
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 16:00:14
Judged At
2024-10-03 13:09:32
Judged By
Score
10
Total Time
41ms
Peak Memory
1.32 MiB