#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);
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();
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
Output is correct |
| 2 |
Correct |
1 ms |
456 KB |
Output is correct |
| 3 |
Correct |
1 ms |
468 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
468 KB |
Output is correct |
| 8 |
Correct |
1 ms |
468 KB |
Output is correct |
| 9 |
Correct |
1 ms |
468 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
1 ms |
468 KB |
Output is correct |
| 12 |
Correct |
1 ms |
468 KB |
Output is correct |
| 13 |
Correct |
1 ms |
468 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| 16 |
Correct |
1 ms |
468 KB |
Output is correct |
| 17 |
Correct |
1 ms |
468 KB |
Output is correct |
| 18 |
Incorrect |
0 ms |
468 KB |
Output isn't correct |
| 19 |
Correct |
1 ms |
468 KB |
Output is correct |
| 20 |
Correct |
1 ms |
468 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
456 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
2 ms |
456 KB |
Output is correct |
| 4 |
Correct |
1 ms |
464 KB |
Output is correct |
| 5 |
Correct |
1 ms |
468 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
468 KB |
Output is correct |
| 8 |
Correct |
1 ms |
468 KB |
Output is correct |
| 9 |
Correct |
1 ms |
468 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
1 ms |
468 KB |
Output is correct |
| 12 |
Correct |
1 ms |
460 KB |
Output is correct |
| 13 |
Correct |
1 ms |
468 KB |
Output is correct |
| 14 |
Correct |
1 ms |
468 KB |
Output is correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| 16 |
Correct |
1 ms |
468 KB |
Output is correct |
| 17 |
Correct |
1 ms |
468 KB |
Output is correct |
| 18 |
Correct |
1 ms |
468 KB |
Output is correct |
| 19 |
Correct |
1 ms |
452 KB |
Output is correct |
| 20 |
Correct |
1 ms |
468 KB |
Output is correct |
| 21 |
Correct |
1 ms |
456 KB |
Output is correct |
| 22 |
Correct |
1 ms |
468 KB |
Output is correct |
| 23 |
Correct |
1 ms |
468 KB |
Output is correct |
| 24 |
Correct |
1 ms |
468 KB |
Output is correct |
| 25 |
Correct |
1 ms |
468 KB |
Output is correct |
| 26 |
Correct |
1 ms |
460 KB |
Output is correct |
| 27 |
Correct |
1 ms |
468 KB |
Output is correct |
| 28 |
Correct |
1 ms |
460 KB |
Output is correct |
| 29 |
Correct |
1 ms |
468 KB |
Output is correct |
| 30 |
Correct |
1 ms |
468 KB |
Output is correct |
| 31 |
Correct |
1 ms |
468 KB |
Output is correct |
| 32 |
Correct |
1 ms |
456 KB |
Output is correct |
| 33 |
Correct |
1 ms |
468 KB |
Output is correct |
| 34 |
Correct |
1 ms |
456 KB |
Output is correct |
| 35 |
Correct |
1 ms |
460 KB |
Output is correct |
| 36 |
Correct |
1 ms |
452 KB |
Output is correct |
| 37 |
Correct |
1 ms |
468 KB |
Output is correct |
| 38 |
Correct |
1 ms |
468 KB |
Output is correct |
| 39 |
Correct |
1 ms |
468 KB |
Output is correct |
| 40 |
Correct |
1 ms |
456 KB |
Output is correct |
| 41 |
Correct |
1 ms |
468 KB |
Output is correct |
| 42 |
Correct |
2 ms |
456 KB |
Output is correct |
| 43 |
Correct |
1 ms |
468 KB |
Output is correct |
| 44 |
Correct |
1 ms |
468 KB |
Output is correct |
| 45 |
Correct |
1 ms |
460 KB |
Output is correct |
