QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#418330#5115. Clone Ranranxqbf#AC ✓62ms3592kbC++14455b2024-05-23 12:46:532024-05-23 12:46:54

Judging History

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

  • [2024-05-23 12:46:54]
  • 评测
  • 测评结果:AC
  • 用时:62ms
  • 内存:3592kb
  • [2024-05-23 12:46:53]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

void solve(){
	LL a, b, c; cin >> a >> b >> c;
	LL ans = 1e18;
	for (int k = 0; (1ll << k) <= 2 * c; k++){
		LL selves = (1ll << k);
		LL round = (c + selves - 1) / selves;
		LL cost = k * a + round * b;
		ans = min(ans, cost);
	}
	cout << ans << endl;
}

int main(){
	ios :: sync_with_stdio(false), cin.tie(0);
	int T;
	for (cin >> T; T--; solve());
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3580kb

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: 62ms
memory: 3592kb

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