QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#208403 | #5115. Clone Ranran | Tdfccc | AC ✓ | 48ms | 3688kb | C++14 | 586b | 2023-10-09 16:01:50 | 2023-10-09 16:01:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
for(int i = 0; i < n; i ++)
{
long long a, b, c;
cin >> a >> b >> c;
int cnt = 0;
long long needtime1 = 0;
long long num = 1;
long long res = 1e18;
for(int j = 0; j < 32; j ++)
{
needtime1 = (c - 1) / num + 1;
// if(c % num != 0) needtime1 += 1;
needtime1 *= b;
needtime1 += a * j;
res = min(res, needtime1);
num *= 2;
}
cout << res << endl;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
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: 48ms
memory: 3688kb
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