結果
| 問題 | No.594 壊れた宝物発見機 |
| ユーザー |
 sekiya9311
|
| 提出日時 | 2017-11-10 23:35:16 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 10,801 bytes |
| コンパイル時間 | 3,374 ms |
| コンパイル使用メモリ | 118,976 KB |
| 実行使用メモリ | 59,492 KB |
| 最終ジャッジ日時 | 2024-07-16 15:29:31 |
| 合計ジャッジ時間 | 9,368 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| 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.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ProgrammingContest
{
class MainClass : IDisposable
{
Scanner sc;
Writer wr;
string backPath = "..";
char dirSep = System.IO.Path.DirectorySeparatorChar;
string inFilePath = null;
string outFilePath = null;
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";
}
static void Main(string[] args)
{
using (var mainClass = new MainClass())
{
//mainClass.MakeTestCase();
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();
this.wr = new Writer(inFilePath);
}
void Solve()
{
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
List<State> list = new List<State>();
for (int i = 0; i < (1 << 3); i++)
{
int x = (i & (1)) != 0 ? 100 : -100;
int y = (i & (1 << 1)) != 0 ? 100 : -100;
int z = (i & (1 << 2)) != 0 ? 100 : -100;
list.Add(new State(x, y, z, Ask(x, y, z)));
}
list.Sort();
State best = list[0];
list.Clear();
for (int i = 0; i < (1 << 3); i++)
{
int x = (i & (1)) != 0 ? best.x : 0;
int y = (i & (1 << 1)) != 0 ? best.y : 0;
int z = (i & (1 << 2)) != 0 ? best.z : 0;
list.Add(new State(x, y, z, Ask(x, y, z)));
}
list.Sort();
State best2 = list[0];
list.Clear();
for (int i = 0; i < 51; i++)
{
//x
if (best2.x == 100)
{
list.Add(new State(best2.x - i, best2.y, best2.z, Ask(best2.x - i, best2.y, best2.z)));
}
else if (best2.x == -100)
{
list.Add(new State(best2.x + i, best2.y, best2.z, Ask(best2.x + i, best2.y, best2.z)));
}
else if (best2.x == 0)
{
if (best.x == 100)
{
list.Add(new State(best2.x + i, best2.y, best2.z, Ask(best2.x + i, best2.y, best2.z)));
}
else if (best.x == -100)
{
list.Add(new State(best2.x - i, best2.y, best2.z, Ask(best2.x - i, best2.y, best2.z)));
}
}
}
list.Sort();
State bestX = list[0];
list.Clear();
for (int i = 0; i < 51; i++)
{
//y
if (best2.y == 100)
{
list.Add(new State(bestX.x, best2.y - i, best2.z, Ask(bestX.x, best2.y - i, best2.z)));
}
else if (best2.y == -100)
{
list.Add(new State(bestX.x, best2.y + i, best2.z, Ask(bestX.x, best2.y + i, best2.z)));
}
else if (best2.y == 0)
{
if (best.y == 100)
{
list.Add(new State(bestX.x, best2.y + i, best2.z, Ask(bestX.x, best2.y + i, best2.z)));
}
else if (best.y == -100)
{
list.Add(new State(bestX.x, best2.y - i, best2.z, Ask(bestX.x, best2.y - i, best2.z)));
}
}
}
list.Sort();
State bestXY = list[0];
list.Clear();
for (int i = 0; i < 51; i++)
{
//z
if (best2.z == 100)
{
list.Add(new State(bestXY.x, bestXY.y, best2.z - i, Ask(bestXY.x, bestXY.y, best2.z - i)));
}
else if (best2.y == -100)
{
list.Add(new State(bestXY.x, bestXY.y, best2.z + i, Ask(bestXY.x, bestXY.y, best2.z + i)));
}
else if (best2.y == 0)
{
if (best.y == 100)
{
list.Add(new State(bestXY.x, bestXY.y, best2.z + i, Ask(bestXY.x, bestXY.y, best2.z + i)));
}
else if (best.y == -100)
{
list.Add(new State(bestXY.x, bestXY.y, best2.z - i, Ask(bestXY.x, bestXY.y, best2.z - i)));
}
}
}
list.Sort();
State bestXYZ = list[0];
Answer(bestXYZ.x, bestXYZ.y, bestXYZ.z);
}
struct State : IComparable<State>
{
public int x, y, z;
public int dist;
public State(int x, int y, int z, int dist)
{
this.x = x;
this.y = y;
this.z = z;
this.dist = dist;
}
public int CompareTo(State other)
{
return this.dist - other.dist;
}
}
int Ask(int x, int y, int z)
{
wr.WriteLine("? " + x.ToString() + " " + y.ToString() + " " + z.ToString());
return sc.NextInt;
}
void Answer(int x, int y, int z)
{
wr.WriteLine("! " + x.ToString() + " " + y.ToString() + " " + z.ToString());
}
bool isReactive = false; // TODO: reactive check !!
void hoge()
{
string N = sc.Next;
string ans = Div3(N) ? "Fizz" : string.Empty;
ans += Div5(N) ? "Buzz" : string.Empty;
wr.WriteLine(string.IsNullOrEmpty(ans) ? N : ans);
}
bool Div5(string N)
{
int mod = 0;
for (int i = 0; i < N.Length; i++)
{
if (i % 2 == 0) mod += N[i] - '0';
else mod -= N[i] - '0';
}
return Math.Abs(mod) % 11 == 0;
}
bool Div3(string N)
{
int mod = 0;
for (int i = 0; i < N.Length; i++)
{
mod += N[i] - '0';
}
return mod % 3 == 0;
}
}
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)
{
this.Write(val.ToString() + System.Environment.NewLine);
}
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) : this(new System.IO.StreamReader(path))
{
}
public Scanner(System.IO.TextReader reader = null)
{
this.buffer = new Queue<string>();
this.sep = new char[] { ' ' };
this.reader = (reader ?? Console.In);
}
private void CheckBuffer()
{
if (this.buffer.Count == 0)
{
string str = string.Empty;
while (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 int NextInt
{
get
{
return int.Parse(this.Next);
}
}
public double NextDouble
{
get
{
return double.Parse(this.Next);
}
}
public long NextLong
{
get
{
return long.Parse(this.Next);
}
}
public bool IsEnd
{
get
{
this.CheckBuffer();
return this.buffer.Count == 0;
}
}
}
}