# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004017 | De3b0o | Copy and Paste 3 (JOI22_copypaste3) | C++14 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)
using namespace std;
ll n , A , B , C;
string s;
int main()
{
d3
cin >> n;
cin >> s;
cin >> A >> B >> C;
ll ans = n*A;
ll p;
for(int i = 0 ; 12>i ; i++)
{
ll x = (1<<i);
if(x>n)
break;
if(i==0)
{
ll ans1 = A+B + n*C;
ans=min(ans1,ans);
p=A;
continue;
}
ll ans1;
ll c = min(p+B+2*C,p+A*(x/2));
ans1 = c + B + (n/x)*C;
ans1 += n%x * A;
ans=min(ans,ans1);
p=c;
}
cans
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |