제출 #43699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43699		szawinis	Palindrome-Free Numbers (BOI13_numbers)	C++14	100 / 100	6 ms	876 KiB

numbers

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

ll a, b, dp[20][11][11][11];
vector<ll> get_digits(ll k) {
	vector<ll> ret;
	ll len = log10(k) + 1;
	for(int i = 0; i < len; i++) {
		ret.push_back(k % 10);
		k /= 10;
	}
	reverse(ret.begin(), ret.end());
	return ret;
}
ll pf_leq(ll k) {
	if(k <= 9) return k+1;
	ll len = log10(k)+1;
	vector<ll> digits = get_digits(k);

	memset(dp, 0, sizeof(dp));
	for(int p0 = 0; p0 <= 9; p0++) dp[len-1][p0][10][10] = 1;
	for(int i = len-2; i >= 0; i--) {
		for(int p0 = 0; p0 <= 9; p0++) {
			for(int p1 = 0; p1 <= 9; p1++) if(p0 != p1) {
				if(i+2 < len) {
					for(int p2 = 0; p2 <= 9; p2++) if(p2 != p1 && p2 != p0) {
						if(i+3 < len) for(int p3 = 0; p3 <= 9; p3++) {
							dp[i][p0][p1][p2] += dp[i+1][p1][p2][p3];
						} else {
							dp[i][p0][p1][p2] += dp[i+1][p1][p2][10];
						}
						// cout << i << ' ' << p0 << ' ' << p1 << ' ' << p2 << ' ' << dp[i][p0][p1][p2] << endl;
					}
				} else {
					dp[i][p0][p1][10] += dp[i+1][p1][10][10];
				}
			}
		}
	}

	ll ret = 0;
	// cout << digits[0] << endl;
	for(int i = 0; i < len; i++) {
		if((i >= 2 && digits[i-1] == digits[i-2]) || (i >= 3 && digits[i-1] == digits[i-3])) break;
		for(int p0 = (i == 0); p0 <= (i == len-1 ? digits[i] : digits[i]-1); p0++) if((i == 0 || p0 != digits[i-1]) && (i <= 1 || p0 != digits[i-2])) {
			for(int p1 = 0; p1 <= 10; p1++) if(p1 != p0 && (i == 0 || p1 != digits[i-1])) {
				for(int p2 = 0; p2 <= 10; p2++) if((i == len-1 || p2 != p1) && p2 != p0) {
					ret += dp[i][p0][p1][p2];
					// cout << i << ' ' << p0 << ' ' << p1 << ' ' << p2 << ' ' << dp[i][p0][p1][p2] << endl;
				}
			}
		}
	}
	return ret;
}
int main() {
	cin >> a >> b;
	ll pa = log10(a-1), pb = log10(b);
	ll curra = 1, currb = 1;
	ll resa = 0, resb = 0;
	for(int i = 1; i <= pa; i++) {
		curra *= 10;
		resa += pf_leq(curra-1);
	}
	for(int i = 1; i <= pb; i++) {
		currb *= 10;
		resb += pf_leq(currb-1);
	}
	resa += pf_leq(a-1);
	resb += pf_leq(b);
	cout << resb - resa;
}

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