結果
問題 | No.246 質問と回答 |
ユーザー | nokonoko |
提出日時 | 2015-07-18 07:30:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,551 bytes |
コンパイル時間 | 2,727 ms |
コンパイル使用メモリ | 116,784 KB |
実行使用メモリ | 45,496 KB |
平均クエリ数 | 65.57 |
最終ジャッジ日時 | 2024-07-16 07:11:37 |
合計ジャッジ時間 | 5,714 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 73 ms
41,500 KB |
testcase_02 | AC | 78 ms
41,888 KB |
testcase_03 | AC | 74 ms
41,116 KB |
testcase_04 | AC | 76 ms
41,736 KB |
testcase_05 | WA | - |
testcase_06 | AC | 74 ms
41,248 KB |
testcase_07 | AC | 75 ms
41,256 KB |
testcase_08 | AC | 75 ms
41,484 KB |
testcase_09 | AC | 72 ms
43,684 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 76 ms
41,372 KB |
testcase_13 | AC | 75 ms
41,224 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 74 ms
43,556 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 83 ms
41,252 KB |
testcase_20 | AC | 75 ms
43,660 KB |
testcase_21 | AC | 75 ms
42,896 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 74 ms
41,352 KB |
testcase_25 | AC | 74 ms
41,496 KB |
testcase_26 | WA | - |
testcase_27 | AC | 77 ms
41,888 KB |
testcase_28 | AC | 74 ms
39,576 KB |
testcase_29 | WA | - |
コンパイルメッセージ
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; class Program { static void Main() { long answer = 500000000; long nowRange = answer / 2; long qCount = 100; bool flag = false; while (nowRange > 0) { LIB.IO.W("? " + answer.ToString()); LIB.IO.WFLUSH(); if (LIB.IO.R<int>() == 1) { answer += nowRange; flag = true; } else { answer -= nowRange; flag = false; } nowRange >>= 1; qCount--; } if (flag == true) { answer += qCount / 2; } else { answer -= qCount / 2; } int direction = 0; bool first = false; for (int i = 0; i < qCount; i++) { LIB.IO.W("? " + answer.ToString()); LIB.IO.WFLUSH(); int nowDirection = LIB.IO.R<int>(); if (first == false) { first = true; direction = nowDirection; } if (nowDirection == 1) { answer++; } else { answer--; } if (nowDirection != direction) { break; } } LIB.IO.W("! " + answer.ToString()); LIB.IO.WFLUSH(); } } namespace LIB { public class IO { private const int WMAX = 1000; private static string WSTRING = ""; public static T R<T>() { return (T)(Convert.ChangeType(R(), typeof(T))); } public static T[] R<T>(char splitter = ' ') { return R().Split(splitter).Select(v => UTILITY.PARSE<T>(v)).ToArray(); } public static T[] R<T>(int length) { T[] ret = new T[length]; for (int i = 0; i < length; i++) { ret[i] = R<T>(); } return ret; } public static T[][] R<T>(int length, char splitter = ' ') { T[][] ret = new T[length][]; for (int i = 0; i < length; i++) { ret[i] = R<T>(splitter); } return ret; } private static string R() { return Console.ReadLine(); } public static void W(object value, bool addLineFeed = true) { WSTRING += UTILITY.PARSE<string>(value); if (addLineFeed == true) { WSTRING += "\n"; } if (WSTRING.Count() >= WMAX) { WFLUSH(); } } public static void WFLUSH() { Console.Write(WSTRING); WSTRING = ""; } } public class UTILITY { public static T PARSE<T>(object value) { return (T)(Convert.ChangeType(value, typeof(T))); } } public class MEMO<Key, Result> { private Dictionary<Key, Result> results; public MEMO() { results = new Dictionary<Key, Result>(); } public Result EXEC(Key key, Func<Key, Result> func) { Result ret = default(Result); if (results.ContainsKey(key)) { ret = results[key]; } else { ret = func(key); results.Add(key, ret); } return ret; } } }