結果
問題 | No.452 横着者のビンゴゲーム |
ユーザー | eitaho |
提出日時 | 2016-12-03 10:10:50 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,748 ms / 3,000 ms |
コード長 | 3,529 bytes |
コンパイル時間 | 1,285 ms |
コンパイル使用メモリ | 116,688 KB |
実行使用メモリ | 24,832 KB |
最終ジャッジ日時 | 2024-05-06 14:56:25 |
合計ジャッジ時間 | 17,641 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
20,096 KB |
testcase_01 | AC | 35 ms
20,096 KB |
testcase_02 | AC | 35 ms
20,224 KB |
testcase_03 | AC | 39 ms
20,608 KB |
testcase_04 | AC | 35 ms
20,224 KB |
testcase_05 | AC | 39 ms
20,352 KB |
testcase_06 | AC | 34 ms
20,096 KB |
testcase_07 | AC | 35 ms
20,352 KB |
testcase_08 | AC | 37 ms
20,480 KB |
testcase_09 | AC | 34 ms
20,224 KB |
testcase_10 | AC | 35 ms
20,224 KB |
testcase_11 | AC | 37 ms
20,224 KB |
testcase_12 | AC | 35 ms
20,480 KB |
testcase_13 | AC | 35 ms
20,224 KB |
testcase_14 | AC | 1,036 ms
24,832 KB |
testcase_15 | AC | 998 ms
24,064 KB |
testcase_16 | AC | 688 ms
23,936 KB |
testcase_17 | AC | 111 ms
20,352 KB |
testcase_18 | AC | 192 ms
20,992 KB |
testcase_19 | AC | 165 ms
20,352 KB |
testcase_20 | AC | 132 ms
20,608 KB |
testcase_21 | AC | 364 ms
22,656 KB |
testcase_22 | AC | 125 ms
20,224 KB |
testcase_23 | AC | 708 ms
23,040 KB |
testcase_24 | AC | 89 ms
20,352 KB |
testcase_25 | AC | 73 ms
20,224 KB |
testcase_26 | AC | 489 ms
21,888 KB |
testcase_27 | AC | 351 ms
21,120 KB |
testcase_28 | AC | 219 ms
21,248 KB |
testcase_29 | AC | 156 ms
20,736 KB |
testcase_30 | AC | 460 ms
22,656 KB |
testcase_31 | AC | 117 ms
20,480 KB |
testcase_32 | AC | 98 ms
20,352 KB |
testcase_33 | AC | 261 ms
21,120 KB |
testcase_34 | AC | 244 ms
20,736 KB |
testcase_35 | AC | 206 ms
20,608 KB |
testcase_36 | AC | 86 ms
20,352 KB |
testcase_37 | AC | 74 ms
20,736 KB |
testcase_38 | AC | 1,748 ms
24,192 KB |
testcase_39 | AC | 1,054 ms
23,424 KB |
testcase_40 | AC | 1,050 ms
23,680 KB |
testcase_41 | AC | 1,056 ms
23,680 KB |
testcase_42 | AC | 1,051 ms
23,680 KB |
testcase_43 | AC | 1,054 ms
23,552 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.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)); // →, ↓, ↘, ↗ var SR = Enu.Range(0, size).Concat(new int[size]).Concat(new[] { 0, size - 1 }).ToArray(); var SC = new int[size].Concat(Enu.Range(0, size)).Concat(new int[2]).ToArray(); var DR = new int[size].Concat(Enu.Repeat(1, size)).Concat(new[] { 1, -1 }).ToArray(); var DC = Enu.Repeat(1, size).Concat(new int[size]).Concat(new[] { 1, 1 }).ToArray(); int ans = int.MaxValue; for (int who = 0; who < N; who++) for (int dir = 0; dir < SR.Length; dir++) { var set = new HashSet<int>(); for (int i = 0, r = SR[dir], c = SC[dir]; i < size; i++, r += DR[dir], c += DC[dir]) set.Add(table[who][r][c]); for (int other = 0; other < N; other++) if (who != other) for (int dir2 = 0; dir2 < SR.Length; dir2++) { int count = 0; for (int i = 0, r = SR[dir2], c = SC[dir2]; i < size; i++, r += DR[dir2], c += DC[dir2]) if (!set.Contains(table[other][r][c])) count++; ans = Math.Min(ans, size + count - 1); } } 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; } }