Submission #248568

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
248568	2020-07-12T18:27:58 Z	eohomegrownapps	Palindrome-Free Numbers (BOI13_numbers)	C++14	100 / 100	1 ms	384 KB

numbers

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

string s;

ll dpv[20][11][11][2];

ll dp(int ind, int secondlast, int last, bool isSame){
	if (ind==s.size()){
		return 1;
	}
	if (dpv[ind][secondlast][last][isSame]!=-1){
		return dpv[ind][secondlast][last][isSame];
	}
	int upper = isSame ? s[ind]-'0' : 9;
	ll total = 0;
	for (int i = 0; i<=upper; i++){
		if ((i==last&&last!=10) || (i==secondlast&&secondlast!=10)){continue;}
		int ival = i;
		if (i==0&&last==10){
			ival = 10;
		}
		total+=dp(ind+1,last,ival,isSame&&ival==(s[ind]-'0'));
	}
	if (secondlast!=-1){
		dpv[ind][secondlast][last][isSame]=total;
	}
	return total;
}

void initdp(){
	for (int i = 0; i<20; i++){
		for (int j = 0; j<11; j++){
			for (int k = 0; k<11; k++){
				for (int l = 0; l<2; l++){
					dpv[i][j][k][l]=-1;
				}
			}
		}
	}
}

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	ll a,b;
	cin>>a>>b;
	a--;
	s=to_string(b);
	initdp();
	ll tot = dp(0,10,10,true);
	if (a>=0){
		s=to_string(a);
		initdp();
		tot-=dp(0,10,10,true);
	}
	cout<<tot<<'\n';
}

Compilation message

numbers.cpp: In function 'll dp(int, int, int, bool)':
numbers.cpp:10:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (ind==s.size()){
      ~~~^~~~~~~~~~

Subtask #1

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct

Subtask #2

75.0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct