結果

問題 No.245 貫け！
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-07-18 00:03:12
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 7,625 bytes
コンパイル時間 1,053 ms
コンパイル使用メモリ 112,384 KB
実行使用メモリ 24,044 KB
最終ジャッジ日時 2024-07-08 09:48:17
合計ジャッジ時間 10,947 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
24,044 KB
testcase_01 AC 110 ms
18,176 KB
testcase_02 AC 113 ms
18,176 KB
testcase_03 AC 43 ms
18,048 KB
testcase_04 AC 109 ms
17,792 KB
testcase_05 AC 215 ms
18,048 KB
testcase_06 AC 302 ms
17,920 KB
testcase_07 AC 31 ms
18,048 KB
testcase_08 AC 2,498 ms
18,176 KB
testcase_09 TLE -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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();
            var A = new Point[2 * n];
            var seg = new Line[n];
            for (int i = 0; i < n; i++)
            {
                A[i] = new Point(sc.Integer(), sc.Integer());
                A[i + n] = new Point(sc.Integer(), sc.Integer());
                seg[i] = new Line(A[i], A[i + n]);
            }
            var max = 0;
            for (int x = -100; x <= 100; x++)
            {
                for (int y = -100; y <= 100; y++)
                {
                    var P = new Point(x, y);
                    for (int j = 0; j < 2 * n; j++)
                    {
                        if (P == A[j])
                            continue;
                        var line = new Line(P, A[j]);
                        var cnt = 0;
                        for (int k = 0; k < n; k++)
                        {
                            if (Geometry.InterSect.IntersectLineSegment(line, seg[k]))
                                cnt++;
                        }
                        max = Math.Max(max, cnt);
                    }
                }
            }
            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 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 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 public 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
0