QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#225479 | #6300. Best Carry Player 2 | Freeuni1# | WA | 0ms | 3852kb | C++14 | 2.2kb | 2023-10-24 18:15:35 | 2023-10-24 18:15:35 |
Judging History
answer
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
int dp[42][22][2];
int dp1[42][22][2];
void printNum(int i, int j, int k, string &x, bool &st) {
if (i) {
int nx = dp[i][j][k];
int val = k ? 10 - (nx&1) - (x[i] - '0') : 0;
if (val) st = true;
if (st) {
cout << val;
}
printNum(i-1, nx/2, nx&1, x, st);
}
}
main() {
ios::sync_with_stdio(0);
int t;
cin >> t;
while (t --) {
int ansI, ansJ, ansK, ansR = 100000;
string x;
int k;
cin >> x >> k;
reverse(x.begin(), x.end());
x = " " + x;
while (x.size() < 40) {
x += '0';
}
memset(dp, ~0, sizeof dp);
dp[0][0][0] = 0;
dp1[0][0][0] = 0;
for (int i = 1; i < x.size(); i ++) {
for (int j = 0; j <= k; j ++) {
dp1[i][j][0] = 10000;
dp1[i][j][1] = 10000;
if (dp[i-1][j][0] != -1) {
dp[i][j][0] = 2 * j;
dp1[i][j][0] = dp1[i-1][j][0];
}
if (dp[i-1][j][1] != -1 && x[i] != '9' && dp1[i][j][0] > dp1[i-1][j][1]) {
dp[i][j][0] = 2 * j + 1;
dp1[i][j][0] = dp1[i-1][j][1];
}
if (j && dp[i-1][j-1][0] != -1 && x[i] != '0') {
dp[i][j][1] = 2 * (j-1);
dp1[i][j][1] = i;
}
int r = (x[i] == '9' ? dp1[i-1][j-1][1] : i);
if (j && dp[i-1][j-1][1] != -1 && dp1[i][j][1] > r) {
dp[i][j][1] = 2 * (j-1) + 1;
dp1[i][j][1] = r;
}
//cout << i << " " << j << " " << dp[i][j][0] << " " << dp[i][j][1] << endl;
}
if (dp[i][k][0] != -1 && ansR > dp1[i][k][0]) {
bool nuli = false;
printNum(i, k, 0, x, nuli);
if (!nuli) {
cout << 1;
}
cout << endl;
break;
}
}
}
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3852kb
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:
1 10000 1000 100 10 1 900001 9900001 99900001 999900001 10000000001 9999910000 9999901000 9999900100 9999900010 9999900001 9000009999900001 99000009999900001 999000009999900001 99999999999999999900000000000000000 1
result:
wrong answer 1st lines differ - expected: '100000', found: '1'