QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#128803#6300. Best Carry Player 2xcyyyyyWA 1ms3604kbC++14922b2023-07-21 15:53:462023-07-21 16:06:04

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-21 16:06:04]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3604kb
  • [2023-07-21 15:53:46]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define bs 36
int t,k;
long long x;
__int128 dp[40][20][2],bit[40];
void write(__int128 x){
	if(x>9)write(x/10);
	putchar(x%10^48);
}
int main(){
	bit[0]=1;
	for(int i=1;i<=36;i++)bit[i]=bit[i-1]*10;
	scanf("%d",&t);
	while(t--){
		memset(dp,0x3f,sizeof(dp));
		scanf("%lld%d",&x,&k);
		dp[0][0][0]=0;
		if(x/bit[0]%10!=0)dp[0][1][1]=10-x/bit[0]%bit[1];
		for(int i=1;i<bs;i++){
			dp[i][0][0]=0;
			for(int j=1;j<=k;j++){
				if(x/bit[i]%10!=9)dp[i][j][0]=min(dp[i-1][j][0],dp[i-1][j][1]);
				else dp[i][j][0]=dp[i-1][j][0];
				if(x/bit[i]%10)dp[i][j][1]=min( dp[i-1][j-1][0]+bit[i]*(10-x/bit[i]%10) , dp[i-1][j-1][1]+bit[i]*(9-x/bit[i]%10) );
				else dp[i][j][1]=dp[i-1][j-1][1]+bit[i]*(9-x/bit[i]%10);
			}
		}
		write(min(dp[bs-1][k][0],dp[bs-1][k][1])==0?1:min(dp[bs-1][k][0],dp[bs-1][k][1]));
		puts("");
	}
	return 0;
}
/*
1
1 2
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3548kb

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'