結果

問題 No.319 happy b1rthday 2 me
ユーザー 紙ぺーぱー
提出日時 2015-12-12 01:26:11
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 8,225 bytes
コンパイル時間 1,028 ms
コンパイル使用メモリ 111,616 KB
実行使用メモリ 17,664 KB
最終ジャッジ日時 2024-09-15 08:33:26
合計ジャッジ時間 2,786 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var a = sc.Long();
var b = sc.Long();
{
/*
long ans = -1;
if (b <= 100000)
{
var sb = new StringBuilder();
for (long _ = a; _ <= b; _++)
sb.Append(_.ToString());
sb.Append("$");
var s = sb.ToString();
long cnt = 0;
for (int _ = 0; _ < s.Length - 1; _++)
{
if (s[_] == '1' && s[_ + 1] == '2') cnt++;
}
//IO.Printer.Out.WriteLine(cnt);
ans = cnt;
//return;
}
//*/
var A = func(b.ToString()) - func((a - 1).ToString());
var B = action(b.ToString()) - action((a - 1).ToString());
//IO.Printer.Out.WriteLine(func(b.ToString()) - func(a.ToString()));
//IO.Printer.Out.WriteLine(action(b.ToString()) - action(a.ToString()));
if ((a - 1).ToString()[0] == '2' && (a - 1) % 10 == 1) B--;
if (a == 1 && 1 < b) B++;
IO.Printer.Out.WriteLine(A + B);
}
}
static long func(string str)
{
var len = str.Length;
// lower,len,mod 10, cnt(12)
var dp = new long[2, len + 1, 10, 10];
dp[1, 0, 0, 0] = 1;
var ret = 0L;
for (int i = 0; i < len; i++)
for (int j = 0; j < 10; j++)
for (int k = 0; k < 9; k++)
for (int v = 0; v < 10; v++)
{
if (v == str[i] - '0')
{
if (j == 1 && v == 2)
dp[1, i + 1, v, k + 1] += dp[1, i, j, k];
else dp[1, i + 1, v, k] += dp[1, i, j, k];
}
else if (v < str[i] - '0')
{
if (j == 1 && v == 2)
dp[0, i + 1, v, k + 1] += dp[1, i, j, k];
else dp[0, i + 1, v, k] += dp[1, i, j, k];
}
if (j == 1 && v == 2)
dp[0, i + 1, v, k + 1] += dp[0, i, j, k];
else dp[0, i + 1, v, k] += dp[0, i, j, k];
}
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
ret += j * dp[0, len, i, j] + j * dp[1, len, i, j];
return ret;
}
static long action(string str)
{
var len = str.Length;
// lower,len,mod 10,
var dp = new long[2, len + 1, 10];
for (int i = 0; i < len; i++)
{
for (int j = 0; j < 10; j++)
{
for (int v = 0; v < 10; v++)
{
if (v == str[i] - '0')
{
dp[1, i + 1, v] += dp[1, i, j];
}
else if (v < str[i] - '0')
{
dp[0, i + 1, v] += dp[1, i, j];
}
dp[0, i + 1, v] += dp[0, i, j];
}
}
if (i == 0 && i < len - 1)
{
if (2 == str[i] - '0')
dp[1, i + 1, 2] += 1;
else if (2 < str[i] - '0') dp[0, i + 1, 2] += 1;
}
else if (i < len - 1) dp[0, i + 1, 2] += 1;
}
return dp[0, len, 2] + dp[1, len, 2];
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0