제출 #574083

#제출 시각아이디문제언어결과실행 시간메모리
574083MODDIRoses (BOI20_roses)C++14
0 / 100
1 ms300 KiB
#include <bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define mp make_pair #define pb push_back using namespace std; ll lcm(ll a, ll b){ return (a * b / __gcd(a,b)); } int main(){ ll n, a, b, c, d; cin>>n>>a>>b>>c>>d; ll t = lcm(a, c); ll ans = 0; if((t/a)*b <= (t/c)*d){ ll can = n / a; ans += can * b; n -= can * a; ll canA = n / a; if(n % a != 0) canA++; ll canC = n / c; if(n % c != 0) canC++; if(canA * b < canC * d){ ans += canA * b; } else ans += canC * d; } else{ ll can = n / c; ans += can * d; n -= can * c; ll canA = n / a; if(n % a != 0) canA++; ll canC = n / c; if(n % c != 0) canC++; if(canA * b < canC * d){ ans += canA * b; } else ans += canC * d; } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...