QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#627637#5115. Clone Ranrandaoqi#AC ✓26ms3588kbC++17473b2024-10-10 16:34:092024-10-10 16:34:10

Judging History

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

  • [2024-10-10 16:34:10]
  • 评测
  • 测评结果:AC
  • 用时:26ms
  • 内存:3588kb
  • [2024-10-10 16:34:09]
  • 提交

answer

#include<bits/stdc++.h>

using i64 = long long;

void DAOQI() {
    i64 a, b, c;
    std::cin >> a >> b >> c;
    i64 now = 1, ans = 1e18;
    for (int i = 0; i <= 30; i++) {
        ans = std::min(((c - 1) / now + 1) * b + i * a, ans);
        now *= 2;
    }
    std::cout << ans << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;
    while (T--) DAOQI();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 26ms
memory: 3588kb

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