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

• 問題: No.3 ビットすごろく
• ユーザー: mnzn
• 提出日時: 2019-12-24 15:33:30
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 33 ms / 5,000 ms
• コード長: 9,251 bytes
• コンパイル時間: 3,413 ms
• コンパイル使用メモリ: 115,032 KB
• 実行使用メモリ: 26,300 KB
• 最終ジャッジ日時: 2024-07-01 09:35:17
• 合計ジャッジ時間: 3,377 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	29 ms; 24,236 KB
testcase_01	AC	31 ms; 24,132 KB
testcase_02	AC	30 ms; 24,356 KB
testcase_03	AC	31 ms; 24,132 KB
testcase_04	AC	32 ms; 26,164 KB
testcase_05	AC	32 ms; 24,224 KB
testcase_06	AC	30 ms; 22,200 KB
testcase_07	AC	30 ms; 24,368 KB
testcase_08	AC	31 ms; 26,172 KB
testcase_09	AC	32 ms; 24,076 KB
testcase_10	AC	33 ms; 26,256 KB
testcase_11	AC	33 ms; 24,208 KB
testcase_12	AC	31 ms; 24,140 KB
testcase_13	AC	30 ms; 24,132 KB
testcase_14	AC	33 ms; 24,344 KB
testcase_15	AC	32 ms; 22,412 KB
testcase_16	AC	32 ms; 24,196 KB
testcase_17	AC	33 ms; 26,000 KB
testcase_18	AC	31 ms; 25,828 KB
testcase_19	AC	33 ms; 22,152 KB
testcase_20	AC	30 ms; 26,300 KB
testcase_21	AC	30 ms; 24,256 KB
testcase_22	AC	32 ms; 24,332 KB
testcase_23	AC	33 ms; 24,204 KB
testcase_24	AC	33 ms; 26,252 KB
testcase_25	AC	33 ms; 24,196 KB
testcase_26	AC	29 ms; 23,880 KB
testcase_27	AC	30 ms; 24,012 KB
testcase_28	AC	33 ms; 24,472 KB
testcase_29	AC	33 ms; 24,452 KB
testcase_30	AC	30 ms; 26,152 KB
testcase_31	AC	30 ms; 24,008 KB
testcase_32	AC	31 ms; 24,072 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;

class Program
{
    static void Main(string[] args)
    {
        var N = sc.ReadInt();
        var d = new Dijkstra(N + 1, true);
        for (int i = 1; i <= N; i++)
        {
            var count = BitCount(i);
            if (i + count <= N)
            {
                d.Add(i, i + count);
            }
            if (i - count >= 1)
            {
                d.Add(i, i - count);
            }
        }
        var ans = d.GetMinCost(1, N) + 1;
        if (ans == 0) ans = -1;

        Console.WriteLine(ans);
    }
    static int BitCount(long bits)
    {
        bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
        bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
        bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
        bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
        return (int)((bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff));
    }
    class Dijkstra
    {
        public int N { get; set; }
        public List<Edge>[] G { get; set; }
        public bool Directed { get; set; }
        public Dijkstra(int n, bool directed = false)
        {
            this.N = n;
            this.Directed = directed;
            this.G = new List<Edge>[N];
            for (int i = 0; i < N; i++)
            {
                this.G[i] = new List<Edge>();
            }
        }
        public void Add(int a, int b, long cost = 1)
        {
            this.G[a].Add(new Edge(b, cost));
            if (!this.Directed) this.G[b].Add(new Edge(a, cost));
        }
        public long GetMinCost(int start, int goal)
        {
            var cost = new long[N];
            for (int i = 0; i < N; i++) cost[i] = long.MaxValue;
            cost[start] = 0;

            var q = new PriorityQueue<P>(this.N, false);
            q.Enqueue(new P(start, 0));

            while (q.Count > 0)
            {
                var p = q.Dequeue();
                if (p.Cost != cost[p.A]) continue;
                foreach (var e in this.G[p.A])
                {
                    if (cost[e.To] > p.Cost + e.Cost)
                    {
                        cost[e.To] = p.Cost + e.Cost;
                        q.Enqueue(new P(e.To, cost[e.To]));
                    }
                }
            }

            return cost[goal] == long.MaxValue ? -1 : cost[goal];
        }

        public struct Edge
        {
            public int To;
            public long Cost;
            public Edge(int to, long cost)
            {
                this.To = to;
                this.Cost = cost;
            }
        }
        public struct P : IComparable<P>
        {
            public int A;
            public long Cost;
            public P(int a, long cost)
            {
                this.A = a;
                this.Cost = cost;
            }
            public int CompareTo(P other)
            {
                return this.Cost.CompareTo(other.Cost);
            }
        }
    }

    // Comparison<T> f = (x, y) => x.CompareTo(y);
    // Comparer<T>.Create(f)
    class PriorityQueue<T>
    {
        public readonly T[] Array;
        public readonly bool Greater;
        public int Count { get; private set; } = 0;
        private IComparer<T> Cmp;
        public PriorityQueue(int capacity, bool greater = true, IComparer<T> cmp = null)
        {
            this.Cmp = cmp;
            if (cmp == null)
            {
                this.Cmp = Comparer<T>.Default;
            }
            this.Array = new T[capacity];
            this.Greater = greater;
        }

        public void Enqueue(T item)
        {
            this.Array[this.Count] = item;
            this.Count += 1;
            this.UpHeap();
        }

        public T Dequeue()
        {
            this.Swap(0, this.Count - 1);
            this.Count -= 1;
            this.DownHeap();

            return this.Array[this.Count];
        }

        public T Peek()
        {
            return this.Array[0];
        }

        private void UpHeap()
        {
            var n = this.Count - 1;
            while (n != 0)
            {
                var parent = (n - 1) / 2;

                if (this.Compare(this.Array[n], this.Array[parent]) > 0)
                {
                    this.Swap(n, parent);
                    n = parent;
                }
                else
                {
                    break;
                }
            }
        }

        private void DownHeap()
        {
            var parent = 0;
            while (true)
            {
                var child = 2 * parent + 1;
                if (child > this.Count - 1) break;

                if (child < this.Count - 1 && this.Compare(this.Array[child], this.Array[child + 1]) < 0)
                {
                    child += 1;
                }

                if (this.Compare(this.Array[parent], this.Array[child]) < 0)
                {
                    this.Swap(parent, child);
                    parent = child;
                }
                else
                {
                    break;
                }
            }
        }

        private int Compare(T a, T b)
        {
            var c = this.Cmp.Compare(a, b);
            if (!this.Greater)
            {
                c = -c;
            }
            return c;
        }

        private void Swap(int a, int b)
        {
            var tmp = this.Array[a];
            this.Array[a] = this.Array[b];
            this.Array[b] = tmp;
        }
    }
    static Scanner sc = new Scanner();
}

class Scanner
{
    string[] S = new string[0];
    int Index = 0;
    char[] Separators = new char[] { ' ' };

    public string Next()
    {
        if (this.Index < this.S.Length) return this.S[this.Index++];
        var line = "";
        while (line == "") line = Console.ReadLine();
        this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);
        if (this.S.Length == 0) return this.Next();
        this.Index = 0;
        return this.S[this.Index++];
    }
    public string ReadStr()
    {
        return this.Next();
    }
    public char ReadChar()
    {
        return this.Next()[0];
    }
    public int ReadInt()
    {
        return int.Parse(this.Next());
    }
    public uint ReadUInt()
    {
        return uint.Parse(this.Next());
    }
    public long ReadLong()
    {
        return long.Parse(this.Next());
    }
    public double ReadDouble()
    {
        return double.Parse(this.Next());
    }
    public Tuple<int, int> ReadTup(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<long, long> ReadTupLong(int add = 0)
    {
        return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add);
    }
    public Tuple<int, int, int> ReadTup3(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<int, int, int, int> ReadTup4(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public int[] ReadIntArray(int n)
    {
        var array = new int[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadInt();
        }
        return array;
    }
    public long[] ReadLongArray(int n)
    {
        var array = new long[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadLong();
        }
        return array;
    }
    public double[] ReadDoubleArray(int n)
    {
        var array = new double[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadDouble();
        }
        return array;
    }
    public char[] ReadCharArray(int n)
    {
        var array = new char[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadChar();
        }
        return array;
    }
    public string[] ReadStrArray(int n)
    {
        var array = new string[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadStr();
        }
        return array;
    }
    public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0)
    {
        var array = new Tuple<long, long>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTupLong(add);
        }
        return array;
    }
    public Tuple<int, int>[] ReadTupArray(int n, int add = 0)
    {
        var array = new Tuple<int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup(add);
        }
        return array;
    }
    public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup3(add);
        }
        return array;
    }
    public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup4(add);
        }
        return array;
    }
}