結果

問題 No.406 鴨等間隔の法則
ユーザー eSeFeSeF
提出日時 2020-01-03 15:32:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 126 ms / 2,000 ms
コード長 5,160 bytes
コンパイル時間 1,074 ms
コンパイル使用メモリ 68,672 KB
実行使用メモリ 30,192 KB
最終ジャッジ日時 2023-09-21 19:10:30
合計ジャッジ時間 5,564 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
22,832 KB
testcase_01 AC 58 ms
20,652 KB
testcase_02 AC 57 ms
20,776 KB
testcase_03 AC 57 ms
20,640 KB
testcase_04 AC 121 ms
25,676 KB
testcase_05 AC 84 ms
22,568 KB
testcase_06 AC 85 ms
22,620 KB
testcase_07 AC 86 ms
20,672 KB
testcase_08 AC 121 ms
27,612 KB
testcase_09 AC 124 ms
28,096 KB
testcase_10 AC 89 ms
22,856 KB
testcase_11 AC 113 ms
29,052 KB
testcase_12 AC 94 ms
21,164 KB
testcase_13 AC 92 ms
23,680 KB
testcase_14 AC 116 ms
27,188 KB
testcase_15 AC 68 ms
21,324 KB
testcase_16 AC 68 ms
21,192 KB
testcase_17 AC 67 ms
21,036 KB
testcase_18 AC 69 ms
21,316 KB
testcase_19 AC 69 ms
21,448 KB
testcase_20 AC 71 ms
23,640 KB
testcase_21 AC 72 ms
21,688 KB
testcase_22 AC 78 ms
22,184 KB
testcase_23 AC 97 ms
25,708 KB
testcase_24 AC 110 ms
26,968 KB
testcase_25 AC 125 ms
28,108 KB
testcase_26 AC 126 ms
28,140 KB
testcase_27 AC 113 ms
30,164 KB
testcase_28 AC 121 ms
28,132 KB
testcase_29 AC 126 ms
30,192 KB
testcase_30 AC 124 ms
28,104 KB
testcase_31 AC 123 ms
27,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dx = { 0, 1, 0, -1 };
        static readonly int[] dy = { 1, 0, -1, 0 };
        //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 cin = new Scanner();

            int n = int.Parse(Console.ReadLine());
            var x = cin.ReadSplitInt();
            Sort(x);
            int dif = x[1] - x[0];
            for(var i = 1; i < n; i++)
            {
                if (x[i] - x[i - 1] != dif) { Console.WriteLine("NO");return; }
            }
            Console.WriteLine(dif != 0 ? "YES" : "NO");

            //Console.Out.Flush();
        }
        struct Edge
        {
            public int from;

            public int to;
            public long dist;
            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }

        }
    }
    public class PriorityQueue<T> where T : IComparable<T>
    {

        private List<T> Q;
        private readonly int r;

        public PriorityQueue(bool ascending)
        {
            if (ascending)
            {
                r = 1;
            }
            else
            {
                r = -1;
            }
            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 (list[n].CompareTo(list[pIndex]) * r > 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 = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
                }

                if (list[cur].CompareTo(list[comp]) * r < 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 Contains(T obj)
        {
            return Q.Contains(obj);
        }
    }
    public class Scanner
    {
        public int[] ReadSplitInt()
        {
            return ConvertAll(Console.ReadLine().Split(), int.Parse);
        }
        public long[] ReadSplitLong()
        {
            return ConvertAll(Console.ReadLine().Split(), long.Parse);
        }
        public double[] ReadSplit_Double()
        {
            return ConvertAll(Console.ReadLine().Split(), double.Parse);
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = 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 LPow(int a, int b)
        {
            return (long)Pow(a, b);
        }
    }
}
0