結果
問題 | No.355 数当てゲーム(2) |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-04-01 23:15:57 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 95 ms / 2,000 ms |
コード長 | 7,055 bytes |
コンパイル時間 | 2,620 ms |
コンパイル使用メモリ | 110,768 KB |
実行使用メモリ | 41,344 KB |
平均クエリ数 | 27.37 |
最終ジャッジ日時 | 2023-09-23 23:25:59 |
合計ジャッジ時間 | 10,372 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 95 ms
38,768 KB |
testcase_01 | AC | 92 ms
39,064 KB |
testcase_02 | AC | 91 ms
38,516 KB |
testcase_03 | AC | 91 ms
39,064 KB |
testcase_04 | AC | 91 ms
39,300 KB |
testcase_05 | AC | 87 ms
38,904 KB |
testcase_06 | AC | 91 ms
38,616 KB |
testcase_07 | AC | 90 ms
39,032 KB |
testcase_08 | AC | 89 ms
38,784 KB |
testcase_09 | AC | 91 ms
39,020 KB |
testcase_10 | AC | 92 ms
39,100 KB |
testcase_11 | AC | 91 ms
39,060 KB |
testcase_12 | AC | 90 ms
38,356 KB |
testcase_13 | AC | 92 ms
38,708 KB |
testcase_14 | AC | 91 ms
38,904 KB |
testcase_15 | AC | 90 ms
39,056 KB |
testcase_16 | AC | 95 ms
38,964 KB |
testcase_17 | AC | 94 ms
38,520 KB |
testcase_18 | AC | 95 ms
39,152 KB |
testcase_19 | AC | 94 ms
38,836 KB |
testcase_20 | AC | 92 ms
41,040 KB |
testcase_21 | AC | 92 ms
41,344 KB |
testcase_22 | AC | 92 ms
39,056 KB |
testcase_23 | AC | 90 ms
38,392 KB |
testcase_24 | AC | 91 ms
38,556 KB |
testcase_25 | AC | 90 ms
39,048 KB |
testcase_26 | AC | 90 ms
38,884 KB |
testcase_27 | AC | 89 ms
39,180 KB |
testcase_28 | AC | 90 ms
41,160 KB |
testcase_29 | AC | 91 ms
41,076 KB |
testcase_30 | AC | 90 ms
38,980 KB |
testcase_31 | AC | 90 ms
39,068 KB |
testcase_32 | AC | 90 ms
39,200 KB |
testcase_33 | AC | 90 ms
38,824 KB |
testcase_34 | AC | 92 ms
38,944 KB |
testcase_35 | AC | 86 ms
38,820 KB |
testcase_36 | AC | 90 ms
38,924 KB |
testcase_37 | AC | 91 ms
39,140 KB |
testcase_38 | AC | 95 ms
38,440 KB |
testcase_39 | AC | 91 ms
40,968 KB |
testcase_40 | AC | 92 ms
38,648 KB |
testcase_41 | AC | 93 ms
39,072 KB |
testcase_42 | AC | 92 ms
38,592 KB |
testcase_43 | AC | 91 ms
36,572 KB |
testcase_44 | AC | 92 ms
40,528 KB |
testcase_45 | AC | 92 ms
38,396 KB |
testcase_46 | AC | 94 ms
39,144 KB |
testcase_47 | AC | 95 ms
39,184 KB |
testcase_48 | AC | 93 ms
38,840 KB |
testcase_49 | AC | 91 ms
39,040 KB |
testcase_50 | AC | 91 ms
38,388 KB |
testcase_51 | AC | 90 ms
40,444 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; using Number = System.Int64; namespace Program { //otaku ha saiko~ public class Solver { public void Solve() { var used = new HashSet<int>(); var cnt = new int[3]; { Console.WriteLine("0 1 2 3"); var res = Console.ReadLine().Split().Select(int.Parse).ToArray(); if (res[0] == 4) return; cnt[0] += res.Sum(); } { Console.WriteLine("4 5 6 7"); var res = Console.ReadLine().Split().Select(int.Parse).ToArray(); if (res[0] == 4) return; cnt[1] += res.Sum(); } int[] sugim48 = { 0, 0, 0, 0, 1, 1, 1, 1, 2, 2 }; for (int i = 0; i < 1 << 10; i++) { var use = new int[3]; var otaku = new List<int>(); for (int j = 0; j < 10; j++) { if ((i >> j & 1) == 1) { use[sugim48[j]]++; otaku.Add(j); } } if (otaku.Count != 4) continue; if (use[0] != cnt[0] || use[1] != cnt[1]) continue; Debug.WriteLine(otaku.AsJoinedString()); Console.WriteLine(otaku.AsJoinedString()); var res = Console.ReadLine().Split().Select(int.Parse).ToArray(); if (res[0] == 4) return; if (res.Sum() == 4) { var a = otaku.ToArray(); do { Console.WriteLine(a.AsJoinedString()); res = Console.ReadLine().Split().Select(int.Parse).ToArray(); if (res[0] == 4) return; } while (a.NextPermutation(0, 4)); } } } 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() { 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(s, 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 #region next_permutation static public partial class MathEx { static public bool NextPermutation<T>(this T[] array, int first, int last) where T : IComparable<T> { if (first == last) return false; var i = last; if (--i == first) return false; while (true) { var ii = i--; if (array[i].CompareTo(array[ii]) < 0) { var j = last; while (array[i].CompareTo(array[--j]) >= 0) { } var temp = array[i]; array[i] = array[j]; array[j] = temp; Array.Reverse(array, ii, last - ii); return true; } if (i == first) { Array.Reverse(array, first, last - first); return false; } } } } #endregion