QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#298064 | #6300. Best Carry Player 2 | QQHQQHQQH# | RE | 0ms | 3532kb | C++17 | 1.9kb | 2024-01-05 16:57:35 | 2024-01-05 16:57:36 |
Judging History
answer
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef unsigned long long LL;
typedef pair<LL, LL> PII;
const LL N = 19, INF = 0x3f3f3f3f, mod = 1e9 + 7;
LL pow10[60];
LL f(LL x, LL k)
{
if (k == 1) return x % 10;
LL res = pow10[k - 1];
return x / res % 10;
}
void solve()
{
LL x, k;
cin >> x >> k;
LL cnt = 0;
while (x % 10 == 0) x /= 10, cnt++;
if (k == 0)
{
for (LL i = 0; i <= N; i++)
if (x / pow10[i] % 10 != 9)
{
cout << pow10[i] << endl;
while (cnt--) cout << "0";
return;
}
}
LL ans = 0;
while (k)
{
if (f(x, k + 1) != 9)
{
LL res = pow10[k];
ans += res - x % res;
break;
}
else
{
LL st = k, en = k;
while (f(x, st) == 9) st++;
while (f(x, en) == 9) en--;
st--, en++;
if (st - en + 1 >= k)
{
ans += pow10[st - k + 1 - 1];
break;
}
else
{
LL posx = en - 1;
while (f(x, posx) == 0) posx--;
if (st - posx + 1 <= k)
{
ans += (pow10[st - posx + 1] - x % pow10[st] / pow10[posx - 1]) * pow10[posx - 1];
k -= st - posx + 1;
}
else
{
ans += pow10[en];
k -= st - en + 1;
}
}
}
}
cout << ans;
while (cnt--) cout << "0";
cout << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
pow10[0] = 1;
for (LL i = 1; i <= N; i++)
pow10[i] = pow10[i - 1] * 10;
LL T = 1;
cin >> T;
while (T--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
input:
4 12345678 0 12345678 5 12345678 18 990099 5
output:
1 54322 999999999987654322 9910
result:
ok 4 lines
Test #2:
score: -100
Runtime Error
input:
21 999990000099999 0 999990000099999 1 999990000099999 2 999990000099999 3 999990000099999 4 999990000099999 5 999990000099999 6 999990000099999 7 999990000099999 8 999990000099999 9 999990000099999 10 999990000099999 11 999990000099999 12 999990000099999 13 999990000099999 14 999990000099999 15 999...