結果
問題 | No.2867 NOT FOUND 404 Again |
ユーザー | dyktr_06 |
提出日時 | 2024-08-30 22:01:50 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 135 ms / 3,000 ms |
コード長 | 9,510 bytes |
コンパイル時間 | 2,135 ms |
コンパイル使用メモリ | 207,308 KB |
実行使用メモリ | 66,960 KB |
最終ジャッジ日時 | 2024-08-30 22:01:56 |
合計ジャッジ時間 | 5,459 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
65,868 KB |
testcase_01 | AC | 18 ms
65,960 KB |
testcase_02 | AC | 18 ms
65,848 KB |
testcase_03 | AC | 135 ms
66,864 KB |
testcase_04 | AC | 131 ms
66,828 KB |
testcase_05 | AC | 130 ms
66,952 KB |
testcase_06 | AC | 130 ms
66,832 KB |
testcase_07 | AC | 128 ms
66,952 KB |
testcase_08 | AC | 134 ms
66,956 KB |
testcase_09 | AC | 133 ms
66,956 KB |
testcase_10 | AC | 132 ms
66,824 KB |
testcase_11 | AC | 132 ms
66,960 KB |
testcase_12 | AC | 133 ms
66,952 KB |
testcase_13 | AC | 134 ms
66,828 KB |
testcase_14 | AC | 134 ms
66,956 KB |
testcase_15 | AC | 132 ms
66,952 KB |
testcase_16 | AC | 128 ms
66,832 KB |
testcase_17 | AC | 132 ms
66,824 KB |
testcase_18 | AC | 118 ms
66,828 KB |
testcase_19 | AC | 129 ms
66,828 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }template <long long Modulus>struct ModInt{long long val;constexpr ModInt(const long long _val = 0) noexcept : val(_val) {normalize();}void normalize(){val = (val % Modulus + Modulus) % Modulus;}inline ModInt &operator+=(const ModInt &rhs) noexcept {if(val += rhs.val, val >= Modulus) val -= Modulus;return *this;}inline ModInt &operator-=(const ModInt &rhs) noexcept {if(val -= rhs.val, val < 0) val += Modulus;return *this;}inline ModInt &operator*=(const ModInt &rhs) noexcept {val = val * rhs.val % Modulus;return *this;}inline ModInt &operator/=(const ModInt &rhs) noexcept {val = val * inv(rhs.val).val % Modulus;return *this;}inline ModInt &operator++() noexcept {if(++val >= Modulus) val -= Modulus;return *this;}inline ModInt operator++(int) noexcept {ModInt t = val;if(++val >= Modulus) val -= Modulus;return t;}inline ModInt &operator--() noexcept {if(--val < 0) val += Modulus;return *this;}inline ModInt operator--(int) noexcept {ModInt t = val;if(--val < 0) val += Modulus;return t;}inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }inline ModInt inv(void) const { return inv(val); }ModInt pow(long long n){assert(0 <= n);ModInt x = *this, r = 1;while(n){if(n & 1) r *= x;x *= x;n >>= 1;}return r;}ModInt inv(const long long n) const {long long a = n, b = Modulus, u = 1, v = 0;while(b){long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= Modulus;if(u < 0) u += Modulus;return u;}friend inline ModInt operator+(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) += rhs; }friend inline ModInt operator-(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) -= rhs; }friend inline ModInt operator*(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) *= rhs; }friend inline ModInt operator/(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) /= rhs; }friend inline bool operator==(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val == rhs.val; }friend inline bool operator!=(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val != rhs.val; }friend inline istream &operator>>(istream &is, ModInt &x) noexcept {is >> x.val;x.normalize();return is;}friend inline ostream &operator<<(ostream &os, const ModInt &x) noexcept { return os << x.val; }};using mint = ModInt<MOD>;mint dp[1000001][4][2];void input(){}void solve(){string n; in(n);ll len = n.size();mint ans = 0;rep(i, len){ans *= 10;ans += n[i] - '0';}dp[0][0][1] = 1;vll l = {4, 0, 4, -1};rep(i, len){ll num = n[i] - '0';rep(j, 10){rep(k, 4){if(k == 3){if(j < num){dp[i + 1][k][0] += dp[i][k][0];dp[i + 1][k][0] += dp[i][k][1];}else if(j == num){dp[i + 1][k][0] += dp[i][k][0];dp[i + 1][k][1] += dp[i][k][1];}else{dp[i + 1][k][0] += dp[i][k][0];}}else{if(j == l[k]){if(j < num){dp[i + 1][k + 1][0] += dp[i][k][0];dp[i + 1][k + 1][0] += dp[i][k][1];}else if(j == num){dp[i + 1][k + 1][0] += dp[i][k][0];dp[i + 1][k + 1][1] += dp[i][k][1];}else{dp[i + 1][k + 1][0] += dp[i][k][0];}}else{if(j == l[0]){if(j < num){dp[i + 1][1][0] += dp[i][k][0];dp[i + 1][1][0] += dp[i][k][1];}else if(j == num){dp[i + 1][1][0] += dp[i][k][0];dp[i + 1][1][1] += dp[i][k][1];}else{dp[i + 1][1][0] += dp[i][k][0];}}else{if(j < num){dp[i + 1][0][0] += dp[i][k][0];dp[i + 1][0][0] += dp[i][k][1];}else if(j == num){dp[i + 1][0][0] += dp[i][k][0];dp[i + 1][0][1] += dp[i][k][1];}else{dp[i + 1][0][0] += dp[i][k][0];}}}}}}}ans -= dp[len][3][0] + dp[len][3][1];out(ans);}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}