Submission #1540562
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define re(i,b) for(ll i=0;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long
#define ld long double
#define llu long long unsigned
#define pll std::pair<ll, ll>
#define ppll std::pair<ll, pll>
#define vll std::vector<ll>
#define vpll std::vector<pll>
#define vppll std::vector<ppll>
#define mll std::unordered_map<ll, ll>
#define mpll std::unordered_map<pll, ll>
#define mppll std::unordered_map<ppll, ll>
#define sll std::set<ll>
#define ff first
#define ss second
#define msll std::multiset<ll>
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
#define srt(x) sort(all(x))
#define rsrt(x) sort(allr(x))
#define eb emplace_back
#define pb push_back
#define s(yy) ll yy;cin>>yy
#define mod 1000000007
#define maxlong 1e18+5
/*####################################################
# #
# @author #
# Parth Lathiya #
# https://www.cse.iitb.ac.in/~parthiitb/ #
# #
####################################################*/
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef PARTH_LATHIYA_HOME
freopen("A_in.txt","r",stdin);
ll ttt,bkkk;
cin>>ttt;
bkkk=ttt;
while(ttt--) {
cout<<"Testcase - "<<bkkk-ttt<<"\n";
#endif
//--------------------------------------------------------------------------------------
ll n,a,b,c,d;
cin>>a>>b>>c>>d;
std::vector<pair<ld,ll>> v;
v.pb({a*4,25});
v.pb({b*2,50});
v.pb({c,100});
v.pb({d/2.0,200});
cin>>n;
// n*=100;
srt(v);
if(v[0].ff==v[1].ff && v[0].ss==200)
{
swap(v[0],v[1]);
}
if(v[0].ss==200)
{
if(n%2)
cout<<(ll)(v[0].ff*(n-1)+v[1].ff);
else
cout<<(ll)(v[0].ff*n);
}
else
cout<<(ll)(v[0].ff*n);
//--------------------------------------------------------------------------------------
#ifdef PARTH_LATHIYA_HOME
cout<<"\n"; }
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Ice Tea Store |
User |
parthlathiya |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2227 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
sample_04.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
AC |
1 ms |
256 KB |
subtask_1_03.txt |
AC |
1 ms |
256 KB |
subtask_1_04.txt |
AC |
1 ms |
256 KB |
subtask_1_05.txt |
AC |
1 ms |
256 KB |
subtask_1_06.txt |
AC |
1 ms |
256 KB |
subtask_1_07.txt |
AC |
1 ms |
256 KB |
subtask_1_08.txt |
AC |
1 ms |
256 KB |
subtask_1_09.txt |
AC |
1 ms |
256 KB |
subtask_1_10.txt |
AC |
1 ms |
256 KB |
subtask_1_11.txt |
AC |
1 ms |
256 KB |
subtask_1_12.txt |
AC |
1 ms |
256 KB |
subtask_1_13.txt |
AC |
1 ms |
256 KB |
subtask_1_14.txt |
AC |
1 ms |
256 KB |
subtask_1_15.txt |
AC |
1 ms |
256 KB |