Submission #58979

#TimeUsernameProblemLanguageResultExecution timeMemory
58979BenqPalindrome-Free Numbers (BOI13_numbers)C++14
73.75 / 100
5 ms1240 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef complex<ld> cd; typedef pair<int, int> pi; typedef pair<ll,ll> pl; typedef pair<ld,ld> pd; typedef vector<int> vi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<cd> vcd; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define F0R(i, a) for (int i=0; i<(a); i++) #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--) #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define f first #define s second #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() const int MOD = 1000000007; const ll INF = 1e18; const int MX = 100001; ll solve(ll z) { if (z == -1) return 0; if (z == 0) return 1; ll ans = 0; string x = to_string(z); F0R(i,sz(x)) { if (i == 0) { if (sz(x) == 1) ans ++; int left = sz(x)-i-1; ll mul = 1; if (left) mul *= 9, left --; while (left) mul *= 8, left --; ans += mul*(x[i]-'1'); } else { F0R(j,x[i]-'0') { char c = char('0'+j); if (c == x[i-1] || (i > 1 && c == x[i-2])) continue; ll left = sz(x)-1-i; ll mul = 1; while (left) mul *= 8, left --; ans += mul; } if (x[i] == x[i-1] || (i > 1 && x[i] == x[i-2])) break; } if (i == sz(x)-1) ans ++; } FOR(i,1,sz(x)) { if (i == 1) ans += 10; else { ll lef = i-2, mul = 9*9; while (lef) mul *= 8, lef --; ans += lef; } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll a,b; cin >> a >> b; /*FOR(i,0,100) { cout << i << " " << solve(i)-solve(i-1) << "\n"; }*/ cout << solve(b)-solve(a-1); } /* Look for: * the exact constraints (multiple sets are too slow for n=10^6 :( ) * special cases (n=1?) * overflow (ll vs int?) * array bounds */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...