結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー | eitaho |
提出日時 | 2017-06-09 23:38:11 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 139 ms / 1,000 ms |
コード長 | 3,769 bytes |
コンパイル時間 | 5,187 ms |
コンパイル使用メモリ | 116,492 KB |
実行使用メモリ | 31,776 KB |
最終ジャッジ日時 | 2024-07-23 18:29:30 |
合計ジャッジ時間 | 5,287 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
25,132 KB |
testcase_01 | AC | 35 ms
27,296 KB |
testcase_02 | AC | 34 ms
25,260 KB |
testcase_03 | AC | 34 ms
25,384 KB |
testcase_04 | AC | 34 ms
27,296 KB |
testcase_05 | AC | 34 ms
27,044 KB |
testcase_06 | AC | 35 ms
25,260 KB |
testcase_07 | AC | 34 ms
25,380 KB |
testcase_08 | AC | 35 ms
27,416 KB |
testcase_09 | AC | 35 ms
25,392 KB |
testcase_10 | AC | 138 ms
29,736 KB |
testcase_11 | AC | 138 ms
29,868 KB |
testcase_12 | AC | 139 ms
31,776 KB |
testcase_13 | AC | 138 ms
29,488 KB |
testcase_14 | AC | 94 ms
29,476 KB |
testcase_15 | AC | 86 ms
27,052 KB |
testcase_16 | AC | 83 ms
27,188 KB |
testcase_17 | AC | 76 ms
26,540 KB |
testcase_18 | AC | 134 ms
29,484 KB |
testcase_19 | AC | 62 ms
26,124 KB |
testcase_20 | AC | 106 ms
28,460 KB |
testcase_21 | AC | 75 ms
26,668 KB |
testcase_22 | AC | 35 ms
27,308 KB |
testcase_23 | AC | 35 ms
27,052 KB |
testcase_24 | AC | 36 ms
27,088 KB |
testcase_25 | AC | 46 ms
26,028 KB |
testcase_26 | AC | 137 ms
29,608 KB |
testcase_27 | AC | 93 ms
29,872 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using Enu = System.Linq.Enumerable; public class Program { static readonly int Mod1 = (int)1e9; static readonly int Mod2 = (int)1e9 + 7; static void Add(ref int a, int b, int mod) { if ((a += b) >= mod) a -= mod; } public void Solve() { var A = Reader.String().Select(c => c - '0').ToArray(); Console.WriteLine(DP(A, Mod1) + "\n" + DP(A, Mod2)); } long DP(int[] A, int mod) { int len = (A.Length + 1) / 2; var dp = new int[len + 1, 2, 2, 2]; for (int remLen = A.Length; remLen >= 1; remLen--) { int b = remLen == A.Length ? 0 : 1; dp[len - (remLen + 1) / 2, 0, b, b]++; } for (int i = 0, val; i < len; i++) for (int used = 0; used < 2; used++) for (int less = 0; less < 2; less++) for (int Rless = 0; Rless < 2; Rless++) if ((val = dp[i, used, less, Rless]) > 0) for (int d = 0; d <= 9; d++) { if (less == 0 && d > A[i]) continue; if (used == 0 && d == 0) continue; int nextless = less | (d < A[i] ? 1 : 0); int nextRless = (d < A[A.Length - 1 - i] ? 1 : 0); nextRless |= (Rless == 1 && d == A[A.Length - 1 - i]) ? 1 : 0; Add(ref dp[i + 1, 1, nextless, nextRless], val, mod); } int ans = A.SequenceEqual(A.Reverse()) ? 1 : 0; for (int L = 0; L < 2; L++) for (int R = 0; R < 2; R++) if (L + R > 0) Add(ref ans, dp[len, 1, L, R], mod); return ans; } } class Entry { static void Main() { new Program().Solve(); } } class Reader { static TextReader reader = Console.In; static readonly char[] separator = { ' ' }; static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; static string[] A = new string[0]; static int i; static void Init() { Dispose(); A = new string[0]; } public static void Set(TextReader r) { Init(); reader = r; } public static void Set(string file) { Init(); reader = new StreamReader(file); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Range(N, Int); } public static int[][] IntTable(int H) { return Range(H, IntLine); } public static string[] StringArray(int N) { return Range(N, Next); } public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); } public static string Line() { return reader.ReadLine().Trim(); } public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } public static void Dispose() { reader.Dispose(); } static string[] Split(string s) { return s.Split(separator, op); } static string Next() { CheckNext(); return A[i++]; } static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }