#408242 (C#(csc)) No.3 ビットすごろく

• 問題: No.3 ビットすごろく
• ユーザー: ひばち
• 提出日時: 2019-12-13 18:12:58
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 33 ms / 5,000 ms
• コード長: 7,855 bytes
• コンパイル時間: 1,094 ms
• コンパイル使用メモリ: 119,424 KB
• 実行使用メモリ: 26,232 KB
• 最終ジャッジ日時: 2024-07-01 09:33:39
• 合計ジャッジ時間: 3,035 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	28 ms; 23,684 KB
testcase_01	AC	28 ms; 26,000 KB
testcase_02	AC	28 ms; 21,820 KB
testcase_03	AC	29 ms; 25,980 KB
testcase_04	AC	28 ms; 23,936 KB
testcase_05	AC	31 ms; 25,972 KB
testcase_06	AC	30 ms; 23,936 KB
testcase_07	AC	29 ms; 23,812 KB
testcase_08	AC	30 ms; 23,812 KB
testcase_09	AC	30 ms; 21,928 KB
testcase_10	AC	33 ms; 26,232 KB
testcase_11	AC	31 ms; 24,056 KB
testcase_12	AC	31 ms; 23,928 KB
testcase_13	AC	30 ms; 25,916 KB
testcase_14	AC	31 ms; 24,068 KB
testcase_15	AC	32 ms; 24,168 KB
testcase_16	AC	32 ms; 23,984 KB
testcase_17	AC	32 ms; 24,060 KB
testcase_18	AC	29 ms; 23,980 KB
testcase_19	AC	32 ms; 24,044 KB
testcase_20	AC	30 ms; 23,852 KB
testcase_21	AC	29 ms; 25,980 KB
testcase_22	AC	32 ms; 26,020 KB
testcase_23	AC	32 ms; 24,040 KB
testcase_24	AC	32 ms; 23,908 KB
testcase_25	AC	32 ms; 24,060 KB
testcase_26	AC	29 ms; 24,064 KB
testcase_27	AC	30 ms; 24,196 KB
testcase_28	AC	32 ms; 23,864 KB
testcase_29	AC	30 ms; 23,936 KB
testcase_30	AC	29 ms; 23,940 KB
testcase_31	AC	28 ms; 21,684 KB
testcase_32	AC	29 ms; 21,684 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;
using tpDijkstra = System.Int64;

class Solver
{
    Scanner sc = new Scanner();
    //

    public void Solve()
    {
        var N = sc.Int;
        var d = new Dijkstra(N);
        for(var i = 1; i <= N; i++)
        {
            var c = 0;
            for (var j = 0; j < 20; j++)
                c += 1 & i >> j;
            if (c == 0) continue;
            if (i - c >= 1)
                d.AddEdge(i - 1, i - c - 1,1);
            if (i + c <= N)
                d.AddEdge(i - 1, i + c - 1, 1);
        }
        var res = d.Execute();
        WriteLine(res[N - 1] == long.MaxValue ? -1 : ++res[N - 1]);
    }
}

class Dijkstra
{
    private int size;
    private List<Edge>[] edges;
    public Dijkstra(int size)
    { this.size = size; edges = Create(size, () => new List<Edge>()); }
    public void AddEdge(int from, int to, tpDijkstra weight)
        => edges[from].Add(new Edge(to, weight));
    public tpDijkstra[] Execute(int st = 0)
    {
        var dist = Create(size, () => tpDijkstra.MaxValue);
        var pq = new PriorityQueue<Edge>();
        pq.Push(new Edge(st, 0));
        dist[st] = 0;
        while (pq.Any())
        {
            var p = pq.Pop();
            if (p.cost > dist[p.to]) continue;
            foreach (var e in edges[p.to])
                if (chmin(ref dist[e.to], e.cost + p.cost))
                    pq.Push(new Edge(e.to, dist[e.to]));
        }
        return dist;
    }

    struct Edge : IComparable<Edge>
    {
        public int to;
        public tpDijkstra cost;
        public Edge(int to, tpDijkstra cost)
        { this.to = to; this.cost = cost; }
        public int CompareTo(Edge e)
            => cost.CompareTo(e.cost);
    }
}
public class PriorityQueue<T>
{
    private List<T> data = new List<T>();
    private Comparison<T> cmp;
    public int Count { get { return data.Count; } }
    public T Top { get { return data[0]; } }
    public PriorityQueue() { cmp = cmp ?? Comparer<T>.Default.Compare; }

    public PriorityQueue(Comparison<T> comparison) { cmp = comparison; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private int Parent(int i)
        => (i - 1) >> 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private int Left(int i)
        => (i << 1) + 1;
    public T Push(T val)
    {
        int i = data.Count;
        data.Add(val);
        while (i > 0)
        {
            int p = Parent(i);
            if (cmp(data[p], val) <= 0)
                break;
            data[i] = data[p];
            i = p;
        }
        data[i] = val;
        return val;
    }
    public T Pop()
    {
        var ret = data[0];
        var p = 0;
        var x = data[data.Count - 1];
        while (Left(p) < data.Count - 1)
        {
            var l = Left(p);
            if (l < data.Count - 2 && cmp(data[l + 1], data[l]) < 0) l++;
            if (cmp(data[l], x) >= 0)
                break;
            data[p] = data[l];
            p = l;
        }
        data[p] = x;
        data.RemoveAt(data.Count - 1);
        return ret;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public bool Any() => data.Count > 0;
}
#region Template
public class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f();
        return rt;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f(i);
        return rt;
    }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
    public void Tie(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString()
        => $"{base.ToString()} {v3.ToString()}";
    public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion