結果
問題 | No.452 横着者のビンゴゲーム |
ユーザー |
![]() |
提出日時 | 2016-12-04 14:10:50 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 57 ms / 3,000 ms |
コード長 | 3,787 bytes |
コンパイル時間 | 2,306 ms |
コンパイル使用メモリ | 117,172 KB |
実行使用メモリ | 23,936 KB |
最終ジャッジ日時 | 2024-11-29 00:07:05 |
合計ジャッジ時間 | 4,841 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.IO;using System.Linq;using System.Text;using System.Text.RegularExpressions;using System.Collections.Generic;using System.Diagnostics;using System.Numerics;using Enu = System.Linq.Enumerable;public class Program{public void Solve(){int size = Reader.Int(), N = Reader.Int();var table = Reader.Range(N, () => Reader.IntTable(size));int K = size * 2 + 2;var set = new int[N][][];var has = new List<int>[N * size * size + 1];var count = new int[N * K];for (int i = 0; i < has.Length; i++) has[i] = new List<int>();for (int who = 0; who < N; who++){int offset = K * who;var grid = table[who];set[who] = new int[K][];for (int i = 0; i < K; i++) set[who][i] = new int[size];Action<int, int, int> Add = (type, i, num) =>{set[who][type][i] = num;has[num].Add(offset + type);};for (int a = 0; a < size; a++){for (int b = 0; b < size; b++){Add(a, b, grid[a][b]);Add(size + a, b, grid[b][a]);}Add(K - 2, a, grid[a][a]);Add(K - 1, a, grid[a][size - 1 - a]);}}int ans = size * 2 - 1;var seen = new int[size * N * 4];for (int who = 0; who < N; who++)foreach (var s in set[who]){int ni = 0;foreach (int num in s)foreach (int other in has[num])if (other / K != who){seen[ni++] = other;ans = Math.Min(ans, size * 2 - 1 - ++count[other]);}for (int i = 0; i < ni; i++) count[seen[i]] = 0;}Console.WriteLine(ans);}}class Entry { static void Main() { new Program().Solve(); } }class Reader{static TextReader reader = Console.In;static readonly char[] separator = { ' ' };static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;static string[] A = new string[0];static int i;static void Init() { A = new string[0]; }public static void Set(TextReader r) { reader = r; Init(); }public static void Set(string file) { reader = new StreamReader(file); Init(); }public static bool HasNext() { return CheckNext(); }public static string String() { return Next(); }public static int Int() { return int.Parse(Next()); }public static long Long() { return long.Parse(Next()); }public static double Double() { return double.Parse(Next()); }public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }public static int[] IntArray(int N) { return Range(N, Int); }public static int[][] IntTable(int H) { return Range(H, IntLine); }public static string[] StringArray(int N) { return Range(N, Next); }public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }public static string Line() { return reader.ReadLine().Trim(); }public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }static string[] Split(string s) { return s.Split(separator, op); }static string Next() { CheckNext(); return A[i++]; }static bool CheckNext(){if (i < A.Length) return true;string line = reader.ReadLine();if (line == null) return false;if (line == "") return CheckNext();A = Split(line);i = 0;return true;}}