結果
| 問題 | No.306 さいたま2008 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-12-18 01:29:42 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 9,565 bytes |
| コンパイル時間 | 1,063 ms |
| コンパイル使用メモリ | 113,024 KB |
| 実行使用メモリ | 26,880 KB |
| 最終ジャッジ日時 | 2024-09-16 08:20:49 |
| 合計ジャッジ時間 | 4,754 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | 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 p = new Point[2];
for (int i = 0; i < 2; i++)
{
var d = i == 0 ? 1 : -1;
p[i] = new Point(d * sc.Integer(), sc.Integer());
}
var s = new Point(0, -100);
var t = new Point(0, 10000);
var xp = Geometry.CrossingPoint.Get(new Line(p[0], p[1]), new Line(s, t));
IO.Printer.Out.WriteLine("{0:#.#################", xp.Value.Imaginary);
}
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;
if (Math.Abs(Cross(db, da)) < EPS) return null;
return a.P + da * (Cross(db, b.P - a.P) / Cross(db, da));
}
}
}
#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;
}
}
#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
}