QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#129638#6300. Best Carry Player 2qLAC ✓45ms4940kbC++148.2kb2023-07-22 21:43:592023-07-22 21:44:02

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-22 21:44:02]
  • 评测
  • 测评结果:AC
  • 用时:45ms
  • 内存:4940kb
  • [2023-07-22 21:43:59]
  • 提交

answer

#include<cstdio>
#include<initializer_list>
namespace QL{
	namespace details{
		template<typename _Tp>
		static constexpr std::size_t integral_length=sizeof(_Tp)*10/sizeof(int);
#ifndef _GLIBCXX_TYPE_TRAITS
		template<typename _Tp>
		struct is_unsigned{constexpr operator bool(){return false;}};
		template<>
		struct is_unsigned<unsigned int>{constexpr operator bool(){return true;}};
		template<>
		struct is_unsigned<unsigned long>{constexpr operator bool(){return true;}};
		template<>
		struct is_unsigned<unsigned long long>{constexpr operator bool(){return true;}};
		template<>
		struct is_unsigned<unsigned __int128>{constexpr operator bool(){return true;}};
		template<>
		struct is_unsigned<unsigned char>{constexpr operator bool(){return true;}};
		template<typename _Tp>
		static constexpr bool is_unsigned_t=is_unsigned<_Tp>();
#else
		template<typename _Tp>
		static constexpr bool is_unsigned_t=std::is_unsigned<_Tp>();
#endif
	}
	namespace IO{
		using details::integral_length;
		using details::is_unsigned_t;
		class IO{
		protected:
#ifdef _INITIALIZER_LIST
			using LIST=std::initializer_list<int>;
#endif
#ifndef LOCAL
			FILE*IN;
			FILE*OUT;
			static constexpr int SIZE=1<<20;
			char buf[SIZE]{},*p1{},*p2{},obuf[SIZE]{},*p3{};
			char std_getchar(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,SIZE,IN),p1==p2)?EOF:*p1++;}
			void std_putchar(char ch){(p3-obuf<SIZE)?(*p3++=ch):(out_end(),*p3++=ch);}
			template<std::size_t L>
			FILE*set_in(const char(&name)[L]){
				static char in[L+5]={};
				__builtin_memcpy(in,name,sizeof in);
				in[L-1]='.',in[L]='i',in[L+1]='n',in[L+2]='\0';
				return std::fopen(in,"r");
			}
			template<std::size_t L>
			FILE*set_out(const char(&name)[L]){
				static char out[L+5];
				__builtin_memcpy(out,name,sizeof out);
				out[L-1]='.',out[L]='o',out[L+1]='u',out[L+2]='t',out[L+3]='\0';
				return std::fopen(out,"w");
			}
#else
			char std_getchar(){return std::getchar();}
			void std_putchar(char ch){std::putchar(ch);}
			void err_putchar(char ch){std::fprintf(stderr,"%c",ch);}
			template<std::size_t L>
			void reset_stdin(const char(&name)[L]){
				static char in[L+5]={};
				__builtin_memcpy(in,name,sizeof in);
				in[L-1]='.',in[L]='i',in[L+1]='n',in[L+2]='\0';
				freopen(in,"r",stdin);
			}
			template<std::size_t L>
			void reset_stdout(const char(&name)[L]){
				static char out[L+5];
				__builtin_memcpy(out,name,sizeof out);
				out[L-1]='.',out[L]='o',out[L+1]='u',out[L+2]='t',out[L+3]='\0';
				freopen(out,"w",stdout);
			}
#endif
		public:
#ifndef LOCAL
			IO():IN(stdin),OUT(stdout),p1(buf),p2(buf),p3(obuf){}
			template<std::size_t L>
			IO(const char(&name)[L]):IN(set_in(name)),OUT(set_out(name)),p1(buf),p2(buf),p3(obuf){}
			template<std::size_t L>
			IO(const char(&name)[L],bool in,bool out):IN(in?set_in(name):stdin),OUT(out?set_out(name):stdout),p1(buf),p2(buf),p3(obuf){}
			~IO(){out_end();}
			void out_end(){__builtin_fwrite(obuf,p3-obuf,1,OUT),p3=obuf;}
#else
			IO(){}
			template<std::size_t L>
			IO(const char(&name)[L]){reset_stdin(name),reset_stdout(name);}
			template<std::size_t L>
			IO(const char(&name)[L],bool in,bool out){in&&(reset_stdin(name),0),out&&(reset_stdout(name),0);}
#endif
		    template<typename T>
		    void read(T&x){
		        x=0;bool flag=0;char ch=std_getchar();
		        for(;ch<'0'||ch>'9';ch=std_getchar()) if(ch=='-') flag=1;
		        if(flag) for(;ch>='0'&&ch<='9';ch=std_getchar()) x=(x<<1)+(x<<3)-(ch&15);
		        else for(;ch>='0'&&ch<='9';ch=std_getchar()) x=(x<<1)+(x<<3)+(ch&15);
		    }
		    template<typename T=int>
		    T read(){
		        T x=0;bool flag=0;char ch=std_getchar();
		        for(;ch<'0'||ch>'9';ch=std_getchar()) if(ch=='-') flag=1;
		        if(flag) for(;ch>='0'&&ch<='9';ch=std_getchar()) x=(x<<1)+(x<<3)-(ch&15);
		        else for(;ch>='0'&&ch<='9';ch=std_getchar()) x=(x<<1)+(x<<3)+(ch&15);
		        return x;
		    }
		    void read(char*str){
		        while((*str=std_getchar())==' '||*str=='\n');
		        while((*++str=std_getchar())!=' '&&*str!='\n');
		        *str=0;
		    }
		    void read(char&c){while((c=std_getchar()==' '||c=='\n'));}
		    template<typename T>
		    void write(T x){
		        static char sta[integral_length<T>];
		        int top=0;
				if(is_unsigned_t<T>){
		            do sta[top++]=(x%10)|48,x/=10;
		            while(x);
		    	}
				else{
			        if(x<0){
			            std_putchar('-');
			            do sta[top++]=((-x)%10)|48,x/=10;
			            while(x);
			        }
			        else{
			            do sta[top++]=(x%10)|48,x/=10;
			            while(x);
			        }
			    }
		        while(top) std_putchar(sta[--top]);
		    }
		    void write(char x){std_putchar(x);}
		    void write(char*str){while(*str!='\0') std_putchar(*str++);}
		    void write(const char *str){while(*str!='\0') std_putchar(*str++);}
#ifdef LOCAL
		    template<typename T>
		    void error(T x){
		        static char sta[integral_length<T>];
		        int top=0;
				if(is_unsigned_t<T>){
		            do sta[top++]=(x%10)|48,x/=10;
		            while(x);
		    	}
				else{
			        if(x<0){
			            err_putchar('-');
			            do sta[top++]=((-x)%10)|48,x/=10;
			            while(x);
			        }
			        else{
			            do sta[top++]=(x%10)|48,x/=10;
			            while(x);
			        }
			    }
		        while(top) err_putchar(sta[--top]);
		    }
		    void error(char x){err_putchar(x);}
		    void error(char*str){while(*str!='\0') err_putchar(*str++);}
		    void error(const char *str){while(*str!='\0') err_putchar(*str++);}
#endif
#ifdef _INITIALIZER_LIST
		    template<typename...Args>
		    void read(Args&...args){(void)LIST{(read(args),0)...};}
		    template<typename...Args>
		    void write(Args...args){(void)LIST{(write(args),0)...};}
		    template<typename...Args>
		    void writeln(Args...args){write(args...),std_putchar('\n');}
#ifdef LOCAL
		    template<typename...Args>
		    void error(Args...args){(void)LIST{(error(args),0)...};}
		    template<typename...Args>
		    void errorln(Args...args){error(args...),err_putchar('\n');}
#endif
#else
		    template<typename _Tp,typename...Args>
		    void read(_Tp&x,Args&...args){read(x),read(args...);}
		    void write(){}
		    template<typename _Tp,typename...Args>
		    void write(_Tp x,Args...args){write(x),write(args...);}
		    template<typename...Args>
		    void writeln(Args...args){write(args...),std_putchar('\n');}
#ifdef LOCAL
		    void error(){}
		    template<typename _Tp,typename...Args>
		    void error(_Tp x,Args...args){error(x),error(args...);}
		    template<typename...Args>
		    void errorln(Args...args){error(args...),err_putchar('\n');}
#endif
#endif
		};
	}
}
using namespace QL::IO;
IO lq;
constexpr int N=20;
using ull=unsigned long long;
ull f[N][N][2];
constexpr ull qw[N]{
	1ull,
	10ull,
	100ull,
	1000ull,
	10000ull,
	100000ull,
	1000000ull,
	10000000ull,
	100000000ull,
	1000000000ull,
	10000000000ull,
	100000000000ull,
	1000000000000ull,
	10000000000000ull,
	100000000000000ull,
	1000000000000000ull,
	10000000000000000ull,
	100000000000000000ull,
	1000000000000000000ull,
	10000000000000000000ull
},Inf=0x3f3f3f3f3f3f3f3f;
char n[N];
auto chk_min=[](auto&x,auto y){
	y<x&&(x=y);
};
auto min=[](auto x,auto y){
	return x<y?x:y;
};
signed main(){
	for(int Test_Cases=lq.read();Test_Cases--;){
		ull x;
		int k;
		lq.read(x,k);
		if(k){
			static char sta[N]{};
			int top=0,len=1;
			while(x%10==0) sta[++top]='0',x/=10;
			while(x) n[len++]=(x%10)|48,x/=10;
			for(int i=len;i<N;++i) n[i]='0';
			__builtin_memset(f,0x3f,sizeof f);
			f[0][0][0]=0;
			for(int p=1;p<N;++p){
				for(int j=0;j<=k;++j){
					f[p][j][0]=f[p-1][j][0];
					if(n[p]!='9') chk_min(f[p][j][0],f[p-1][j][1]);
					if(j>=1){
						int least='9'-n[p];
						f[p][j][1]=least*qw[p-1]+f[p-1][j-1][1];
						++least;
						if(n[p]!='0') chk_min(f[p][j][1],least*qw[p-1]+f[p-1][j-1][0]);
					}
				}
			}
			ull ans=min(f[N-1][k][0],f[N-1][k][1]);
			lq.write(ans);
			while(top) lq.write(sta[top--]);
		}
		else{
			int l=0;
			while(x%10==9) ++l,x/=10;
			lq.write('1');
			while(l--) lq.write('0');
		}
		lq.writeln();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 4816kb

input:

4
12345678 0
12345678 5
12345678 18
990099 5

output:

1
54322
999999999987654322
9910

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 2ms
memory: 4872kb

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
1000000000000000000

result:

ok 21 lines

Test #3:

score: 0
Accepted
time: 41ms
memory: 4940kb

input:

100000
119111011091190000 10
1911011191011999 16
110099199000119 0
19009911191091011 13
199090909919000900 17
19009010011919110 5
90910190019900091 18
10911100000101111 1
110090011101119990 4
100909999119090000 12
90901119109011100 2
111010119991090101 4
900991019109199009 5
100919919990991119 8
911...

output:

88988908810000
8088988808988001
10
88808908989
9800909090080999100
80890
909089809980099909
9
80010
9090000880910000
8900
9909
991
9008900
8880880090
8080090801
8009900808909899
80880898981
909
8800909
99988889901
89908888089
980908890980099000
100
9889801
81
908890008099900891
880990801
9998099
890...

result:

ok 100000 lines

Test #4:

score: 0
Accepted
time: 41ms
memory: 4812kb

input:

100000
900019901991919191 0
119199000910909911 18
190001990019910009 12
110091191100109001 6
10191091999110091 18
990011110190190090 5
900900000199919019 14
119100019910100099 17
909911111001111901 3
901100909911099 10
919009910101990019 7
911011009199199100 11
919111110190110999 0
91010111901190900...

output:

1
880800999089090089
9980089991
890999
989808908000889909
809910
99999800080990
80899980089899901
99
9090088901
8009981
8990800800900
1000
99089898880988091000
99101000
8988889980809
99008880080090009
10900
9998889909
889009889909901
808909990100
9090008889889089010
8099888899000
990898099098891000
...

result:

ok 100000 lines

Test #5:

score: 0
Accepted
time: 45ms
memory: 4876kb

input:

100000
90109000009190190 17
100091999119191900 13
119911991111100009 10
191199111011010091 12
99199110109099919 17
900011911110190199 7
990109199990010100 8
90191099199119101 13
101009019910001111 2
999199010010119119 1
91100991091900090 12
901100110901100900 4
10910910019101109 13
99011019901999010...

output:

909890999990809810
908000880808100
8888900991
888988990009
800889890900081
9809801
9990900
8900800880909
89
1
9008908099910
899100
9089980898891
80009899
1009
101
9899888080810
8808900888888981
80801
89890988080889809
88998009000900
90989809809890
889999100
988890810
98991
9900
9990008880980009100
8...

result:

ok 100000 lines

Test #6:

score: 0
Accepted
time: 44ms
memory: 4880kb

input:

100000
190090090190009901 8
110911911110919010 16
101101009991110 1
901011000199900 5
900119091100999099 11
191011011019019001 2
101090009999910019 3
999100919001019919 9
9910090910011001 14
909091191100090191 18
101190999191199909 16
9190199191991 11
19909100909900001 9
10001910011001019 18
1900000...

output:

9990099
89088088889080990
90
9800100
8899000901
99
981
998980090
89909089989009
90908808899909809
8809000808800091
9800808009
90099999
989998089988998981
1
98089
8898980988900100
898890989900
989090
9
989890008909999
100
9099
9
100
89909900091
10
9880899008810
999880098900880991000
9809088998810089
...

result:

ok 100000 lines

Test #7:

score: 0
Accepted
time: 45ms
memory: 4884kb

input:

100000
900101011999010011 17
109019011901009119 6
100001099109091110 12
909900011111999190 17
9191909111910001 17
99119900909191199 15
919999901110090900 11
910099099001091991 5
91019109990991191 13
911019000990111110 1
999099011119100011 1
99199110111911199 11
190111991190901100 4
91011190910911090...

output:

99898988000989990
990881
8900890908890
90099988888000810
90808090888089999
880099090808900
98890010100
8009
890009008809
90
9
89888088801
98900
890889100
988998880990989
98908090
910
899009998809889
990099080809100
9
8980998909898099
800090910
910
9
900
809888909898888810
10
99091
9909998909081
8989...

result:

ok 100000 lines

Test #8:

score: 0
Accepted
time: 41ms
memory: 4876kb

input:

100000
556678926267652258 2
929929657746014640 13
110808054835665500 13
603411220842314620 18
236920943881957481 13
228392045048443659 0
800016407284399949 4
891810444049711534 10
673038060913134012 8
497925775526719327 2
320546054458668782 7
22937449060095980 7
592739113092913372 15
378621488315118...

output:

42
70342253986000
191945164334500
9396588779157685380
9056118042519
10
60
5950288466
86865990
73
1331218
39904020
260886907086628
21378511684881483
27
74912313591831403
202572281666000677
10
2445141061145
1057747266722529
93751641
633355727
6592761984728
5909230
346570
397717429
97513000559636020
27...

result:

ok 100000 lines

Test #9:

score: 0
Accepted
time: 37ms
memory: 4872kb

input:

100000
985148522880985676 12
868739853875504421 3
674884930693570868 4
228845158360886431 12
792918087718155359 13
418451749398757718 1
422674667930380991 18
213704887948982107 7
502947671811732448 6
117372403303189003 18
952382059266835617 17
314526102032441554 1
267958994219475762 10
1012739058027...

output:

477119014324
579
9132
841639113569
1912281844641
2
577325332069619009
1017893
267552
882627596696810997
47617940733164390
6
5780524300
6094197297637
26289587644103349
30
325653666642794763
5920004513991
87
870676180905
49658522498
4270035752229599
76370380
362872
27543029342
814276956422751
12709362...

result:

ok 100000 lines

Test #10:

score: 0
Accepted
time: 37ms
memory: 4880kb

input:

100000
862428474789769520 15
861402445383237914 18
12164614960128916 2
153533193098719886 18
669778305254901625 12
421900684426699134 2
64570921371658045 13
98884778403809206 17
148127093775414570 6
424157195766048310 16
264315954064627485 3
543186220365103714 7
28644666339278806 5
70558958178538527...

output:

7571525210230480
138597554616762086
90
846466806901280114
694745098375
66
9078628341955
1115221596190794
4585430
75842804233951690
515
4896286
21194
94410418214614721
6562581535068
503
6054086
39
785986630
26189732238613
625251091606
35790342913626940
4208119
1
378653717
3895
8030
69
4673598217306
1...

result:

ok 100000 lines

Test #11:

score: 0
Accepted
time: 41ms
memory: 4888kb

input:

100000
29992812429491364 18
280638300691924745 1
773687550709513181 14
817767638240244197 17
795567381538619956 12
667173680932755212 3
692547920587275657 7
899816685881310369 0
887418305313852047 4
114296293682280216 6
635770909236446320 8
79779559576226344 7
723885861365146899 18
35614586662297882...

output:

970007187570508636
5
12449290486819
82232361759755803
618461380044
788
2724343
10
7953
719784
763553700
3773656
276114138634853101
4133377021176
1666925430
2579876078550
238902836
3871039799670569
8107903824643082
37383232105658733
35851211841888
78703
9102167
615719
24910554
7980007100
455768
89519...

result:

ok 100000 lines

Test #12:

score: 0
Accepted
time: 37ms
memory: 4868kb

input:

100000
70221819048738918 8
854206908365074549 16
191105114278421489 6
436751765758778908 4
208357620673273826 12
454216540686693180 17
715905540992087591 16
714996112786224737 16
362288917871644217 17
899675961879259925 4
767901008331879831 0
248327679387972712 14
654991270785448631 0
54125799900198...

output:

51261082
5793091634925451
578511
1092
379326726174
545783459313306820
4094459007912409
5003887213775263
37711082128355783
75
1
72320612027288
1
13800
1839205
651837642537117
2359
69488171498607443
93375957030
1
912677814690334
368382885111
7
774120
208729
58343
983993010
1
632128
6552
5445728345
98
...

result:

ok 100000 lines

Test #13:

score: 0
Accepted
time: 37ms
memory: 4844kb

input:

100000
990009990909090099 0
90090009900900000 16
99999009900090099 0
909090909990009990 6
9900900900009 8
900990900000090099 7
9099090099990090 3
90900909990099099 2
900999009990909909 17
999009099990909099 4
909099909099099009 18
999009999090000990 10
99000000999009990 6
909909900909 12
99009909999...

output:

100
999909909990099100000
100
10000010
99109991
9909901
100000
1
99000990009090101
901
90900090900900991
910099010
991000
90090099091
99009000010000
90000000001000
9990000000910000
99990001000
10
999009990100100
99909990990010
90999999991
99900999000100000
999909990000009010
990099999090009991
99999...

result:

ok 100000 lines

Test #14:

score: 0
Accepted
time: 40ms
memory: 4892kb

input:

100000
909999990909990099 3
99009009999090009 13
90999009009000900 11
90990090000999009 12
999090000009900990 8
999009000900990990 16
90099090900990900 16
90099090900990 17
909000099090909090 16
90000909990909909 2
99090900099000990 4
990090099909000900 3
900090009909909909 6
99990909000999999 9
909...

output:

901
990000909991
990991009100
909999000991
990099010
990999099009100
909900909099009100
999909900909099010
90999900909091010
100
99010
99100
90101
999000010
9099091
9990099900990010000
100
99990100000
90000091
9991
999999909091
90009990000901
999099099910
9990009091
999910099910
900990000009101
9999...

result:

ok 100000 lines

Test #15:

score: 0
Accepted
time: 36ms
memory: 4748kb

input:

100000
900099900000099009 6
90099000099999090 9
90090909099999900 3
99900999999000090 5
99000090909990000 8
909900900090990000 16
90009099900009990 11
909990000099090990 8
9090000990000900 15
9099999009000 5
9090009900999 9
90990900900990 10
9999990909090909 15
99900000009990099 13
99909909099999090...

output:

900991
9900000910
100000
10000000
909090010000
99090099099909010000
900099990100
900909010
90909999009999100
1000000
990099001
9099099100
9090909101
9999990009901
10000
10991
90999901
100
999009099999091
909101
9909099999990090100
9090099000901
909901
91
99999090090901
99901091
100
90009099099100
10...

result:

ok 100000 lines

Test #16:

score: 0
Accepted
time: 37ms
memory: 4876kb

input:

100000
999909009009909909 15
999900090909000099 5
990990009090909090 0
990990090909999009 18
900000990009990990 14
90099909900090000 17
990909099999099900 6
900000909990909009 4
999900990000990 14
999000909999090990 2
90090099900999000 1
99000000099099900 11
990909990009090999 15
990909900900000 4
9...

output:

90990990091000
99901
1
9009909090000991
999009990009010
999909900090099910000
1010000
991
99009999010
10
100000
9999900900100
90009990909001
109100000
9100
999909100
90000010
99090000009999910
909091
90900010
9009000999999009910
101
99991
9999900990009990910
90099900901
9999990099910
1091000
1
1
909...

result:

ok 100000 lines

Test #17:

score: 0
Accepted
time: 41ms
memory: 4828kb

input:

100000
90090009909009909 18
990990090099990909 1
999000009909090909 11
99000909099009090 11
90099990900900000 14
90000009090900900 0
990909009999090090 1
909990090099090900 6
909909990090090000 13
99009009000090090 18
900099990990990090 6
909099909009999990 4
99009909000990999 10
99000999090999090 0...

output:

909909990090990091
1
90090909091
90900990910
9909900009099100000
1
10
909100
90090009910910000
9900990990999909910
9010010
1000
999009001
1
90009000909091
9090900010
99999090009990990100
901000
9090090090101
9909000901
100000
9000009001
10
909909991000000
999990099090900001000
99009900001
1000000
90...

result:

ok 100000 lines