結果

問題 No.319 happy b1rthday 2 me
ユーザー eitaho
提出日時 2016-01-08 17:46:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 3,931 bytes
コンパイル時間 4,759 ms
コンパイル使用メモリ 109,312 KB
実行使用メモリ 19,328 KB
最終ジャッジ日時 2024-09-19 13:09:38
合計ジャッジ時間 2,977 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;
class Program
{
    public void Solve()
    {
        string A = Reader.String(), B = Reader.String();
        long ans = Count(B);
        ans -= Count((long.Parse(A) - 1) + "");
        if ((long.Parse(A) - 1).ToString().Last() == '1' && A[0] == '2') ans--;
        Console.WriteLine(ans);
    }
    private long Count(string S)
    {
        var A = S.Select(c => c - '0').ToArray();
        int len = A.Length;
        long res = 0;
        var dp = new long[len + 1, 2, 10, 10, len]; // index, smaller, firstDigit, lastDigit, count
        dp[0, 0, 0, 0, 0] = 1;
        for (int i = 0; i < len; i++)
            for (int smaller = 0; smaller < 2; smaller++)
                for (int first = 0; first <= 9; first++)
                    for (int last = 0; last <= 9; last++)
                        for (int used = 0; used < len; used++)
                        {
                            long nums = dp[i, smaller, first, last, used];
                            if (nums == 0) continue;
                            for (int d = 0; d <= 9; d++)
                            {
                                if (smaller == 0 && d > A[i]) continue;
                                int nextSmaller = smaller | (d < A[i] ? 1 : 0);
                                int nextFirst = (first > 0) ? first : d;
                                int nextUsed = used + (last == 1 && d == 2 ? 1 : 0);
                                dp[i + 1, nextSmaller, nextFirst, d, nextUsed] += nums;
                                if (i == len - 1 && nextSmaller == 1 && first == 2 && d == 1)
                                    res += nums;
                            }
                        }
        for (int used = 1; used < len; used++)
            for (int first = 0; first <= 9; first++)
                for (int last = 0; last <= 9; last++)
                    res += used * (dp[len, 0, first, last, used] + dp[len, 1, first, last, used]);
        if (long.Parse(S) >= 2) res++; // 1->2
        return res;
    }
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    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 Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private 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;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0