#66710 (C#(csc)) No.325 マンハッタン距離2

• 問題: No.325 マンハッタン距離2
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-12-18 02:49:28
• 言語: C#(csc) (csc 3.9.0)
• 結果: RE
• 実行時間: -
• コード長: 12,523 bytes
• コンパイル時間: 1,417 ms
• コンパイル使用メモリ: 113,792 KB
• 実行使用メモリ: 27,392 KB
• 最終ジャッジ日時: 2024-09-16 08:24:39
• 合計ジャッジ時間: 5,691 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	RE	-
testcase_01	RE	-
testcase_02	RE	-
testcase_03	AC	118 ms; 27,392 KB
testcase_04	AC	117 ms; 27,136 KB
testcase_05	RE	-
testcase_06	AC	117 ms; 27,264 KB
testcase_07	RE	-
testcase_08	RE	-
testcase_09	RE	-
testcase_10	AC	116 ms; 27,392 KB
testcase_11	WA	-
testcase_12	AC	116 ms; 27,392 KB
testcase_13	RE	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	AC	116 ms; 27,264 KB
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	AC	116 ms; 27,264 KB
testcase_21	RE	-
testcase_22	RE	-
testcase_23	AC	118 ms; 27,136 KB
testcase_24	AC	116 ms; 27,136 KB
testcase_25	AC	118 ms; 27,264 KB
testcase_26	RE	-

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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 Number = System.Int64;
using Point = System.Numerics.Complex;
using Library.Geometry;
namespace Program
{
    //otaku ha saiko~
    public class Solver
    {
        public void Solve()
        {
            var X = new long[2];
            var Y = new long[2];
            X[0] = sc.Integer(); Y[0] = sc.Integer();
            X[1] = sc.Integer(); Y[1] = sc.Integer();
            var d = sc.Long();
            if (X[0] <= -d && d <= X[1] && Y[0] <= -d && d <= Y[1])
            {
                var S = 2 * d * d;
                var k = 4 * d;
                var t = (S + 1) - k / 2;
                IO.Printer.Out.WriteLine(k + t);
                return;
            }
            else if (Math.Abs(X[0]) + Math.Abs(Y[0]) <= d && Math.Abs(X[1]) + Math.Abs(Y[1]) <= d)
            {
                var S = (X[1] - X[0]) * (Y[1] - Y[0]);
                var k = 2 * (X[1] - X[0] + Y[1] - Y[0]);
                var t = (S + 1) - k / 2;
                IO.Printer.Out.WriteLine(k + t);
                return;
            }
            else if (
                (X[0] >= 0 && Y[0] >= 0 && X[0] + Y[0] > d) ||
                (X[0] >= 0 && Y[1] < 0 && X[0] - Y[1] > d) ||
                (X[1] < 0 && Y[0] >= 0 && -X[1] + Y[0] > d) ||
                (X[1] < 0 && Y[1] < 0 && -X[1] - Y[1] > d)
            )
            {
                IO.Printer.Out.WriteLine(0);
                return;
            }
            else throw new Exception();

        }

        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()
    {
        Debug.Listeners.Add(new TextWriterTraceListener(Program.IO.Printer.Out));
        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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        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
namespace Library.Geometry
{


    #region Line
    public struct Line
    {
        public Point P, Q;
        public Point this[int index]
        {
            get
            {
                if (index == 0) return P;
                if (index == 1) return Q;
                throw new IndexOutOfRangeException("0 or 1");
            }
            set
            {
                if (index == 0) P = value;
                if (index == 1) Q = value;
                throw new IndexOutOfRangeException("0 or 1");
            }
        }
        public Line(Point a, Point b) : this() { P = a; Q = b; }
    }
    #endregion
    #region Circle
    public struct Circle
    {
        public Point P;
        public double R;
        public Circle(Point p, double r) : this() { P = p; R = r; }
    }
    #endregion
    #region Polygon
    public class Polygon : List<Point> { }
    #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 Intersect
    static public partial class Geometry
    {
        static public class InterSect
        {
            static bool IntersectLineLine(Line a, Line b)
            {
                return Math.Abs(Cross(a.Q - a.P, b.Q - b.P)) > EPS ||
                    Math.Abs(Cross(a.Q - a.P, b.Q - b.P)) < EPS;
            }
            static bool IntersectLineSegment(Line l, Line s)
            {
                return Cross(l.Q - l.P, s.P - l.P) * Cross(l.Q - l.P, s.Q - l.P) < EPS;
            }
            static bool IntersectSegmentSegment(Line a, Line b)
            {
                return CCW(a.P, a.Q, b.P) * CCW(a.P, a.Q, b.Q) <= 0 && CCW(b.P, b.Q, a.P) * CCW(b.P, b.Q, a.Q) <= 0;
            }
            static bool IntersectSegmentPoint(Line s, Point p)
            {
                return (s.P - p).Magnitude + (s.Q - p).Magnitude < EPS;
            }
        }
    }
    #endregion
    #region 
    static public partial class Geometry
    {
        static public class CrossingPoint
        {
            static public Point? Get(Line a, Line b)
            {
                var da = a.Q - a.P;
                var db = b.Q - b.P;
                var c = Cross(db, da);
                if (Math.Abs(c) < 1e-12) return null;
                return a.P + da * (Cross(db, b.P - a.P) / c);
            }
        }
    }
    #endregion

    #region ConvexHull
    static public partial class Geometry
    {
        static public Point[] ConvexHull(Point[] ps)
        {
            var n = ps.Length;
            Array.Sort(ps, (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;
        }
        static bool Intersect1Pt(Point a, Point b, Point c, Point d, ref Point r)
        {
            var D = Cross(b - a, d - c);
            if (Compare(D, 0) == 0) return false;
            var t = Cross(c - a, d - c) / D;
            var s = -Cross(a - c, b - a) / D;
            r = a + t * (b - a);
            return Compare(t, 0) > 0 && Compare(t, 1) < 0 && Compare(s, 0) > 0 && Compare(s, 1) < 0;
        }

        static public Point[] ConvexIntersect(Point[] P, Point[] Q)
        {
            var n = P.Length;
            var m = Q.Length;
            int a = 0, b = 0, aa = 0, ba = 0;
            var go = 0;
            var ret = new List<Point>();
            do
            {
                var a1 = (a + n - 1) % n;
                var b1 = (b + m - 1) % m;
                var C = Cross(P[a] - P[a1], Q[b] - Q[b1]);
                var A = Cross(P[a1] - Q[b], P[a] - Q[b]);
                var B = Cross(Q[b1] - P[a], Q[b] - P[a]);
                Point r = new Point();
                if (Intersect1Pt(P[a1], P[a], Q[b1], Q[b], ref r))
                {
                    if (go == 0)
                    {
                        aa = ba = 0;
                    }
                    ret.Add(r);
                    go = B > 0 ? 1 : A > 0 ? -1 : go;
                }
                if (C == 0 && B == 0 && A == 0)
                {
                    if (go == 1) { b = (b + 1) % m; ba++; }
                    else { a = (a + 1) % n; aa++; }

                }
                else if (C >= 0)
                {
                    if (A > 0) { if (go == 1) { ret.Add(P[a]); a = (a + 1) % n; aa++; } }
                    else { if (go == -1) ret.Add(Q[b]); b = (b + 1) % m; ba++; }
                }
                else
                {
                    if (B > 0) { if (go == -1) ret.Add(Q[b]); b = (b + 1) % m; ba++; }
                    else { if (go == 1) ret.Add(P[a]); a = (a + 1) % n; aa++; }
                }
            } while ((aa < n || ba < m) && aa < 2 * n && ba < 2 * m);
            if (go == 0)
            {
                //if()
            }
            return ret.ToArray();
        }
    }
    #endregion
    #region area of polygon
    static public partial class Geometry
    {
        static public double Area(Point[] ps)
        {
            double crossSum = 0;
            int size = ps.Length;
            for (int i = 0; i < size; i++)
            {
                Point v1 = ps[i];
                Point v2 = ps[(i + 1) % size];
                crossSum += Cross(v1, v2);
            }
            return Math.Abs(crossSum / 2.0);

        }

    }
    #endregion

}