結果

問題 No.135 とりあえず1次元の問題
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-28 14:07:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 49 ms / 5,000 ms
コード長 7,335 bytes
コンパイル時間 3,161 ms
コンパイル使用メモリ 119,328 KB
実行使用メモリ 25,948 KB
最終ジャッジ日時 2024-06-11 02:14:22
合計ジャッジ時間 4,799 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
21,948 KB
testcase_01 AC 21 ms
25,680 KB
testcase_02 AC 19 ms
23,600 KB
testcase_03 AC 20 ms
23,652 KB
testcase_04 AC 19 ms
21,560 KB
testcase_05 AC 19 ms
23,772 KB
testcase_06 AC 18 ms
21,688 KB
testcase_07 AC 22 ms
25,948 KB
testcase_08 AC 22 ms
25,692 KB
testcase_09 AC 22 ms
23,784 KB
testcase_10 AC 23 ms
25,824 KB
testcase_11 AC 22 ms
23,648 KB
testcase_12 AC 22 ms
23,728 KB
testcase_13 AC 24 ms
23,764 KB
testcase_14 AC 24 ms
25,812 KB
testcase_15 AC 23 ms
23,600 KB
testcase_16 AC 24 ms
25,684 KB
testcase_17 AC 22 ms
21,816 KB
testcase_18 AC 23 ms
23,652 KB
testcase_19 AC 24 ms
25,564 KB
testcase_20 AC 22 ms
23,656 KB
testcase_21 AC 40 ms
25,768 KB
testcase_22 AC 49 ms
25,460 KB
evil01.txt AC 40 ms
23,720 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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {

            var n = sc.Integer();
            var a = sc.Integer(n);
            a.Sort();
            var min = int.MaxValue;
            for (int i = 0; i < n - 1; i++)
                if (a[i + 1] != a[i]) min = Math.Min(a[i + 1] - a[i], min);
            if (min == int.MaxValue)
                min = 0;
            IO.Printer.Out.WriteLine(min);
        }
        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 != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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
/// <summary>MergeSort</summary>
static public partial class Algorithm
{

    static public void Sort<T>(this T[] a) where T : IComparable<T>
    {
        Program.Algorithm.algorithm.Sort(a);
    }
    static public void Sort<T>(this T[] a, Comparison<T> f)
    {
        Program.Algorithm.algorithm.Sort(a, f);
    }

}
namespace Program.Algorithm
{
    using Number = Int32;
    static public partial class algorithm
    {
        static public void Sort<T>(this T[] a) where T : IComparable<T>
        {
            if (a is Number[])
                sort(a as Number[]);
            else Sort(a, Comparer<T>.Default.Compare);
        }
        static public void Sort<T>(this T[] a, Comparison<T> f)
        {
            T[] empty = { };
            var n = 1;
            while (n < a.Length)
                n <<= 1;
            var data = new T[n << 1][];
            for (int i = 0; i < a.Length; i++)
                data[i + n] = new T[] { a[i] };
            for (int i = n + a.Length; i < data.Length; i++)
                data[i] = empty;
            for (int i = n - 1; i > 0; i--)
            {
                int p = 0, q = 0, ptr = 0;
                T[] l = data[i << 1], r = data[(i << 1) + 1];
                data[i] = (l.Length + r.Length > 0) ? new T[l.Length + r.Length] : empty;
                while (p < l.Length || q < r.Length)
                {
                    if (p == l.Length)
                        data[i][ptr++] = r[q++];
                    else if (q == r.Length)
                        data[i][ptr++] = l[p++];
                    else
                    {
                        if (f(l[p], r[q]) < 0)
                            data[i][ptr++] = l[p++];
                        else data[i][ptr++] = r[q++];
                    }
                }

            }
            for (int i = 0; i < a.Length; i++)
                a[i] = data[1][i];

        }
        static public void sort(this Number[] a)
        {
            var n = a.Length;
            var tmp = new Number[n];
            Action<int, int> dfs = null;

            dfs = (l, r) =>
               {
                   if (l + 1 >= r)
                       return;
                   var m = (r + l) >> 1;
                   dfs(l, m);
                   dfs(m, r);
                   int ptr = l, p = l, q = m;
                   while (p < m || q < r)
                   {
                       if (p == m) tmp[ptr++] = a[q++];
                       else if (q == r) tmp[ptr++] = a[p++];
                       else if (a[p] < a[q]) tmp[ptr++] = a[p++];
                       else tmp[ptr++] = a[q++];
                   }
                   while (l < r) a[l] = tmp[l++];
               };
            dfs(0, n);
        }

    }

}
0