제출 #679597

#제출 시각아이디문제언어결과실행 시간메모리
679597peijarPalindrome-Free Numbers (BOI13_numbers)C++17
100 / 100
1 ms340 KiB
#include <bits/stdc++.h> #define int long long using namespace std; namespace std { template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) { out << "["; for (int i = 0; i < (int)vec.size(); ++i) { out << vec[i]; if (i + 1 < (int)vec.size()) out << ", "; } return out << "]"; } } // namespace std void dbg_out() { cout << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); } #ifdef DEBUG #define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__) #else #define dbg(...) #endif const int MAXLEN = 20; const int MAXK = 11; int ways[MAXLEN][MAXK][MAXK][2]; // dp[digRestant][prv][prv2][flag] int cntSmaller(string s) { reverse(s.begin(), s.end()); for (int bitRestant = 0; bitRestant <= (int)s.size(); ++bitRestant) for (int prv = 0; prv < MAXK; ++prv) for (int prv2 = 0; prv2 < MAXK; ++prv2) for (int flag = 0; flag < 2; ++flag) { int &cur = ways[bitRestant][prv][prv2][flag]; cur = 0; if (bitRestant == 0) { cur = 1; continue; } for (int nxtDig = prv == 10; nxtDig < 10; ++nxtDig) if (nxtDig != prv and nxtDig != prv2) { if (!flag and nxtDig > s[bitRestant - 1] - '0') continue; cur += ways[bitRestant - 1][nxtDig][prv] [flag or (nxtDig < s[bitRestant - 1] - '0')]; } } int ret = 0; for (int len = 0; len <= (int)s.size(); ++len) ret += ways[len][10][10][len < (int)s.size()]; dbg(s, ret); return ret; } signed main(void) { ios_base::sync_with_stdio(false); cin.tie(0); int a, b; cin >> a >> b; int ret = cntSmaller(to_string(b)); dbg(ret); if (a) ret -= cntSmaller(to_string(a - 1)); cout << ret << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...