結果
問題 | No.741 AscNumber(Easy) |
ユーザー | eQe |
提出日時 | 2022-03-12 02:49:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 720 ms / 2,000 ms |
コード長 | 4,178 bytes |
コンパイル時間 | 4,071 ms |
コンパイル使用メモリ | 278,412 KB |
実行使用メモリ | 402,720 KB |
最終ジャッジ日時 | 2023-10-14 13:05:28 |
合計ジャッジ時間 | 15,894 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,368 KB |
testcase_01 | AC | 2 ms
4,352 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,352 KB |
testcase_05 | AC | 1 ms
4,352 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,352 KB |
testcase_08 | AC | 1 ms
4,352 KB |
testcase_09 | AC | 1 ms
4,352 KB |
testcase_10 | AC | 1 ms
4,348 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 2 ms
4,368 KB |
testcase_13 | AC | 1 ms
4,368 KB |
testcase_14 | AC | 1 ms
4,352 KB |
testcase_15 | AC | 1 ms
4,348 KB |
testcase_16 | AC | 2 ms
4,352 KB |
testcase_17 | AC | 1 ms
4,352 KB |
testcase_18 | AC | 2 ms
4,352 KB |
testcase_19 | AC | 1 ms
4,352 KB |
testcase_20 | AC | 2 ms
4,356 KB |
testcase_21 | AC | 1 ms
4,356 KB |
testcase_22 | AC | 2 ms
4,348 KB |
testcase_23 | AC | 2 ms
4,352 KB |
testcase_24 | AC | 1 ms
4,356 KB |
testcase_25 | AC | 1 ms
4,348 KB |
testcase_26 | AC | 2 ms
4,352 KB |
testcase_27 | AC | 2 ms
4,348 KB |
testcase_28 | AC | 2 ms
4,356 KB |
testcase_29 | AC | 2 ms
4,352 KB |
testcase_30 | AC | 2 ms
4,352 KB |
testcase_31 | AC | 1 ms
4,352 KB |
testcase_32 | AC | 2 ms
4,352 KB |
testcase_33 | AC | 2 ms
4,352 KB |
testcase_34 | AC | 2 ms
4,352 KB |
testcase_35 | AC | 672 ms
383,900 KB |
testcase_36 | AC | 305 ms
168,976 KB |
testcase_37 | AC | 372 ms
198,468 KB |
testcase_38 | AC | 363 ms
195,700 KB |
testcase_39 | AC | 288 ms
165,712 KB |
testcase_40 | AC | 394 ms
224,128 KB |
testcase_41 | AC | 617 ms
350,368 KB |
testcase_42 | AC | 330 ms
186,900 KB |
testcase_43 | AC | 240 ms
135,904 KB |
testcase_44 | AC | 478 ms
275,076 KB |
testcase_45 | AC | 527 ms
296,244 KB |
testcase_46 | AC | 655 ms
365,108 KB |
testcase_47 | AC | 114 ms
64,364 KB |
testcase_48 | AC | 637 ms
365,184 KB |
testcase_49 | AC | 540 ms
305,752 KB |
testcase_50 | AC | 75 ms
44,220 KB |
testcase_51 | AC | 253 ms
142,756 KB |
testcase_52 | AC | 720 ms
402,720 KB |
testcase_53 | AC | 699 ms
402,504 KB |
testcase_54 | AC | 691 ms
398,456 KB |
ソースコード
#include <atcoder/all> using namespace atcoder; #include <bits/stdc++.h> #define all(a) (a.begin()),(a.end()) #define rall(a) (a.rbegin()),(a.rend()) #define bitcnt(S) __builtin_popcountll(S) #define fin(a) {pt(a);return 0;} using namespace std; using ll=long long; using ld=long double; using pll=pair<ll,ll>; template<class T>using ascending_priority_queue = priority_queue<T, vector<T>, greater<T>>; template<class T>using descending_priority_queue = priority_queue<T>; template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;} template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;} istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; } istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; } istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; } ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; } ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; } ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; } template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; } template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;} template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; } template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<(int)v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;} template<class... A> void pt() { std::cout << "\n"; } template<class... A> void pt_rest() { std::cout << "\n"; } template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); } template<class T, class... A> void pt(const T& first, const A&... rest) { std::cout << first; pt_rest(rest...); } template<typename V, typename H> void resize(vector<V>& vec, const H head){ vec.resize(head); } template<typename V, typename H, typename ... T> void resize(vector<V>& vec, const H& head, const T ... tail){ vec.resize(head); for(auto& v: vec) resize(v, tail...); } template<typename V, typename T> void fill(V& x, const T& val){ x = val; } template<typename V, typename T> void fill(vector<V>& vec, const T& val){ for(auto& v: vec) fill(v, val); } template<typename H> void vin(istream& is, const int idx, vector<H>& head){ is >> head[idx]; } template<typename H, typename ... T> void vin(istream& is, const int idx, vector<H>& head, T& ... tail){ vin(is >> head[idx], idx, tail...); } template<typename H, typename ... T> void vin(istream& is, vector<H>& head, T& ... tail){ for(int i=0; i<(int)head.size(); i++) vin(is, i, head, tail...); } template<typename H, typename ... T> void vin(vector<H>& head, T& ... tail){ vin(cin, head, tail...); } map<ll,ll>divisor(ll n){map<ll,ll>res;for(ll i=1;i*i<=n;i++)if(n%i==0){res[i]++;res[n/i]++;}return res;} map<ll,ll>factrization(ll n){map<ll,ll>res;for(ll i=2;i*i<=n;i++)while(n%i==0){res[i]++;n/=i;}if(n>1)res[n]++;return res;} ll inf=1e18+7; ld pi=acos(-1); ld eps=1e-10; using v1=vector<ll>; using v2=vector<v1>; using v3=vector<v2>; using v4=vector<v3>; using S=ll; S op(S a,S b){return max(a,b);} S e(){return 0;} int main(void){ cin.tie(nullptr); ios::sync_with_stdio(false); ll N;cin>>N; string s='1'+string(N,'0'); N++; using mint=modint1000000007; vector<vector<vector<vector<mint>>>>dp;resize(dp,N+1,2,2,10); dp[0][1][1][0]=1; for(ll i=0;i<N;i++){ for(ll e=0;e<2;e++){ for(ll l=0;l<2;l++){ for(ll d=0;d<10;d++){ if(dp[i][e][l][d]==0)continue; ll cur=s[i]-'0'; ll lim=(e?cur:9); for(ll x=d;x<=lim;x++){ ll ne=(x<lim?0:e); ll nl=(x?0:l); dp[i+1][ne][nl][x]+=dp[i][e][l][d]; } } } } } mint ans=0; for(ll l=0;l<2;l++)for(ll d=0;d<10;d++)ans+=dp[N][0][l][d]; pt(ans); }