結果
問題 | No.493 とても長い数列と文字列(Long Long Sequence and a String) |
ユーザー | nebukuro09 |
提出日時 | 2018-05-21 13:32:45 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 2 ms / 800 ms |
コード長 | 1,862 bytes |
コンパイル時間 | 857 ms |
コンパイル使用メモリ | 123,332 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-13 01:03:53 |
合計ジャッジ時間 | 3,350 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,944 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,944 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,944 KB |
testcase_28 | AC | 1 ms
6,940 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 1 ms
6,940 KB |
testcase_31 | AC | 1 ms
6,944 KB |
testcase_32 | AC | 1 ms
6,944 KB |
testcase_33 | AC | 1 ms
6,940 KB |
testcase_34 | AC | 1 ms
6,940 KB |
testcase_35 | AC | 1 ms
6,940 KB |
testcase_36 | AC | 1 ms
6,940 KB |
testcase_37 | AC | 1 ms
6,940 KB |
testcase_38 | AC | 1 ms
6,940 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 1 ms
6,940 KB |
testcase_41 | AC | 1 ms
6,940 KB |
testcase_42 | AC | 1 ms
6,940 KB |
testcase_43 | AC | 1 ms
6,940 KB |
testcase_44 | AC | 1 ms
6,944 KB |
testcase_45 | AC | 1 ms
6,944 KB |
testcase_46 | AC | 1 ms
6,940 KB |
testcase_47 | AC | 1 ms
6,944 KB |
testcase_48 | AC | 1 ms
6,944 KB |
testcase_49 | AC | 1 ms
6,940 KB |
testcase_50 | AC | 1 ms
6,944 KB |
testcase_51 | AC | 1 ms
6,944 KB |
testcase_52 | AC | 1 ms
6,944 KB |
testcase_53 | AC | 1 ms
6,940 KB |
testcase_54 | AC | 1 ms
6,940 KB |
testcase_55 | AC | 1 ms
6,944 KB |
testcase_56 | AC | 1 ms
6,944 KB |
testcase_57 | AC | 1 ms
6,940 KB |
testcase_58 | AC | 1 ms
6,940 KB |
testcase_59 | AC | 1 ms
6,944 KB |
testcase_60 | AC | 1 ms
6,944 KB |
testcase_61 | AC | 1 ms
6,940 KB |
testcase_62 | AC | 1 ms
6,944 KB |
testcase_63 | AC | 1 ms
6,944 KB |
testcase_64 | AC | 1 ms
6,940 KB |
testcase_65 | AC | 1 ms
6,940 KB |
testcase_66 | AC | 1 ms
6,940 KB |
testcase_67 | AC | 1 ms
6,940 KB |
testcase_68 | AC | 1 ms
6,940 KB |
testcase_69 | AC | 1 ms
6,940 KB |
testcase_70 | AC | 1 ms
6,940 KB |
testcase_71 | AC | 1 ms
6,940 KB |
testcase_72 | AC | 1 ms
6,944 KB |
testcase_73 | AC | 1 ms
6,940 KB |
testcase_74 | AC | 1 ms
6,940 KB |
testcase_75 | AC | 1 ms
6,944 KB |
testcase_76 | AC | 1 ms
6,940 KB |
testcase_77 | AC | 1 ms
6,940 KB |
testcase_78 | AC | 2 ms
6,944 KB |
testcase_79 | AC | 1 ms
6,944 KB |
testcase_80 | AC | 1 ms
6,944 KB |
testcase_81 | AC | 1 ms
6,940 KB |
testcase_82 | AC | 1 ms
6,940 KB |
testcase_83 | AC | 1 ms
6,940 KB |
testcase_84 | AC | 1 ms
6,944 KB |
testcase_85 | AC | 1 ms
6,940 KB |
testcase_86 | AC | 1 ms
6,944 KB |
testcase_87 | AC | 1 ms
6,944 KB |
testcase_88 | AC | 1 ms
6,940 KB |
testcase_89 | AC | 1 ms
6,940 KB |
testcase_90 | AC | 1 ms
6,940 KB |
testcase_91 | AC | 1 ms
6,940 KB |
testcase_92 | AC | 1 ms
6,940 KB |
testcase_93 | AC | 1 ms
6,944 KB |
testcase_94 | AC | 1 ms
6,940 KB |
testcase_95 | AC | 1 ms
6,940 KB |
testcase_96 | AC | 1 ms
6,940 KB |
testcase_97 | AC | 1 ms
6,940 KB |
testcase_98 | AC | 1 ms
6,944 KB |
testcase_99 | AC | 1 ms
6,940 KB |
testcase_100 | AC | 1 ms
6,940 KB |
testcase_101 | AC | 1 ms
6,944 KB |
testcase_102 | AC | 1 ms
6,944 KB |
testcase_103 | AC | 1 ms
6,940 KB |
testcase_104 | AC | 1 ms
6,940 KB |
testcase_105 | AC | 1 ms
6,944 KB |
testcase_106 | AC | 1 ms
6,940 KB |
testcase_107 | AC | 1 ms
6,940 KB |
testcase_108 | AC | 1 ms
6,944 KB |
testcase_109 | AC | 2 ms
6,944 KB |
testcase_110 | AC | 1 ms
6,940 KB |
testcase_111 | AC | 1 ms
6,940 KB |
testcase_112 | AC | 1 ms
6,948 KB |
testcase_113 | AC | 1 ms
6,940 KB |
testcase_114 | AC | 1 ms
6,944 KB |
testcase_115 | AC | 1 ms
6,944 KB |
testcase_116 | AC | 1 ms
6,944 KB |
testcase_117 | AC | 1 ms
6,940 KB |
testcase_118 | AC | 1 ms
6,940 KB |
ソースコード
import std.stdio, std.array, std.string, std.conv, std.algorithm; import std.typecons, std.range, std.random, std.math, std.container; import std.numeric, std.bigint, core.bitop, std.bitmanip; void main() { immutable long MOD = 10^^9 + 7; immutable int MAX = 63; auto s = readln.split.map!(to!long); auto K = s[0]; auto L = s[1]; auto R = s[2]; auto len = new long[](MAX); auto sm = new long[](MAX); auto pr = new long[](MAX); auto sq = new long[][](MAX); pr[0] = 1; foreach (i; 1..MAX) { len[i] = len[i-1] * 2 + (i*i).to!string.length.to!long; sq[i] = (i*i).to!string.map!(c => c == '0' ? 10L : (c - '0').to!long).array; sm[i] = sm[i-1] * 2 + sq[i].sum; pr[i] = 1; foreach (a; sq[i]) pr[i] = pr[i] * a % MOD; pr[i] = pr[i] * pr[i-1] % MOD * pr[i-1] % MOD; } if (K < MAX && len[K.to!int] < R) { writeln(-1); return; } Tuple!(long, long) dfs(int n, long k) { if (n == 0 || k == 0) return tuple(0L, 1L); if (len[n-1] >= k) return dfs(n-1, k); if (len[n] < k) return tuple(sm[n], pr[n]); k -= len[n-1]; long s = sm[n-1]; long p = pr[n-1]; foreach (d; sq[n]) { s = s + d; p = p * d % MOD; k -= 1; if (k == 0) break; } auto tmp = dfs(n-1, k); s = s + tmp[0]; p = p * tmp[1] % MOD; return tuple(s, p); } auto ans_r = dfs(MAX-1, R); auto ans_l = dfs(MAX-1, L-1); auto ans_s = ans_r[0] - ans_l[0]; auto ans_p = ans_r[1] * powmod(ans_l[1], MOD-2, MOD) % MOD; writeln(ans_s, " ", ans_p); } long powmod(long a, long x, long m) { long ret = 1; while (x) { if (x % 2) ret = ret * a % m; a = a * a % m; x /= 2; } return ret; }