Submission #1120346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120346		vjudge1	Palindrome-Free Numbers (BOI13_numbers)	C++17	100 / 100	2 ms	508 KiB

numbers

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define inf 0x3F3F3F3F

int dp[20][11][11][2][2];

string N;

int f(int i, int a, int b, int ff, int xf)
{
  if (i == N.length()) return 1;
  if (dp[i][a][b][ff][xf] != -1) return dp[i][a][b][ff][xf];
  int res = 0;
  for (int c = 0; c <= 9; c++)
  {
    if (a == c || b == c) continue;
    if (ff && c > N[i] - '0') continue;
    int nwf = ff && (c == N[i] - '0');
    int nwxf = xf && (c == 0);
    res += f(i + 1, (nwxf ? 10 : b), (nwxf ? 10 : c), nwf, nwxf);
  }
  return dp[i][a][b][ff][xf] = res;
}

signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int a, b;
  cin >> a >> b;
  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++) for (int h = 0; h < 2; h++) dp[i][j][k][l][h] = -1;
  N = to_string(b);
  int res = f(0, 10, 10, 1, 1);
  if (a == 0) 
  {
    cout << res << '\n';
    return 0;
  }
  a--;
  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++) for (int h = 0; h < 2; h++) dp[i][j][k][l][h] = -1;
  N = to_string(a);
  res -= f(0, 10, 10, 1, 1);
  cout << res << '\n';
}

Compilation message (stderr)

numbers.cpp: In function 'long long int f(long long int, long long int, long long int, long long int, long long int)':
numbers.cpp:14:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   if (i == N.length()) return 1;
      |       ~~^~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 75 / 75