#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
const int INF = 1'000'000'007;
string lo, hi;
int memo[20][11][11][2][2];
int dp(int num, int prev, int befprev, bool l_bound, bool u_bound) {
if (num == sz(hi)) return 1;
int &ans = memo[num][prev][befprev][l_bound][u_bound];
if(ans!=-1)return ans;
ans = sz(lo) <= num;
if (sz(lo) <= num) l_bound = 0;
int start = l_bound ? lo[num] - '0' : 0, stop = u_bound ? hi[num] - '0' + 1 : 10;
rep(i, start, stop) {
if (i == prev || i == befprev) continue;
ans += dp(num + 1, i, prev, l_bound & (i == lo[num] - '0'), u_bound & (i == hi[num] - '0'));
}
return ans;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
memset(memo, -1, sizeof(memo));
cin >> lo >> hi;
cout<<dp(0,10,10,1,1)<<endl;
return 0;
}
Compilation message
numbers.cpp: In function 'int dp(int, int, int, bool, bool)':
numbers.cpp:29:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | if (num == sz(hi)) return 1;
| ^
numbers.cpp:34:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
34 | ans = sz(lo) <= num;
| ^
numbers.cpp:35:16: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
35 | if (sz(lo) <= num) l_bound = 0;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Correct |
1 ms |
356 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
356 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
460 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
332 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
356 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
352 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
356 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
332 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 26 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 27 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 28 |
Incorrect |
1 ms |
356 KB |
Output isn't correct |
| 29 |
Correct |
1 ms |
332 KB |
Output is correct |
| 30 |
Correct |
1 ms |
332 KB |
Output is correct |
| 31 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 32 |
Correct |
1 ms |
332 KB |
Output is correct |
| 33 |
Incorrect |
1 ms |
352 KB |
Output isn't correct |
| 34 |
Correct |
1 ms |
356 KB |
Output is correct |
| 35 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 36 |
Incorrect |
1 ms |
360 KB |
Output isn't correct |
| 37 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 38 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 39 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 40 |
Correct |
1 ms |
384 KB |
Output is correct |
| 41 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 42 |
Correct |
1 ms |
276 KB |
Output is correct |
| 43 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 44 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 45 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
