Submission #642472

#	Time	Username	Problem	Language	Result	Execution time	Memory
642472		shmad	Palindrome-Free Numbers (BOI13_numbers)	C++17	100 / 100	1 ms	512 KiB

numbers

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<ll> >;

const int N = 1e6 + 5, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

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

int get (vt<int> &v, int pos = 0, bool s = 0, int prv = 0, int prv1 = 10, int prv2 = 10) {  
	if (pos == 0) memset(dp, -1, sizeof(dp));
	if (pos == sz(v)) return 1;
	int &res = dp[pos][s][prv][prv1][prv2];
	if (res != -1) return res;
	res = 0;
	int nd = (s ? 9 : v[pos]);
	for (int i = 0; i <= nd; i++) {
		bool sm = s | (i < nd);
		if (prv != 0) {
			if (i == prv1 || i == prv2) continue;
			res += get(v, pos + 1, sm, prv, i, prv1);
		}
		else res += get(v, pos + 1, sm, (i != 0), (i ? i : 10), prv1);
	}
	return res;
}

vt<int> num (int x) {
	x = max(x, 0ll);
	vt<int> v;
	while (x) v.pb(x % 10), x /= 10;
	reverse(all(v));
	return v;
}

void solve () {
	int l, r;
	cin >> l >> r;
	vt<int> R = num(r), L = num(l - 1);
	int ans = get(R) - get(L) + (l == 0);
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;                   
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

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