QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#808232 | #9864. Coin | Zylx | WA | 0ms | 1608kb | C++14 | 941b | 2024-12-10 18:37:15 | 2024-12-10 18:37:15 |
Judging History
answer
#include<cstdio>
using namespace std;
#define LL long long
LL n, k;
LL cal(LL sum) {
return ((sum - 1) / ( k - 1)) + 1;
}
LL time = 0;
bool check(LL sum, LL t, LL cnt) {
time++;
sum += t * cnt;
return (cal(sum) > t);
}
void solve() {
scanf("%lld%lld", &n, &k);
LL lastr = 1e12;
LL sum = k;
while(1) {
LL t = ((sum - 1) / (k - 1)) + 1;
LL l = 0, r = ( n - sum + t - 1) / t + 5;
if(r > lastr) r = lastr;
while(r - l > 1) {
LL mid = (l + r) >> 1;
if(check(sum, t, mid))
r = mid;
else l = mid;
}
lastr = r;
sum += t * r;
if(sum > n) {
sum -= ((sum - n + t - 1) / t) * t;
break;
}
}
printf("%lld\n", sum);
}
int main() {
int T;
scanf("%d", &T);
while(T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1608kb
input:
4 6 2 8 3 10000 2 1919810 114514
output:
4 8 8192 1919805
result:
ok 4 number(s): "4 8 8192 1919805"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 1604kb
input:
100 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 10 5 11 6 2 6 3 6 4 6 5 6 6 6 7 6 8 6 9 6 10 6 11 7 2 7 3 7 4 7 5 7 6 7 7 7 8 7 9 7 10 7 11 8 2 8 3 8 4 8 5 8 6 8 7 8 8 8 9 8 10 8 11 9 ...
output:
2 1 2 1 2 1 2 1 2 1 2 3 2 3 2 3 2 3 2 3 4 3 4 3 4 3 4 3 4 3 4 5 4 5 4 5 4 5 4 5 4 5 6 5 6 5 6 5 6 5 4 5 6 7 6 7 6 7 6 7 8 8 8 7 8 7 8 7 8 7 8 8 8 9 8 9 8 9 8 9 8 8 8 9 10 9 10 9 10 9 8 8 11 9 10 11 10 11 10 11
result:
wrong answer 2nd numbers differ - expected: '2', found: '1'