結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー |
![]() |
提出日時 | 2017-06-09 22:38:38 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 81 ms / 1,000 ms |
コード長 | 3,180 bytes |
コンパイル時間 | 1,963 ms |
コンパイル使用メモリ | 174,112 KB |
実行使用メモリ | 8,680 KB |
最終ジャッジ日時 | 2024-07-23 18:28:13 |
合計ジャッジ時間 | 3,761 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }struct GModInt {static int Mod;unsigned x;GModInt() : x(0) { }GModInt(signed sig) { int sigt = sig % Mod; if (sigt < 0) sigt += Mod; x = sigt; }GModInt(signed long long sig) { int sigt = sig % Mod; if (sigt < 0) sigt += Mod; x = sigt; }int get() const { return (int)x; }GModInt &operator+=(GModInt that) { if ((x += that.x) >= (unsigned)Mod) x -= Mod; return *this; }GModInt &operator-=(GModInt that) { if ((x += Mod - that.x) >= (unsigned)Mod) x -= Mod; return *this; }GModInt &operator*=(GModInt that) { x = (unsigned long long)x * that.x % Mod; return *this; }GModInt &operator/=(GModInt that) { return *this *= that.inverse(); }GModInt operator+(GModInt that) const { return GModInt(*this) += that; }GModInt operator-(GModInt that) const { return GModInt(*this) -= that; }GModInt operator*(GModInt that) const { return GModInt(*this) *= that; }GModInt operator/(GModInt that) const { return GModInt(*this) /= that; }//Modと素であることが保証されるかどうか確認すること!GModInt inverse() const {signed a = x, b = Mod, u = 1, v = 0;while (b) {signed t = a / b;a -= t * b; std::swap(a, b);u -= t * v; std::swap(u, v);}if (u < 0) u += Mod;GModInt res; res.x = (unsigned)u;return res;}bool operator==(GModInt that) const { return x == that.x; }bool operator!=(GModInt that) const { return x != that.x; }GModInt operator-() const { GModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }};int GModInt::Mod = 0;typedef GModInt mint;mint operator^(mint a, unsigned long long k) {mint r = 1;while (k) {if (k & 1) r *= a;a *= a;k >>= 1;}return r;}mint solve(const string &S) {int len = (int)S.size();mint res;rer(i, 1, len - 1)res += (mint(10) ^ ((i - 1) / 2)) * 9;mint undef; undef.x = -1;vector<mint> memo((len + 1) * 4, undef);auto rec = [&](auto rec, int i, bool ltL, bool leR) -> mint {mint &r = memo[(i + 1) * 4 + ltL * 2 + leR];if (r.x != ~0U) return r;int j = len - 1 - i;if (i < j)return r = ltL || leR ? 1 : 0;r = mint();int dL = S[j] - '0', dR = S[i] - '0';rep(d, 10) {if (i == len - 1 && d == 0) continue;if (!ltL && dL < d) continue;r += rec(rec, i - 1, ltL || d < dL,dR < d ? false : d < dR ? true : leR);}return r;};res += rec(rec, len - 1, false, true);return res;}int main() {char S[100002];while (~scanf("%s", S)) {mint::Mod = (int)1e9;int ans1 = solve(S).get();mint::Mod = (int)1e9 + 7;int ans2 = solve(S).get();printf("%d\n", ans1);printf("%d\n", ans2);}return 0;}