#111749 (C#(csc)) No.355 数当てゲーム(2)

提出ソース

結果

問題	No.355 数当てゲーム(2)
ユーザー	りあん
提出日時	2016-08-20 09:08:33
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	72 ms / 2,000 ms
コード長	8,657 bytes
コンパイル時間	1,121 ms
コンパイル使用メモリ	116,660 KB
実行使用メモリ	46,936 KB
平均クエリ数	22.90
最終ジャッジ日時	2024-07-17 00:19:45
合計ジャッジ時間	7,834 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	72 ms 42,776 KB
testcase_01	AC	61 ms 43,192 KB
testcase_02	AC	60 ms 43,028 KB
testcase_03	AC	60 ms 44,556 KB
testcase_04	AC	60 ms 43,024 KB
testcase_05	AC	60 ms 43,092 KB
testcase_06	AC	61 ms 42,896 KB
testcase_07	AC	63 ms 42,392 KB
testcase_08	AC	61 ms 42,648 KB
testcase_09	AC	61 ms 44,556 KB
testcase_10	AC	61 ms 42,896 KB
testcase_11	AC	60 ms 41,100 KB
testcase_12	AC	61 ms 42,388 KB
testcase_13	AC	60 ms 42,764 KB
testcase_14	AC	61 ms 44,756 KB
testcase_15	AC	61 ms 44,772 KB
testcase_16	AC	60 ms 42,896 KB
testcase_17	AC	60 ms 42,388 KB
testcase_18	AC	61 ms 43,028 KB
testcase_19	AC	63 ms 42,640 KB
testcase_20	AC	60 ms 43,160 KB
testcase_21	AC	60 ms 44,684 KB
testcase_22	AC	63 ms 42,468 KB
testcase_23	AC	61 ms 42,520 KB
testcase_24	AC	61 ms 42,760 KB
testcase_25	AC	61 ms 44,772 KB
testcase_26	AC	62 ms 42,648 KB
testcase_27	AC	64 ms 42,324 KB
testcase_28	AC	62 ms 44,944 KB
testcase_29	AC	61 ms 40,716 KB
testcase_30	AC	60 ms 45,020 KB
testcase_31	AC	62 ms 42,772 KB
testcase_32	AC	62 ms 42,776 KB
testcase_33	AC	65 ms 44,936 KB
testcase_34	AC	60 ms 42,844 KB
testcase_35	AC	59 ms 43,032 KB
testcase_36	AC	64 ms 42,656 KB
testcase_37	AC	61 ms 44,784 KB
testcase_38	AC	60 ms 40,384 KB
testcase_39	AC	61 ms 43,424 KB
testcase_40	AC	63 ms 44,640 KB
testcase_41	AC	61 ms 44,784 KB
testcase_42	AC	62 ms 42,840 KB
testcase_43	AC	62 ms 42,864 KB
testcase_44	AC	64 ms 44,772 KB
testcase_45	AC	61 ms 44,492 KB
testcase_46	AC	62 ms 46,936 KB
testcase_47	AC	61 ms 42,636 KB
testcase_48	AC	61 ms 42,832 KB
testcase_49	AC	62 ms 42,892 KB
testcase_50	AC	61 ms 45,016 KB
testcase_51	AC	63 ms 42,248 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        var unc = new Queue<int>();
        var ans = new List<int>();
        var noans = new List<int>();
        var r = new Random();
        for (int i = 0; i < 10; i++)
        {
            unc.Enqueue(i);
        }
        while (true)
        {
            if (ans.Count == 4 || noans.Count == 6)
                break;
            
            var a = new int[4];
            for (int i = 0; i < 4 - ans.Count; i++)
            {
                a[i] = unc.Dequeue();
            }
            for (int i = 4 - ans.Count; i < 4; i++)
            {
                a[i] = ans[3 - i];
            }
            Console.WriteLine(string.Join(" ", a));
            var ar = sc.IntArr;
            if (ar[0] == 4) return;
            
            int p = ar[0] + ar[1];
            if (p == 4)
            {
                ans = new List<int>();
                for (int i = 0; i < 4; i++)
                {
                    ans.Add(a[i]);
                }
                break;
            }
            int b = unc.Dequeue();
            int ind = r.Next(4 - ans.Count);
            var tt = a[ind];
            a[ind] = b;
            b = tt;
            Console.WriteLine(string.Join(" ", a));
            ar = sc.IntArr;
            if (ar[0] == 4) return;
            
            int q = ar[0] + ar[1];
            if (q == 4)
            {
                ans = new List<int>();
                for (int i = 0; i < 4; i++)
                {
                    ans.Add(a[i]);
                }
                break;
            }
            if (p < q)
            {
                for (int i = 0; i < 4 - ans.Count; i++)
                {
                    if (i == ind) continue;
                    
                    unc.Enqueue(a[i]);
                }
                ans.Add(a[ind]);
                noans.Add(b);
            }
            else if (p > q)
            {
                for (int i = 0; i < 4 - ans.Count; i++)
                {
                    if (i == ind) continue;
                    
                    unc.Enqueue(a[i]);
                }
                ans.Add(b);
                noans.Add(a[ind]);
            }
            else
            {
                for (int i = 0; i < 4 - ans.Count; i++)
                    unc.Enqueue(a[i]);

                unc.Enqueue(b);
            }
        }
        if (ans.Count < 4)
        {
            while (unc.Any())
            {
                ans.Add(unc.Dequeue());
            }
        }
        var outp = new int[4];
        for (int i = 0; i < 4; i++)
        {
            outp[0] = ans[i];
            for (int j = 0; j < 4; j++)
            {
                if (i == j) continue;
                
                outp[1] = ans[j];
                for (int k = 0; k < 4; k++)
                {
                    if (i == k || j == k) continue;
                    
                    outp[2] = ans[k];
                    outp[3] = ans[6 - i - j - k];
                    Console.WriteLine(string.Join(" ", outp));
                    if (sc.Str[0] == '4') return;
                }
            }
        }
        sw.Flush();
    }
    
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
    public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード