Submission #1160625

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160625		Nonoze	Palindrome-Free Numbers (BOI13_numbers)	C++20	72.50 / 100	1 ms	584 KiB

numbers

/*
*	Author: Nonoze
*	Created: Sunday 02/03/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef IN_LOCAL
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}



vector<vector<vector<vector<int>>>> memo;
string s;
int n;

int dp(int pos, int lst, int lst2, bool limit) {
	if (pos==n) return 1;
	if (memo[pos][lst][lst2][limit]!=-1) return memo[pos][lst][lst2][limit];
	int res=0;
	for (int i=0; i<10; i++) if (i!=lst && i!=lst2) {
		if (limit && i>s[pos]-'0') break;
		res+=dp(pos+1, i, lst, limit && i==s[pos]-'0');
	}
	return memo[pos][lst][lst2][limit]=res;
}


int calc(int x) {
	if (x<0) return 0;
	memo.clear(), memo.resize(20, vector<vector<vector<int>>>(11, vector<vector<int>>(11, vector<int>(2, -1))));
	s=to_string(x); n=sz(s);
	return dp(0, 10, 10, 1);
}

void solve() {
	int l, r; read(l, r);
	cout << calc(r)-calc(l-1) << endl;
}

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