結果

問題 No.96 圏外です。
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-25 17:38:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,976 ms / 5,000 ms
コード長 9,029 bytes
コンパイル時間 2,932 ms
コンパイル使用メモリ 114,168 KB
実行使用メモリ 244,808 KB
最終ジャッジ日時 2023-08-25 21:47:32
合計ジャッジ時間 49,937 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,454 ms
234,044 KB
testcase_01 AC 1,432 ms
230,120 KB
testcase_02 AC 1,391 ms
232,012 KB
testcase_03 AC 47 ms
20,536 KB
testcase_04 AC 1,387 ms
232,024 KB
testcase_05 AC 1,439 ms
231,980 KB
testcase_06 AC 1,460 ms
232,044 KB
testcase_07 AC 1,416 ms
232,040 KB
testcase_08 AC 1,474 ms
230,000 KB
testcase_09 AC 1,447 ms
232,096 KB
testcase_10 AC 1,488 ms
232,020 KB
testcase_11 AC 1,461 ms
230,036 KB
testcase_12 AC 1,499 ms
232,004 KB
testcase_13 AC 1,645 ms
234,224 KB
testcase_14 AC 1,511 ms
234,272 KB
testcase_15 AC 1,598 ms
232,168 KB
testcase_16 AC 1,618 ms
237,388 KB
testcase_17 AC 1,732 ms
244,808 KB
testcase_18 AC 1,712 ms
242,976 KB
testcase_19 AC 1,741 ms
243,368 KB
testcase_20 AC 1,702 ms
233,128 KB
testcase_21 AC 1,825 ms
236,232 KB
testcase_22 AC 1,930 ms
231,964 KB
testcase_23 AC 1,976 ms
232,056 KB
testcase_24 AC 1,411 ms
234,024 KB
testcase_25 AC 1,625 ms
236,304 KB
testcase_26 AC 1,672 ms
243,352 KB
testcase_27 AC 1,620 ms
240,368 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;


using Point = System.Numerics.Complex;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            if (n == 0)
            {
                IO.Printer.Out.WriteLine(1);
                return;
            }
            const int D = 10000;
            var bucket = new List<int>[20050 / 10, 20050 / 10];
            for (int i = 0; i < 2005; i++)
                for (int j = 0; j < 2005; j++)
                    bucket[i, j] = new List<int>();
            var X = new int[n];
            var Y = new int[n];
            for (int i = 0; i < n; i++)
            {
                var x = X[i] = sc.Integer() + D;
                var y = Y[i] = sc.Integer() + D;
                bucket[x / 10, y / 10].Add(i);
            }

            var set = new DisjointSet(n);
            int[] d = { -1, 0, 1 };
            for (int i = 0; i < n; i++)
            {
                var px = X[i] / 10;
                var py = Y[i] / 10;
                for (int j = 0; j < 3; j++)
                    for (int k = 0; k < 3; k++)
                    {
                        if (px + d[j] < 0 || py + d[k] < 0) continue;
                        foreach (var p in bucket[px + d[j], py + d[k]])
                        {
                            var dx = X[p] - X[i];
                            var dy = Y[p] - Y[i];
                            if (dx * dx + dy * dy <= 100)
                                set.Unite(i, p);
                        }
                    }

            }
            var max = 2.0;
            var Ps = Enumerate(n, x => new List<Point>());
            for (int i = 0; i < n; i++)
                Ps[set[i]].Add(new Point(X[i], Y[i]));
            for (int i = 0; i < n; i++)
            {
                if (set[i] != i) continue;
                var conv = Geometry.ConvexHull(Ps[i]);
                for (int j = 0; j < conv.Length; j++)
                    for (int k = j + 1; k < conv.Length; k++)
                    {
                        var dx = conv[j].Real - conv[k].Real;
                        var dy = conv[j].Imaginary - conv[k].Imaginary;
                        max = Math.Max(max, Math.Sqrt(dx * dx + dy * dy) + 2);
                    }
            }
            IO.Printer.Out.WriteLine(max);
        }
        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
#region DisjointSet
public class DisjointSet
{
    int[] par, ranks, count;
    public DisjointSet(int n)
    {
        par = new int[n];
        count = new int[n];
        for (int i = 0; i < n; i++)
        {
            par[i] = i;
            count[i] = 1;
        }
        ranks = new int[n];
    }
    public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } }
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (ranks[x] < ranks[y])
        {
            par[x] = y;
            count[y] += count[x];
        }
        else
        {
            par[y] = x;
            count[x] += count[y];
            if (ranks[x] == ranks[y])
                ranks[x]++;
        }
        return true;
    }
    public int Size(int x) { return count[this[x]]; }
    public bool IsUnited(int x, int y) { return this[x] == this[y]; }

}
#endregion

#region Functions
static public partial class Geometry
{
    public const double EPS = 1e-8;
    static public double Cross(Point a, Point b)
    {
        return (Point.Conjugate(a) * b).Imaginary;
    }
    static public double Dot(Point a, Point b)
    {
        return (Point.Conjugate(a) * b).Real;
    }
    static public int CCW(Point a, Point b, Point c)
    {
        b -= a; c -= a;
        if (Cross(b, c) > 0) return 1;
        if (Cross(b, c) < 0) return -1;
        if (Dot(b, c) < 0) return 2;
        if (b.Magnitude < c.Magnitude) return -2;
        return 0;
    }
    static public int Compare(Point a, Point b)
    {
        if (a.Real != b.Real)
            return (a.Real > b.Real) ? 1 : -1;
        else if (a.Imaginary != b.Imaginary)
            return a.Imaginary > b.Imaginary ? 1 : -1;
        return 0;
    }
}
#endregion
#region ConvexHull
static public partial class Geometry
{
    static public Point[] ConvexHull(List<Point> ps)
    {
        var n = ps.Count;
        ps.Sort((l, r) =>
        {
            var cmp = l.Real.CompareTo(r.Real);
            return cmp != 0 ? cmp : l.Imaginary.CompareTo(r.Imaginary);
        });
        var ch = new Point[2 * n];
        var k = 0;
        for (int i = 0; i < n; ch[k++] = ps[i++])
            while (k >= 2 && Geometry.CCW(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;
        for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])
            while (k >= t && Geometry.CCW(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;
        var ret = new Point[k - 1];
        for (int i = 0; i < k - 1; i++)
            ret[i] = ch[i];
        return ret;
    }
}
#endregion
0