結果
| 問題 | No.635 自然門松列 |
| ユーザー |
 sekiya9311
|
| 提出日時 | 2018-01-19 22:18:38 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,240 bytes |
| コンパイル時間 | 2,241 ms |
| コンパイル使用メモリ | 111,116 KB |
| 実行使用メモリ | 28,236 KB |
| 最終ジャッジ日時 | 2023-08-26 00:20:01 |
| 合計ジャッジ時間 | 5,019 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 67 ms
23,908 KB |
| testcase_01 | AC | 63 ms
24,016 KB |
| testcase_02 | AC | 64 ms
21,928 KB |
| testcase_03 | AC | 68 ms
26,048 KB |
| testcase_04 | AC | 69 ms
23,972 KB |
| testcase_05 | AC | 77 ms
26,168 KB |
| testcase_06 | AC | 77 ms
28,024 KB |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | AC | 71 ms
24,076 KB |
| testcase_12 | WA | - |
| testcase_13 | AC | 94 ms
26,104 KB |
| testcase_14 | AC | 92 ms
28,120 KB |
| testcase_15 | AC | 64 ms
23,996 KB |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | AC | 80 ms
28,048 KB |
| testcase_22 | AC | 80 ms
28,032 KB |
| testcase_23 | AC | 80 ms
25,948 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.Collections.Generic;
using System.Linq;
using System.Text;
namespace ProgrammingContest
{
class Writer : IDisposable
{
private System.IO.TextWriter writer;
private StringBuilder sb;
private bool isReactive;
public Writer(string path)
: this(new System.IO.StreamWriter(path))
{
}
public Writer(bool isReactive)
: this(null, isReactive)
{
}
public Writer(System.IO.TextWriter writer = null,
bool isReactive = false)
{
this.writer = (writer ?? Console.Out);
this.isReactive = isReactive;
if (!this.isReactive)
{
this.sb = new StringBuilder();
}
}
public void Dispose()
{
if (!this.isReactive)
{
this.writer.Write(sb.ToString());
}
if (!this.writer.Equals(Console.Out))
{
this.writer.Dispose();
}
}
public void Write(object val)
{
if (this.isReactive)
{
this.writer.Write(val.ToString());
this.writer.Flush();
}
else
{
this.sb.Append(val.ToString());
}
}
public void Write(string format, params object[] vals)
{
if (this.isReactive)
{
this.writer.Write(format, vals);
this.writer.Flush();
}
else
{
this.sb.AppendFormat(format, vals);
}
}
public void WriteLine(object val = null)
{
this.Write((val ?? string.Empty).ToString() + System.Environment.NewLine);
}
public void WriteLine(int val)
{
this.WriteLine(val.ToString());
}
public void WriteLine(long val)
{
this.WriteLine(val.ToString());
}
public void WriteLine(string val)
{
this.WriteLine((object)val);
}
public void WriteLine(string format, params object[] vals)
{
this.Write(format + System.Environment.NewLine, vals);
}
}
class Scanner : IDisposable
{
private Queue<string> buffer;
private char[] sep;
private System.IO.TextReader reader;
public Scanner(string path, char[] sep = null)
: this(new System.IO.StreamReader(path), sep)
{
}
public Scanner(System.IO.TextReader reader = null,
char[] sep = null)
{
this.buffer = new Queue<string>();
this.sep = (sep ?? new char[] { ' ' });
this.reader = (reader ?? Console.In);
}
private void CheckBuffer()
{
if (this.buffer.Count == 0 && this.reader.Peek() != -1)
{
string str = string.Empty;
for (; string.IsNullOrEmpty(str);
str = this.reader.ReadLine()) ;
str.Split(this.sep).ToList()
.ForEach(el => this.buffer.Enqueue(el));
}
}
public void Dispose()
{
if (!this.reader.Equals(Console.In))
{
this.reader.Dispose();
}
}
public string Next
{
get
{
this.CheckBuffer();
return this.buffer.Dequeue();
}
}
public string[] GetStringArray(int N)
{
return Enumerable.Range(0, N)
.Select(e => this.Next)
.ToArray();
}
public int NextInt
{
get
{
return int.Parse(this.Next);
}
}
public int[] GetIntArray(int N)
{
return Enumerable.Range(0, N)
.Select(e => this.NextInt)
.ToArray();
}
public double NextDouble
{
get
{
return double.Parse(this.Next);
}
}
public double[] GetdoubleArray(int N)
{
return Enumerable.Range(0, N)
.Select(e => this.NextDouble)
.ToArray();
}
public long NextLong
{
get
{
return long.Parse(this.Next);
}
}
public long[] GetLongArray(int N)
{
return Enumerable.Range(0, N)
.Select(e => this.NextLong)
.ToArray();
}
public bool IsEnd
{
get
{
this.CheckBuffer();
return this.buffer.Count == 0;
}
}
}
class MainClass : IDisposable
{
Scanner sc;
Writer wr;
string backPath = "..";
char dirSep = System.IO.Path.DirectorySeparatorChar;
string inFilePath = string.Empty;
string outFilePath = string.Empty;
public MainClass()
{
this.inFilePath = this.backPath
+ this.dirSep
+ this.backPath
+ this.dirSep
+ "in.txt";
this.outFilePath = this.backPath
+ this.dirSep
+ this.backPath
+ this.dirSep
+ "out.txt";
this.wr = new Writer(this.isReactive);
//this.wr = new Writer(this.outFilePath);
#if DEBUG
if (!this.isReactive)
{
this.sc = new Scanner(this.inFilePath);
}
else
{
this.sc = new Scanner();
}
#else
this.sc = new Scanner();
#endif
}
static void Main(string[] args)
{
using (var mainClass = new MainClass())
{
mainClass.Solve();
}
}
public void Dispose()
{
if (this.sc != null)
{
this.sc.Dispose();
this.sc = null;
}
if (this.wr != null)
{
this.wr.Dispose();
this.wr = null;
}
}
void MakeTestCase()
{
Random rand = new Random();
if (this.wr != null)
{
this.wr.Dispose();
}
this.wr = new Writer(inFilePath);
}
bool IsKadomonmatsu(long[] x)
{
return (x.Max() == x[1] || x.Min() == x[1])
&& (x[0] != x[1] && x[1] != x[2] && x[2] != x[0]);
}
bool IsKadomonmatsu(double[] x)
{
return (x.Max() == x[1] || x.Min() == x[1])
&& (x[0] != x[1] && x[1] != x[2] && x[2] != x[0]);
}
bool Calc(long[] x, long[] y, double time, bool isLowUp)
{
const int L = 3;
var nx = x.Select(e => (double)e).ToArray();
for (int i = 0; i < L; i++)
{
nx[i] += y[i] * time;
}
if (IsKadomonmatsu(nx))
{
throw new Exception();
}
return (x[0] >= x[1] && x[1] >= x[2]) ^ isLowUp;
}
void Solve()
{
int N = sc.NextInt;
for (int i = 0; i < N; i++)
{
var x = sc.GetLongArray(3);
var y = sc.GetLongArray(3);
if (IsKadomonmatsu(x))
{
wr.WriteLine("YES");
continue;
}
bool isLowUp = x[0] <= x[1] && x[1] <= x[2];
double high = 1e9, low = 0;
try
{
if (!Calc(x, y, high, isLowUp))
{
wr.WriteLine("NO");
continue;
}
while (high - low > 10)
{
var mid = (low + high) / 2;
if (Calc(x, y, mid, isLowUp))
{
high = mid;
}
else
{
low = mid;
}
}
while (low <= high)
{
Calc(x, y, low, isLowUp);
low += 0.01;
}
}
catch (Exception)
{
wr.WriteLine("YES");
continue;
}
wr.WriteLine("NO");
}
}
bool isReactive = false; // TODO: reactive check !!
}
}