結果
問題 | No.1407 Kindness |
ユーザー |
![]() |
提出日時 | 2021-03-13 20:41:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 6,025 bytes |
コンパイル時間 | 1,610 ms |
コンパイル使用メモリ | 172,732 KB |
実行使用メモリ | 8,704 KB |
最終ジャッジ日時 | 2024-10-15 10:50:49 |
合計ジャッジ時間 | 3,114 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#pragma region Macros#include <bits/stdc++.h>#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)#define ALL(v) (v).begin(), (v).end()#define LLA(v) (v).rbegin(), (v).rend()#define SZ(v) (int)(v).size()#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define DOUBLE(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define STRING(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)using namespace std;using ll = long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using Graph = vector<vector<int>>;template <typename T> struct edge {int from, to;T cost;edge(int f, int t, T c) : from(f), to(t), cost(c) {}};template <typename T> using WGraph = vector<vector<edge<T>>>;const int INF = 1 << 30;const ll LINF = 1LL << 60;const int MOD = 1e9 + 7;const char newl = '\n';template <class T> inline vector<T> make_vec(size_t a, T val) {return vector<T>(a, val);}template <class... Ts> inline auto make_vec(size_t a, Ts... ts) {return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));}void read() {}template <class T> inline void read(T &a) { cin >> a; }template <class T, class S> inline void read(pair<T, S> &p) {read(p.first), read(p.second);}template <class T> inline void read(vector<T> &v) {for(auto &a : v)read(a);}template <class Head, class... Tail>inline void read(Head &head, Tail &...tail) {read(head), read(tail...);}template <class T> void write(const T &a) { cout << a << '\n'; }template <class T> void write(const vector<T> &a) {for(int i = 0; i < a.size(); i++)cout << a[i] << (i + 1 == a.size() ? '\n' : ' ');}template <class Head, class... Tail>void write(const Head &head, const Tail &...tail) {cout << head << ' ';write(tail...);}template <class T> void writel(const T &a) { cout << a << '\n'; }template <class T> void writel(const vector<T> &a) {for(int i = 0; i < a.size(); i++)cout << a[i] << '\n';}template <class Head, class... Tail>void writel(const Head &head, const Tail &...tail) {cout << head << '\n';write(tail...);}template <class T> auto sum(const T &a) { return accumulate(ALL(a), T(0)); }template <class T> auto min(const T &a) { return *min_element(ALL(a)); }template <class T> auto max(const T &a) { return *max_element(ALL(a)); }template <class T> inline void chmax(T &a, T b) { (a < b ? a = b : a); }template <class T> inline void chmin(T &a, T b) { (a > b ? a = b : a); }struct IO {IO() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(10);}} io;#pragma endregiontemplate <uint_fast64_t MOD> class ModInt {using u64 = uint_fast64_t;public:u64 val;ModInt(const u64 x = 0) : val((x + MOD) % MOD) {}constexpr u64 &value() { return val; }constexpr ModInt operator-() { return val ? MOD - val : 0; }constexpr ModInt operator+(const ModInt &rhs) const {return ModInt(*this) += rhs;}constexpr ModInt operator-(const ModInt &rhs) const {return ModInt(*this) -= rhs;}constexpr ModInt operator*(const ModInt &rhs) const {return ModInt(*this) *= rhs;}constexpr ModInt operator/(const ModInt &rhs) const {return ModInt(*this) /= rhs;}constexpr ModInt &operator+=(const ModInt &rhs) {val += rhs.val;if(val >= MOD) {val -= MOD;}return *this;}constexpr ModInt &operator-=(const ModInt &rhs) {if(val < rhs.val) {val += MOD;}val -= rhs.val;return *this;}constexpr ModInt &operator*=(const ModInt &rhs) {val = val * rhs.val % MOD;return *this;}constexpr ModInt &operator/=(const ModInt &rhs) {*this *= rhs.inv();return *this;}constexpr bool operator==(const ModInt &rhs) {return this->val == rhs.val;}constexpr bool operator!=(const ModInt &rhs) {return this->val != rhs.val;}friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {return os << x.val;}friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {return is >> x.val;}constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); }constexpr ModInt pow(ll e) const {u64 x = 1, p = val;while(e > 0) {if(e % 2 == 0) {p = (p * p) % MOD;e /= 2;} else {x = (x * p) % MOD;e--;}}return ModInt(x);}};using mint = ModInt<MOD>;int main() {STRING(s);int n = s.size();auto dp = make_vec(n + 1, 2, mint(0));dp[0][0] = 1;FOR(i,1,n)dp[i][1] = 1;rep(i, n) {int now = s[i] - '0';int d = now * (now - 1) / 2;dp[i + 1][0] += dp[i][0] * now;dp[i + 1][1] += dp[i][0] * d;dp[i + 1][1] += dp[i][1] * 45;}write(dp[n][0] + dp[n][1]);}