QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#301497#6300. Best Carry Player 2Andyqian7WA 0ms1648kbC++142.1kb2024-01-09 23:24:402024-01-09 23:24:40

Judging History

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

  • [2024-01-09 23:24:40]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:1648kb
  • [2024-01-09 23:24:40]
  • 提交

answer

#include <stdio.h>
#define ll long long
ll x[100000];
int dig[100000];
void to_str(ll x, char *c)
{
    for (int i = 0; i < 18; i++)
    {
        *c = x % 10 + 48;
        x /= 10;
        c++;
    }
}
ll solve(ll x, int dig)
{
    int t = 1;
    char c[18];
    to_str(x, c);
    if (!dig)
    {
        return 0;
    }
    for (int i = 0; i < 18; i++)
    {
        int j = i + 1, k = i;
        while (c[j] == '9' && j < 18)
        {
            j++;
        }
        while (c[k] == '0')
        {
            k--;
        }
        if (j - k > dig || j < dig)
            continue;
        ll tmp = 0;
        for (int l = k - 1; l >= 0; l--)
        {
            tmp = 10 * tmp + c[l] - 48;
        }
        ll tmp2 = 1;
        for (int l = k; l < j; l++)
        {
            tmp2 *= 10;
        }
        ll tmp3 = 0;
        for (int l = j - 1; l >= k; l--)
        {
            tmp3 = tmp3 * 10 + c[l] - 48;
        }
        ll tmp5 = solve(tmp, dig - (j - k)) + tmp, tmp6 = tmp5 - tmp;
        int cnt = k;
        while (cnt--)
        {
            tmp5 /= 10;
        }
        ll tmp4 = tmp2 - tmp3 - tmp5;
        for (int l = 0; l < k; l++)
        {
            tmp4 *= 10;
        }
        return tmp6 + tmp4;
    }
    return -1;
}
int main()
{
    int T;
    scanf("%d", &T);
    for (int i = 0; i < T; i++)
    {
        scanf("%lld%d", x + i, dig + i);
    }
    for (int i = 0; i < T; i++)
    {
        int zero = 0;
        if (!dig[i])
        {
            char c[18];
            to_str(x[i], c);
            int j = 0;
            ll i = 1;
            while (c[j] == '9')
            {
                j++;
                i *= 10;
            }
            printf("%lld\n", i);
        }
        else
        {
            while (!(x[i] % 10))
            {
                x[i] /= 10;
                zero++;
            }
            printf("%lld", solve(x[i], dig[i]));
            while (zero--)
            {
                putchar('0');
            }
            putchar('\n');
        }
    }
}

详细

Test #1:

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

input:

4
12345678 0
12345678 5
12345678 18
990099 5

output:

1
54322
999999999987654322
9910

result:

ok 4 lines

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 1648kb

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...

output:

100000
10000
1000
100
10
1
900001
9900001
99900001
999900001
10000000001
9999910000
9999901000
9999900100
9999900010
9999900001
9000009999900001
99000009999900001
999000009999900001
99999999999999999900000000000000000
100000000000000000

result:

wrong answer 21st lines differ - expected: '1000000000000000000', found: '100000000000000000'