結果

問題 No.452 横着者のビンゴゲーム
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-23 02:15:11
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,331 ms / 3,000 ms
コード長 6,345 bytes
コンパイル時間 2,588 ms
コンパイル使用メモリ 115,412 KB
実行使用メモリ 22,712 KB
最終ジャッジ日時 2023-08-21 05:49:38
合計ジャッジ時間 25,465 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
20,416 KB
testcase_01 AC 54 ms
20,548 KB
testcase_02 AC 55 ms
22,540 KB
testcase_03 AC 58 ms
20,760 KB
testcase_04 AC 55 ms
20,464 KB
testcase_05 AC 60 ms
22,712 KB
testcase_06 AC 54 ms
18,632 KB
testcase_07 AC 56 ms
20,500 KB
testcase_08 AC 56 ms
20,624 KB
testcase_09 AC 55 ms
22,640 KB
testcase_10 AC 55 ms
20,636 KB
testcase_11 AC 56 ms
20,484 KB
testcase_12 AC 54 ms
20,496 KB
testcase_13 AC 55 ms
20,484 KB
testcase_14 AC 2,331 ms
22,552 KB
testcase_15 AC 2,049 ms
20,476 KB
testcase_16 AC 1,165 ms
20,572 KB
testcase_17 AC 142 ms
18,428 KB
testcase_18 AC 234 ms
20,564 KB
testcase_19 AC 168 ms
18,420 KB
testcase_20 AC 147 ms
22,532 KB
testcase_21 AC 498 ms
20,496 KB
testcase_22 AC 134 ms
22,596 KB
testcase_23 AC 871 ms
22,600 KB
testcase_24 AC 115 ms
18,584 KB
testcase_25 AC 88 ms
20,496 KB
testcase_26 AC 516 ms
22,532 KB
testcase_27 AC 363 ms
20,620 KB
testcase_28 AC 247 ms
20,636 KB
testcase_29 AC 172 ms
20,632 KB
testcase_30 AC 625 ms
20,628 KB
testcase_31 AC 134 ms
20,480 KB
testcase_32 AC 111 ms
18,720 KB
testcase_33 AC 279 ms
20,492 KB
testcase_34 AC 248 ms
20,452 KB
testcase_35 AC 209 ms
22,544 KB
testcase_36 AC 99 ms
20,480 KB
testcase_37 AC 99 ms
22,540 KB
testcase_38 AC 2,207 ms
18,572 KB
testcase_39 AC 1,356 ms
22,604 KB
testcase_40 AC 1,378 ms
20,420 KB
testcase_41 AC 1,356 ms
20,628 KB
testcase_42 AC 1,371 ms
20,744 KB
testcase_43 AC 1,380 ms
20,472 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

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
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var m = sc.Integer();
            var a = Enumerate(m, x => new int[n][]);
            for (int i = 0; i < m; i++)
                for (int j = 0; j < n; j++)
                    a[i][j] = sc.Integer(n);
            var s = Enumerate(m, x => new List<List<int>>());
            for (int i = 0; i < m; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    var x = new List<int>();
                    for (int k = 0; k < n; k++)
                        x.Add(a[i][j][k]);
                    x.Sort();
                    s[i].Add(x);
                }
                for (int j = 0; j < n; j++)
                {
                    var x = new List<int>();
                    for (int k = 0; k < n; k++)
                        x.Add(a[i][k][j]);
                    x.Sort();
                    s[i].Add(x);
                }
                {
                    var x = new List<int>();
                    for (int k = 0; k < n; k++)
                        x.Add(a[i][k][k]);
                    x.Sort();
                    s[i].Add(x);
                }
                {
                    var x = new List<int>();
                    for (int k = 0; k < n; k++)
                        x.Add(a[i][k][n - k - 1]);
                    x.Sort();
                    s[i].Add(x);
                }
            }
            var min = 114514;
            for (int i = 0; i < m; i++)
                for (int j = i + 1; j < m; j++)
                {
                    foreach (var x in s[i])
                    {
                        foreach (var y in s[j])
                        {
                            var cnt = 2 * n;
                            foreach (var z in y) if (x.BinarySearch(z) >= 0) cnt--;
                            min = Math.Min(min, cnt);
                        }
                    }

                }
            IO.Printer.Out.WriteLine(min - 1);

        }
        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

0