結果
問題 | No.493 とても長い数列と文字列(Long Long Sequence and a String) |
ユーザー | anta |
提出日時 | 2017-03-10 22:52:04 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 800 ms |
コード長 | 2,764 bytes |
コンパイル時間 | 1,487 ms |
コンパイル使用メモリ | 167,580 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-09-06 13:56:22 |
合計ジャッジ時間 | 4,742 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 2 ms
4,380 KB |
testcase_25 | AC | 1 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,376 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 1 ms
4,376 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 2 ms
4,376 KB |
testcase_35 | AC | 2 ms
4,376 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 1 ms
4,376 KB |
testcase_39 | AC | 2 ms
4,380 KB |
testcase_40 | AC | 2 ms
4,376 KB |
testcase_41 | AC | 1 ms
4,376 KB |
testcase_42 | AC | 1 ms
4,376 KB |
testcase_43 | AC | 1 ms
4,376 KB |
testcase_44 | AC | 1 ms
4,380 KB |
testcase_45 | AC | 1 ms
4,380 KB |
testcase_46 | AC | 2 ms
4,380 KB |
testcase_47 | AC | 1 ms
4,380 KB |
testcase_48 | AC | 2 ms
4,376 KB |
testcase_49 | AC | 1 ms
4,376 KB |
testcase_50 | AC | 2 ms
4,376 KB |
testcase_51 | AC | 1 ms
4,380 KB |
testcase_52 | AC | 2 ms
4,380 KB |
testcase_53 | AC | 1 ms
4,380 KB |
testcase_54 | AC | 1 ms
4,376 KB |
testcase_55 | AC | 2 ms
4,376 KB |
testcase_56 | AC | 1 ms
4,376 KB |
testcase_57 | AC | 1 ms
4,376 KB |
testcase_58 | AC | 1 ms
4,376 KB |
testcase_59 | AC | 2 ms
4,376 KB |
testcase_60 | AC | 2 ms
4,380 KB |
testcase_61 | AC | 1 ms
4,380 KB |
testcase_62 | AC | 1 ms
4,376 KB |
testcase_63 | AC | 1 ms
4,376 KB |
testcase_64 | AC | 1 ms
4,376 KB |
testcase_65 | AC | 1 ms
4,376 KB |
testcase_66 | AC | 2 ms
4,376 KB |
testcase_67 | AC | 1 ms
4,380 KB |
testcase_68 | AC | 2 ms
4,380 KB |
testcase_69 | AC | 1 ms
4,376 KB |
testcase_70 | AC | 1 ms
4,380 KB |
testcase_71 | AC | 1 ms
4,380 KB |
testcase_72 | AC | 2 ms
4,376 KB |
testcase_73 | AC | 1 ms
4,380 KB |
testcase_74 | AC | 1 ms
4,380 KB |
testcase_75 | AC | 2 ms
4,376 KB |
testcase_76 | AC | 2 ms
4,376 KB |
testcase_77 | AC | 1 ms
4,376 KB |
testcase_78 | AC | 1 ms
4,376 KB |
testcase_79 | AC | 1 ms
4,380 KB |
testcase_80 | AC | 1 ms
4,380 KB |
testcase_81 | AC | 1 ms
4,376 KB |
testcase_82 | AC | 1 ms
4,376 KB |
testcase_83 | AC | 1 ms
4,380 KB |
testcase_84 | AC | 1 ms
4,376 KB |
testcase_85 | AC | 2 ms
4,384 KB |
testcase_86 | AC | 1 ms
4,380 KB |
testcase_87 | AC | 1 ms
4,380 KB |
testcase_88 | AC | 1 ms
4,376 KB |
testcase_89 | AC | 1 ms
4,376 KB |
testcase_90 | AC | 1 ms
4,376 KB |
testcase_91 | AC | 2 ms
4,380 KB |
testcase_92 | AC | 1 ms
4,376 KB |
testcase_93 | AC | 2 ms
4,376 KB |
testcase_94 | AC | 1 ms
4,376 KB |
testcase_95 | AC | 1 ms
4,380 KB |
testcase_96 | AC | 2 ms
4,380 KB |
testcase_97 | AC | 2 ms
4,380 KB |
testcase_98 | AC | 1 ms
4,376 KB |
testcase_99 | AC | 2 ms
4,376 KB |
testcase_100 | AC | 1 ms
4,380 KB |
testcase_101 | AC | 1 ms
4,376 KB |
testcase_102 | AC | 2 ms
4,376 KB |
testcase_103 | AC | 2 ms
4,376 KB |
testcase_104 | AC | 2 ms
4,380 KB |
testcase_105 | AC | 1 ms
4,376 KB |
testcase_106 | AC | 1 ms
4,376 KB |
testcase_107 | AC | 2 ms
4,376 KB |
testcase_108 | AC | 2 ms
4,380 KB |
testcase_109 | AC | 2 ms
4,380 KB |
testcase_110 | AC | 2 ms
4,376 KB |
testcase_111 | AC | 2 ms
4,376 KB |
testcase_112 | AC | 1 ms
4,376 KB |
testcase_113 | AC | 1 ms
4,376 KB |
testcase_114 | AC | 1 ms
4,376 KB |
testcase_115 | AC | 1 ms
4,376 KB |
testcase_116 | AC | 1 ms
4,380 KB |
testcase_117 | AC | 1 ms
4,376 KB |
testcase_118 | AC | 2 ms
4,380 KB |
ソースコード
#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; } template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; } ModInt(signed long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } }; typedef ModInt<1000000007> mint; const mint inverse[11] = { 0,1,500000004,333333336,250000002,400000003,166666668,142857144,125000001,111111112,700000005 }; struct Sum { ll len; ll sum; mint prod; mint invProd; Sum() : len(0), sum(0), prod(1), invProd(1) { } explicit Sum(char digit) : len(1) { int d = digit == '0' ? 10 : digit - '0'; sum = d; prod = d; invProd = inverse[d]; } Sum &operator+=(const Sum &that) { len += that.len; sum += that.sum; prod *= that.prod; invProd *= that.invProd; return *this; } }; Sum dp[100]; Sum solve(ll R) { if (R == 0) return Sum(); int n = 1; for (; dp[n + 1].len <= R; ++ n); Sum res = dp[n]; R -= dp[n].len; string str = to_string((n + 1) * (n + 1)); for (int k = 0; k != str.size() && R > 0; -- R, ++ k) res += Sum(str[k]); if (R > 0) res += solve(R); return res; } int main() { for (int n = 1; dp[n - 1].len < (ll)1e18; ++ n) { dp[n] = dp[n - 1]; string str = to_string(n * n); for (char c : str) dp[n] += Sum(c); dp[n] += dp[n - 1]; } int K; long long L; long long R; while (~scanf("%d%lld%lld", &K, &L, &R)) { -- L; if (K < 60 && dp[K].len < R) { puts("-1"); continue; } Sum sumL = solve(L); Sum sumR = solve(R); ll totalSum = sumR.sum - sumL.sum; mint totalProd = sumR.prod * sumL.invProd; printf("%lld %d\n", totalSum, totalProd.get()); } return 0; }