QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#606435#5115. Clone Ranranice_cup#AC ✓88ms3652kbC++14386b2024-10-03 08:06:482024-10-03 08:06:49

Judging History

你现在查看的是最新测评结果

  • [2024-10-03 08:06:49]
  • 评测
  • 测评结果:AC
  • 用时:88ms
  • 内存:3652kb
  • [2024-10-03 08:06:48]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MID int mid=(l+r)>>1;
#define ls p<<1
#define rs p<<1|1
int n,a,b,c;
int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>a>>b>>c;
		ll ans=0x3f3f3f3f3f3f3f3f;
		for(int i=0;i<=30;i++){
			int n=1<<i;
			ll res=1ll*a*i;
			res+=1ll*((c-1)/n+1)*b;
			ans=min(ans,res);
		}
		cout<<ans<<endl;
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3652kb

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: 88ms
memory: 3644kb

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