#91893 (C#(csc)) No.372 It's automatic

提出ソース

結果

問題	No.372 It's automatic
ユーザー	りあん
提出日時	2016-05-14 00:54:54
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	6,075 bytes
コンパイル時間	814 ms
コンパイル使用メモリ	109,952 KB
実行使用メモリ	19,348 KB
最終ジャッジ日時	2024-10-05 20:43:37
合計ジャッジ時間	52,730 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	19 ms 17,536 KB
testcase_02	AC	19 ms 17,536 KB
testcase_03	AC	19 ms 17,792 KB
testcase_04	AC	5,489 ms 19,096 KB
testcase_05	AC	5,502 ms 19,096 KB
testcase_06	AC	5,532 ms 19,348 KB
testcase_07	AC	5,528 ms 19,348 KB
testcase_08	AC	5,521 ms 18,984 KB
testcase_09	AC	5,508 ms 19,224 KB
testcase_10	AC	5,631 ms 19,096 KB
testcase_11	AC	5,764 ms 18,964 KB
testcase_12	AC	5,539 ms 18,836 KB
testcase_13	AC	5,497 ms 19,220 KB
testcase_14	AC	5,561 ms 19,224 KB
testcase_15	AC	5,884 ms 18,968 KB
testcase_16	AC	20 ms 17,792 KB
testcase_17	AC	19 ms 17,792 KB
testcase_18	AC	19 ms 18,048 KB
testcase_19	AC	20 ms 17,408 KB
testcase_20	AC	18 ms 17,664 KB
testcase_21	AC	298 ms 17,664 KB
testcase_22	AC	293 ms 17,664 KB
testcase_23	AC	296 ms 17,920 KB
testcase_24	AC	288 ms 17,792 KB
testcase_25	AC	295 ms 17,536 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using Point = System.Tuple<double, double>;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        var s = sc.Str;
        int n = s.Length;
        int m = sc.Int;
        int zero = -1;
        var dp = new long[2][];
        dp[0] = new long[m];
        dp[1] = new long[m];
        dp[0][0] = 1;
        var nex = new int[m][];
        for (int i = 0; i < m; i++)
        {
            nex[i] = new int[10];
            for (int j = 0; j < 10; j++)
                nex[i][j] = (i * 10 + j) % m;
        }
        for (int i = 0, ii = 0; i < n; ++i, ii ^= 1)
        {
            for (int j = 0; j < m; j++)
            {
                dp[ii ^ 1][j] = (dp[ii ^ 1][j] + dp[ii][j]) % M;
                int k = nex[j][s[i] - '0'];
                dp[ii ^ 1][k] = (dp[ii ^ 1][k] + dp[ii][j]) % M;
                dp[ii][j] = 0;
            }
            if (s[i] == '0')
            {
                if (dp[ii ^ 1][0] > 0) --dp[ii ^ 1][0];
                else dp[ii ^ 1][0] = M - 1;

                ++zero;
            }
        }
        sw.WriteLine((dp[n & 1][0] + zero) % M);
        sw.Flush();
    }
    
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード