結果
問題 | No.402 最も海から遠い場所 |
ユーザー |
![]() |
提出日時 | 2016-07-22 23:16:45 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,133 ms / 3,000 ms |
コード長 | 6,663 bytes |
コンパイル時間 | 2,795 ms |
コンパイル使用メモリ | 111,568 KB |
実行使用メモリ | 88,256 KB |
最終ジャッジ日時 | 2023-08-06 10:10:47 |
合計ジャッジ時間 | 9,614 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
21,936 KB |
testcase_01 | AC | 60 ms
23,860 KB |
testcase_02 | AC | 61 ms
19,768 KB |
testcase_03 | AC | 61 ms
21,904 KB |
testcase_04 | AC | 60 ms
21,848 KB |
testcase_05 | AC | 59 ms
19,924 KB |
testcase_06 | AC | 60 ms
21,844 KB |
testcase_07 | AC | 60 ms
21,852 KB |
testcase_08 | AC | 61 ms
21,860 KB |
testcase_09 | AC | 60 ms
21,892 KB |
testcase_10 | AC | 60 ms
23,824 KB |
testcase_11 | AC | 63 ms
24,092 KB |
testcase_12 | AC | 60 ms
20,048 KB |
testcase_13 | AC | 64 ms
22,092 KB |
testcase_14 | AC | 63 ms
24,048 KB |
testcase_15 | AC | 82 ms
23,096 KB |
testcase_16 | AC | 93 ms
25,080 KB |
testcase_17 | AC | 563 ms
59,764 KB |
testcase_18 | AC | 994 ms
84,184 KB |
testcase_19 | AC | 1,133 ms
84,128 KB |
testcase_20 | AC | 270 ms
84,232 KB |
testcase_21 | AC | 1,126 ms
88,256 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.Collections.Generic; using System.Linq; using System.IO; class Program { const int M = 1000000007; const double eps = 1e-9; static int[] dd = { 0, 1, 0, -1, 0 }; static int[][] count; static void Main() { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var sc = new Scan(); int h, w; sc.Multi(out h, out w); var s = new string[h]; count = new int[h + 1][]; for (int i = 0; i < h + 1; i++) { count[i] = new int[w + 1]; } for (int i = 0; i < h; i++) { s[i] = sc.Str; for (int j = 0; j < w; j++) { if (s[i][j] == '.') { count[i + 1][j + 1] = 1; } // Console.WriteLine("{0} {1}", i, j); } } for (int i = 0; i < h + 1; i++) { for (int j = 0; j < w; j++) { count[i][j + 1] += count[i][j]; } } for (int i = 0; i < h; i++) { for (int j = 0; j < w + 1; j++) { count[i + 1][j] += count[i][j]; } } int ok = 0, ng = h + w; while (ok + 1 < ng) { int m = (ok + ng) / 2; for (int i = m; i < h - m; i++) { for (int j = m; j < w - m; j++) { if (!exist(i, j, m)) goto A; } } ng = m; continue; A: ok = m; } sw.WriteLine(ok + 1); sw.Flush(); } static bool exist(int i, int j, int d) { return count[i + d + 1][j + d + 1] - count[i + d + 1][j - d] - count[i - d][j + d + 1] + count[i - d][j - d] > 0; } 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(Str); } } public long Long { get { return long.Parse(Str); } } public double Double { get { return double.Parse(Str); } } public string Str { get { return Console.ReadLine().Trim(); } } public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } } public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); } public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } } public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } } public string[] StrArr { get { return Str.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 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 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(long a, long b) { return a * (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; } }