結果
| 問題 | No.306 さいたま2008 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-11-27 23:01:20 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,384 bytes |
| コンパイル時間 | 1,404 ms |
| コンパイル使用メモリ | 119,076 KB |
| 実行使用メモリ | 27,464 KB |
| 最終ジャッジ日時 | 2024-09-14 00:19:56 |
| 合計ジャッジ時間 | 3,211 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 28 ms
25,320 KB |
| testcase_01 | AC | 28 ms
25,188 KB |
| testcase_02 | AC | 29 ms
25,140 KB |
| testcase_03 | AC | 29 ms
27,216 KB |
| testcase_04 | AC | 28 ms
25,168 KB |
| testcase_05 | AC | 29 ms
25,188 KB |
| testcase_06 | AC | 29 ms
27,344 KB |
| testcase_07 | AC | 29 ms
25,136 KB |
| testcase_08 | AC | 29 ms
27,220 KB |
| testcase_09 | AC | 28 ms
27,216 KB |
| testcase_10 | AC | 29 ms
27,220 KB |
| testcase_11 | AC | 29 ms
25,136 KB |
| testcase_12 | AC | 29 ms
23,344 KB |
| testcase_13 | AC | 29 ms
25,444 KB |
| testcase_14 | AC | 28 ms
27,464 KB |
| testcase_15 | AC | 29 ms
27,104 KB |
| testcase_16 | AC | 29 ms
27,212 KB |
| testcase_17 | AC | 29 ms
27,216 KB |
| testcase_18 | AC | 30 ms
27,228 KB |
| testcase_19 | AC | 28 ms
25,192 KB |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | AC | 29 ms
25,264 KB |
コンパイルメッセージ
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.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 p = new Point[2];
for (int i = 0; i < 2; i++)
{
var x = sc.Integer();
var y = sc.Integer();
p[i] = new Point(x, y);
}
var ans = Algorithm.GoldenSectionSearch(-1e9, 1e9, y =>
{
var res = 0.0;
for (int i = 0; i < 2; i++)
{
var v = new Point(p[i].Real, p[i].Imaginary - y);
res += v.Magnitude;
}
return res;
});
IO.Printer.Out.WriteLine("{0:0.000000000000000000}", ans);
}
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 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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<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 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); }
}
}
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 GoldenSectionSearch
static public partial class Algorithm
{
static public double GoldenSectionSearch(double a, double b, Func<double, double> function)
{
var r = 2 / (3 + Math.Sqrt(5));
var c = a + r * (b - a);
var d = b - r * (b - a);
var fc = function(c);
var fd = function(d);
for (int i = 0; i < 1000; i++)
{
if (fc > fd)//凹
{
a = c; c = d; d = b - r * (b - a);
fc = fd; fd = function(d);
}
else
{
b = d; d = c; c = a + r * (b - a);
fd = fc; fc = function(c);
}
}
return c;
}
}
#endregion