oj.uz

Submission #34584

# Submission time Handle Problem Language Result Execution time Memory
34584 2017-11-13T19:28:01 Z ioitcprac Palindrome-Free Numbers (BOI13_numbers) C++14
72.5 / 100
 0 ms 2052 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define REP(i, n) for(ll i=0; i<n; i++)
#define FOR(i, a, b) for(ll i = a; i<=b; i++)
#define FORD(i, a, b) for(ll i = a; i>=b; i--)
#define DEBUG(x) cout<<#x<<" > "<<x<<endl;
#define endl '\n'

const ll MOD = 1e9 + 7, INF = 1e18, MX = 1e5 + 4;

ll a, b;
string s;
ll dp[20][2][11][11];

ll f(ll idx, bool b, ll pree, ll pre)
{
	if(idx == s.size())
		return 1;

	if(pre == pree && pre != 10)
		return 0;

	if(dp[idx][b][pree][pre] != -1)
		return dp[idx][b][pree][pre];

	ll ans = 0;
	FOR(i, 0, 9)
	{
		if(b == 0 && i < s[idx] - '0' && i != pree && i != pre)
		{
			ans += f(idx + 1, 1, pre, i);
		}

		if(b == 0 && i == s[idx] - '0' && i != pree && i != pre)
		{
			ans += f(idx + 1, 0, pre, i);
		}

		if(b == 1 && i != pre && i != pree)
		{
			ans += f(idx + 1, 1, pre, i);
		}
	}

	return dp[idx][b][pree][pre] = ans;
}

int main()
{	
	memset(dp, -1, sizeof(dp));
	cin >> a >> b;
	a--;
	s = to_string(a);
	ll ff = f(0, 0, 10, 10);
	s = to_string(b);
	memset(dp, -1, sizeof(dp));
	ll fff = f(0, 0, 10, 10);
	cout << fff - ff << endl;
	

}

Compilation message

numbers.cpp: In function 'll f(ll, bool, ll, ll)':
numbers.cpp:20:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(idx == s.size())
         ^

Subtask #1
12.5 / 25.0

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

Subtask #2
60.0 / 75.0

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