QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#51084#1289. A + B Problemckiseki#WA 24ms4144kbC++1.4kb2022-09-30 17:33:332022-09-30 17:33:36

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-09-30 17:33:36]
  • 评测
  • 测评结果:WA
  • 用时:24ms
  • 内存:4144kb
  • [2022-09-30 17:33:33]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        string S, A, B;
        cin >> S;
        assert (S.size() == n + m);
        const int orgn = n, orgm = m;
        for (char c: S) {
            if (c == '1') {
                if (n > m) {
                    A += c;
                    --n;
                } else {
                    B += c;
                    --m;
                }
            } else {
                if (m == 0 || (n <= m && n > 0)) {
                    A += c;
                    --n;
                } else {
                    B += c;
                    --m;
                }
            }
        }
        n = orgn, m = orgm;
        assert (A.size() == n);
        assert (B.size() == m);
        reverse(A.begin(), A.end());
        reverse(B.begin(), B.end());
        string C(max(n, m), '\0');
        int carry = 0;
        for (int i = 0; i < max(n, m); i++) {
            int x = carry + (i < n ? A[i] - '0' : 0) + (i < m ? B[i] - '0' : 0);
            C[i] = char(x % 2 + '0');
            carry = x / 2;
        }
        if (carry) {
            assert (carry == 1);
            C += char(carry + '0');
        }
        while (C.size() > 1 && C.back() == 0)
            C.pop_back();
        reverse(C.begin(), C.end());
        cout << C << '\n';
    }
    return 0;
}

详细

Test #1:

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

input:

3
4 3
1000101
2 2
1111
1 1
00

output:

1101
110
0

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 24ms
memory: 4144kb

input:

11110
10 8
111011010011100100
3 5
01011000
7 6
1110101010000
9 1
0110100101
1 9
0100001110
8 10
000101101011111000
9 6
011111111000111
1 9
1011101101
10 7
00100011000100000
4 9
1000101101010
8 4
100100110000
8 9
00101111011000101
8 9
11000000101011110
7 6
1111010100110
2 9
01001110101
4 5
100010100
...

output:

10010000000
11100
10011100
110100101
100001110
1111111110
1000010111
111101101
1110100000
111101010
11110000
1000001101
1001011110
10101110
101110101
11100
1111010
0001000010
1010001011
10001000101
10000101
1001000
111111110
1110
111
1111110001
10110111
1011010101
1111000
111000011
00110
11111
01100...

result:

wrong answer 1st lines differ - expected: '10011010100', found: '10010000000'