結果

問題 No.402 最も海から遠い場所
ユーザー uwiuwi
提出日時 2016-07-23 01:04:16
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,472 bytes
コンパイル時間 4,114 ms
コンパイル使用メモリ 80,920 KB
実行使用メモリ 56,164 KB
最終ジャッジ日時 2024-11-06 14:08:25
合計ジャッジ時間 7,645 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,440 KB
testcase_01 AC 55 ms
50,204 KB
testcase_02 AC 58 ms
50,044 KB
testcase_03 AC 57 ms
50,140 KB
testcase_04 AC 56 ms
50,224 KB
testcase_05 AC 56 ms
50,196 KB
testcase_06 AC 57 ms
50,296 KB
testcase_07 RE -
testcase_08 AC 57 ms
50,256 KB
testcase_09 AC 56 ms
50,104 KB
testcase_10 RE -
testcase_11 AC 58 ms
50,284 KB
testcase_12 AC 57 ms
50,288 KB
testcase_13 AC 86 ms
51,108 KB
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 AC 240 ms
55,620 KB
testcase_18 AC 316 ms
55,456 KB
testcase_19 AC 307 ms
56,164 KB
testcase_20 AC 302 ms
55,704 KB
testcase_21 AC 301 ms
55,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package contest;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class N402X {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), m = ni();
int[] dp = new int[m+1];
int max = 0;
for(int i = 0;i < n;i++){
char[] row = ns().toCharArray();
int pre = 0;
for(int j = 0;j < n;j++){
if(row[j] == '#'){
int min = pre;
if(j > 0)min = Math.min(min, dp[j-1]);
min = Math.min(min, dp[j]);
pre = dp[j];
dp[j] = min+1;
max = Math.max(max, min+1);
}else{
pre = dp[j];
dp[j] = 0;
}
}
}
out.println((max+1)/2);
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new N402X().run(); }
private byte[] inbuf = new byte[1024];
private int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0