結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー eSeFeSeF
提出日時 2020-05-29 22:34:30
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,067 ms / 2,000 ms
コード長 10,729 bytes
コンパイル時間 2,493 ms
コンパイル使用メモリ 115,328 KB
実行使用メモリ 61,964 KB
最終ジャッジ日時 2024-04-23 23:42:13
合計ジャッジ時間 27,002 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 34 ms
20,864 KB
testcase_01 AC 35 ms
20,608 KB
testcase_02 AC 486 ms
44,636 KB
testcase_03 AC 901 ms
61,900 KB
testcase_04 AC 891 ms
61,880 KB
testcase_05 AC 692 ms
61,584 KB
testcase_06 AC 677 ms
61,964 KB
testcase_07 AC 173 ms
34,432 KB
testcase_08 AC 595 ms
60,856 KB
testcase_09 AC 84 ms
28,544 KB
testcase_10 AC 282 ms
41,440 KB
testcase_11 AC 197 ms
35,968 KB
testcase_12 AC 316 ms
36,992 KB
testcase_13 AC 696 ms
48,576 KB
testcase_14 AC 796 ms
55,872 KB
testcase_15 AC 893 ms
59,580 KB
testcase_16 AC 519 ms
43,520 KB
testcase_17 AC 1,028 ms
60,932 KB
testcase_18 AC 368 ms
38,656 KB
testcase_19 AC 889 ms
59,980 KB
testcase_20 AC 245 ms
35,328 KB
testcase_21 AC 478 ms
43,264 KB
testcase_22 AC 874 ms
57,532 KB
testcase_23 AC 45 ms
22,400 KB
testcase_24 AC 48 ms
23,168 KB
testcase_25 AC 298 ms
35,712 KB
testcase_26 AC 501 ms
44,036 KB
testcase_27 AC 602 ms
44,264 KB
testcase_28 AC 966 ms
55,532 KB
testcase_29 AC 165 ms
29,824 KB
testcase_30 AC 951 ms
58,176 KB
testcase_31 AC 636 ms
50,252 KB
testcase_32 AC 398 ms
41,088 KB
testcase_33 AC 924 ms
57,752 KB
testcase_34 AC 396 ms
38,528 KB
testcase_35 AC 1,000 ms
58,624 KB
testcase_36 AC 41 ms
21,376 KB
testcase_37 AC 44 ms
22,400 KB
testcase_38 AC 41 ms
22,016 KB
testcase_39 AC 43 ms
22,016 KB
testcase_40 AC 38 ms
21,376 KB
testcase_41 AC 1,067 ms
61,464 KB
testcase_42 AC 312 ms
36,088 KB
testcase_43 AC 522 ms
44,460 KB
testcase_44 AC 187 ms
31,872 KB
testcase_45 AC 499 ms
44,112 KB
testcase_46 AC 32 ms
19,968 KB
testcase_47 AC 34 ms
20,864 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using static System.Math;
using static System.Array;
using static AtCoder.IO_ShortCut;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;

        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
        static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
        //static List<List<int>> G = new List<List<int>>();
        static List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);

            /*var th = new Thread(Run, 1 << 26);
            th.Start();
            th.Join();*/

            Run();
            Console.Out.Flush();
        }

        static void Run()
        {
            int Testcase = 1;
            for (var _ = 0; _ < Testcase; _++) Solve();
        }
        static void Solve()
        {
            int N, M;
            Input(out N, out M);
            int X, Y;
            Input(out X, out Y);
            X--;Y--;
            var p = new long[N];
            var q = new long[N];
            for (var i = 0; i < N; i++) Input(out p[i], out q[i]);
            for (var i = 0; i < N; i++) G.Add(new List<Edge>());
            for(var i = 0; i < M; i++)
            {
                int P, Q;
                Input(out P, out Q);
                P--;Q--;
                var D = Sqrt(Pow(p[P] - p[Q], 2) + Pow(q[P] - q[Q], 2));
                G[P].Add(new Edge(Q, D));
                G[Q].Add(new Edge(P, D));
            }
            var ans = Dijkstra(G, X);
            OutL(ans[Y]);
        }
        public struct Edge
        {
            public int from;

            public int to;
            public double dist;

            public Edge(int t, double c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }
        }
        static public double[] Dijkstra(List<List<Edge>> G_E, int start)
        {
            int N = G_E.Count();
            var ret = new double[N];
            for (var i = 0; i < N; i++) ret[i] = SINF;
            var V = new Priority_Queue<Tuple<int, double>>((u, v) =>
            {
                var dif = u.Item2 - v.Item2;
                return dif == 0 ? 0 : (dif > 0 ? 1 : -1);
            });
            V.Enqueue(new Tuple<int, double>(start, 0));
            while (V.Any())
            {
                var t = V.Dequeue();
                int v = t.Item1;
                if (ret[v] != SINF) continue;
                ret[v] = t.Item2;
                foreach (var ed in G_E[v])
                {
                    int nx = ed.to;
                    if (ret[nx] > ret[v] + ed.dist)
                    {
                        V.Enqueue(new Tuple<int, double>(nx, ret[v] + ed.dist));
                    }
                }
            }
            return ret;
        }
    }
    public class Priority_Queue<T>
    {
        private List<T> Q;
        private readonly Comparison<T> Func_Compare;
        public Priority_Queue(Comparison<T> comp)
        {
            Func_Compare = comp;
            Q = new List<T>();
        }
        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (Func_Compare(list[n], list[pIndex]) < 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }
        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {

                    comp = Func_Compare(list[c1], list[c2]) < 0 ? c1 : c2;
                }

                if (Func_Compare(list[cur], list[comp]) > 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }
        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }

        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int Count()
        {
            return Q.Count();
        }
        public bool Any()
        {
            return Q.Any();
        }
    }
    struct ModInt
    {
        public long value;
        private const int MOD = 1000000007;
        //private const int MOD = 998244353;
        public ModInt(long value) { this.value = value; }
        public static implicit operator ModInt(long a)
        {
            var ret = a % MOD;
            return new ModInt(ret < 0 ? (ret + MOD) : ret);
        }
        public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
        public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
        public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
        public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
        public static ModInt operator <<(ModInt a, int n) => (a.value << n);
        public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
        public static ModInt operator ++(ModInt a) => a.value + 1;
        public static ModInt operator --(ModInt a) => a.value - 1;
        public static ModInt Modpow(ModInt a, long n)
        {
            var k = a;
            ModInt ret = 1;
            while (n > 0)
            {
                if ((n & 1) != 0) ret *= k;
                k *= k;
                n >>= 1;
            }
            return ret;
        }
        private static readonly List<long> Factorials = new List<long>() { 1 };
        public static ModInt Fac(long n)
        {
            for (var i = Factorials.Count(); i <= n; i++)
            {
                Factorials.Add((Factorials[i - 1] * i) % MOD);
            }
            return Factorials[(int)n];
        }
        public static ModInt nCr(long n, long r)
        {
            return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
        }
        public static explicit operator int(ModInt a) => (int)a.value;
    }
    static class IO_ShortCut
    {
        public static string[] _ReadSplit => Console.ReadLine().Split();
        public static int[] _ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
        public static long[] _ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
        public static double[] _ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
        public static string Str => Console.ReadLine();
        public static int Int => int.Parse(Console.ReadLine());
        public static long Long => long.Parse(Console.ReadLine());
        public static double Double => double.Parse(Console.ReadLine());
        public static T Conv<T>(string input)
        {
            if (typeof(T).Equals(typeof(ModInt)))
            {
                return (T)(dynamic)(long.Parse(input));
            }
            return (T)Convert.ChangeType(input, typeof(T));
        }
        public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
        public static void Input<T, U>(out T a, out U b)
        { var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }
        public static void Input<T, U, V>(out T a, out U b, out V c)
        { var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }
        public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
        { var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }
        public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
        { var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }

        public static void OutL(object s) => Console.WriteLine(s);
        public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
        public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_One(object s) => Console.Write($"{s} ");
        public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
        public static void Endl() => Console.WriteLine();
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            array = ConvertAll(array, x => initialvalue);
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }
        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }
        static public long Gcd(long a, long b)
        {
            if (a == 0 || b == 0) return Max(a, b);
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        static public long LPow(int a, int b) => (long)Pow(a, b);
        static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
        static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
    }
}
0