結果

問題 No.362 門松ナンバー
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-05-30 13:56:31
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,087 ms / 3,000 ms
コード長 6,703 bytes
コンパイル時間 942 ms
コンパイル使用メモリ 120,092 KB
実行使用メモリ 30,100 KB
最終ジャッジ日時 2024-10-07 18:00:14
合計ジャッジ時間 15,759 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 195 ms
29,980 KB
testcase_01 AC 175 ms
29,980 KB
testcase_02 AC 166 ms
29,848 KB
testcase_03 AC 108 ms
27,808 KB
testcase_04 AC 70 ms
28,068 KB
testcase_05 AC 331 ms
27,944 KB
testcase_06 AC 615 ms
29,856 KB
testcase_07 AC 371 ms
29,980 KB
testcase_08 AC 500 ms
27,808 KB
testcase_09 AC 806 ms
27,928 KB
testcase_10 AC 1,025 ms
28,060 KB
testcase_11 AC 1,010 ms
27,808 KB
testcase_12 AC 993 ms
27,940 KB
testcase_13 AC 1,020 ms
29,728 KB
testcase_14 AC 1,012 ms
28,068 KB
testcase_15 AC 1,004 ms
28,060 KB
testcase_16 AC 984 ms
27,808 KB
testcase_17 AC 844 ms
27,936 KB
testcase_18 AC 1,080 ms
29,860 KB
testcase_19 AC 366 ms
28,056 KB
testcase_20 AC 1,087 ms
30,100 KB
testcase_21 AC 130 ms
27,932 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var t = sc.Integer();
            for (int _ = 0; _ < t; _++)
            {
                var k = sc.Long();
                long l = 101, r = 37294859064824;
                for (int __ = 0; __ < 100; __++)
                {
                    var m = (l + r) / 2;
                    //m = 102;
                    var cnt = count(m.ToString());
                    if (cnt < k)
                        l = m;
                    else r = m;
                }
                IO.Printer.Out.WriteLine(r);
            }
        }
        long count(string X)
        {
            var dp = new long[12, 12, 2];
            for (int i = 0; i < X.Length; i++)
            {
                if (X.Length - i >= 3)
                {
                    dp[0, 11, i == 0 ? 0 : 1] = 1;
                    dp[11, 0, i == 0 ? 0 : 1] = 1;
                }
                var next = new long[12, 12, 2];
                var V = X[i] - '0';
                for (int v = 0; v < 10; v++)
                {
                    if (v <= V)
                    {
                        var go = v == V ? 0 : 1;
                        for (int pp = 0; pp < 12; pp++)
                            for (int p = 0; p < 12; p++)
                            {
                                if ((p == 0 || p == 11) && v == 0) continue;
                                if (ok(pp, p, v + 1)) next[p, v + 1, go] += dp[pp, p, 0];
                            }
                    }
                    for (int pp = 0; pp < 12; pp++)
                        for (int p = 0; p < 12; p++)
                        {
                            if ((p == 0 || p == 11) && v == 0) continue;
                            if (ok(pp, p, v + 1)) next[p, v + 1, 1] += dp[pp, p, 1];
                        }
                }
                dp = next;
            }
            long ans = 0;
            for (int i = 1; i <= 10; i++)
                for (int j = 1; j <= 10; j++)
                    ans += dp[i, j, 0] + dp[i, j, 1];
            return ans;
        }
        public bool ok(params int[] a)
        {
            if (a[0] == a[1] || a[1] == a[2] || a[0] == a[2]) return false;
            if (a[0] > a[1] && a[1] < a[2]) return true;
            if (a[0] < a[1] && a[1] > a[2]) return true;
            return false;
        }
        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(s, 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
0