QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#756951 | #5115. Clone Ranran | hikaritocm# | AC ✓ | 32ms | 3624kb | C++14 | 411b | 2024-11-16 22:56:03 | 2024-11-16 22:56:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int a,b,c;
cin>>a>>b>>c;
int ans=1e18;
int cur=0;
int sz=1;
for(int i=0; i<33; i++){
int t=c/sz;
if(c%sz!=0) t++;
ans=min(ans,cur+t*b);
sz*=2;
cur+=a;
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
input:
5 1 1 1 2 3 3 9 9 9 3 26 47 1064 822 1048576
output:
1 7 45 44 21860
result:
ok 5 number(s): "1 7 45 44 21860"
Test #2:
score: 0
Accepted
time: 32ms
memory: 3624kb
input:
99500 1000000000 1000000000 1000000000 1000000000 1000000000 999999999 1000000000 1000000000 999999998 1000000000 1000000000 999999997 1000000000 1000000000 999999996 1000000000 1000000000 999999995 1000000000 1000000000 999999994 1000000000 1000000000 999999993 1000000000 1000000000 999999992 10000...
output:
31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 31000000000 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999998 30999999996 30999999996 30999999996 30999999996 30999999996 ...
result:
ok 99500 numbers