QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#296236#6300. Best Carry Player 2SaladDays#WA 1ms3484kbC++141.7kb2024-01-02 15:29:212024-01-02 15:29:21

Judging History

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

  • [2024-01-02 15:29:21]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3484kb
  • [2024-01-02 15:29:21]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long

using namespace std;
ll pw[19];
void solve() {
    ll x;int k;
    cin >> x;
    cin >> k;
    vector<int>num_base(40, 0);
    // cout << x << endl;
    for (int i = 0; i <= 18; i ++ ) num_base[i] = (x / pw[i]) % 10;
    // for (auto &it : num_base) cout << it << ' ';cout << endl;
    if (k == 0) {
        for (int j = 0; j <= 19; ++j) {
            if (num_base[j] != 9) {
                cout << 1;
                for (int i = 0; i < j; ++i) cout << 0;cout << endl;
                return;
            }
        }
    }
    for (int i = 0; i <= 20; ++i) {
        int cnt = 0, pos = i;
        vector<int>ans(40);
        vector<int>num = num_base;  
        while (cnt < k) {
            if (num[pos] == 0) {
                pos++;continue;
            }
            ans[pos] = 10 - num[pos];
            num[pos + 1]++;
            cnt++;
            pos++;
        }
        // cout << "T" << i << " cnt-" << cnt << " : "; for (auto &it : ans) cout << it << ' ';cout << endl;
        if (num[pos] >= 10) continue;
        // cout << pos << " : ";
        int j = pos;
        while (j >= 0 && ans[j] == 0) j--;
        for (; j >= 0; --j) cout << ans[j];cout << endl;
        return;
    }
}

signed main() {
#ifdef DEBUG
    freopen("demo.in", "r", stdin);
    freopen("demo.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;
    cin >> T;
    pw[0] = 1;
    for (int i = 1; i <= 18; i ++ ) {
        pw[i] = pw[i - 1] * 10;
        // cout << pw[i] << endl;
    }
    
    for (int _ = 1; _ <= T; _ ++) {
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3484kb

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: 1ms
memory: 3472kb

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
99999000010000000000
9999910000
9999901000
9999900100
9999900010
9999900001
9000009999900001
99000009999900001
999000009999900001
99999999999999999900000000000000000
1000000000000000000

result:

wrong answer 11th lines differ - expected: '10000000001', found: '99999000010000000000'