QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #418359 | #5115. Clone Ranran | LLCS# | AC ✓ | 46ms | 3880kb | C++17 | 348b | 2024-05-23 13:05:50 | 2024-05-23 13:05:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
scanf("%d",&T);
long long a,b,c;
while(T)
{
T--;
scanf("%lld%lld%lld",&a,&b,&c);
long long ans=4e18;
for(int t1=0;t1<=30;t1++)
{
long long cnt=1ll<<t1;
long long t2=ceil(1.0L*c/cnt);
ans=min(ans,t1*a+t2*b);
}
printf("%lld\n",ans);
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
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: 46ms
memory: 3880kb
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