結果
| 問題 | No.707 書道 |
| ユーザー |
 holeguma
|
| 提出日時 | 2019-07-17 20:39:16 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 116 ms / 2,000 ms |
| コード長 | 4,069 bytes |
| コンパイル時間 | 2,867 ms |
| コンパイル使用メモリ | 79,568 KB |
| 実行使用メモリ | 39,148 KB |
| 最終ジャッジ日時 | 2024-12-23 07:15:19 |
| 合計ジャッジ時間 | 4,294 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 6 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.NoSuchElementException;public class Main {static PrintWriter out;static InputReader ir;static void solve() {int h = ir.nextInt();int w = ir.nextInt();char[][] map = ir.nextCharMap(h, w);ArrayList<Integer> l = new ArrayList<>();for (int i = 0; i < h; i++) {for (int j = 0; j < w; j++) {if (map[i][j] == '1') {l.add((i + 1) << 10 | (j + 1));}}}double mi = 1e18;for (int i = 1; i <= h; i++) {double d = 0;for (int x : l) {int u = x >> 10;int v = x & ((1 << 10) - 1);d += Math.hypot(u - i, v);}mi = Math.min(mi, d);d = 0;for (int x : l) {int u = x >> 10;int v = x & ((1 << 10) - 1);d += Math.hypot(u - i, w + 1 - v);}mi = Math.min(mi, d);}for (int i = 1; i <= w; i++) {double d = 0;for (int x : l) {int u = x >> 10;int v = x & ((1 << 10) - 1);d += Math.hypot(u, v - i);}mi = Math.min(mi, d);d = 0;for (int x : l) {int u = x >> 10;int v = x & ((1 << 10) - 1);d += Math.hypot(h + 1 - u, v - i);}mi = Math.min(mi, d);}out.println(mi);}public static void main(String[] args) {ir = new InputReader(System.in);out = new PrintWriter(System.out);solve();out.flush();}static class InputReader {private InputStream in;private byte[] buffer = new byte[1024];private int curbuf;private int lenbuf;public InputReader(InputStream in) {this.in = in;this.curbuf = this.lenbuf = 0;}public boolean hasNextByte() {if (curbuf >= lenbuf) {curbuf = 0;try {lenbuf = in.read(buffer);} catch (IOException e) {throw new InputMismatchException();}if (lenbuf <= 0)return false;}return true;}private int readByte() {if (hasNextByte())return buffer[curbuf++];elsereturn -1;}private boolean isSpaceChar(int c) {return !(c >= 33 && c <= 126);}private void skip() {while (hasNextByte() && isSpaceChar(buffer[curbuf]))curbuf++;}public boolean hasNext() {skip();return hasNextByte();}public String next() {if (!hasNext())throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while (!isSpaceChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public int nextInt() {if (!hasNext())throw new NoSuchElementException();int c = readByte();while (isSpaceChar(c))c = readByte();boolean minus = false;if (c == '-') {minus = true;c = readByte();}int res = 0;do {if (c < '0' || c > '9')throw new InputMismatchException();res = res * 10 + c - '0';c = readByte();} while (!isSpaceChar(c));return (minus) ? -res : res;}public long nextLong() {if (!hasNext())throw new NoSuchElementException();int c = readByte();while (isSpaceChar(c))c = readByte();boolean minus = false;if (c == '-') {minus = true;c = readByte();}long res = 0;do {if (c < '0' || c > '9')throw new InputMismatchException();res = res * 10 + c - '0';c = readByte();} while (!isSpaceChar(c));return (minus) ? -res : res;}public double nextDouble() {return Double.parseDouble(next());}public int[] nextIntArray(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = nextInt();return a;}public long[] nextLongArray(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nextLong();return a;}public char[][] nextCharMap(int n, int m) {char[][] map = new char[n][m];for (int i = 0; i < n; i++)map[i] = next().toCharArray();return map;}}static void tr(Object... o) {out.println(Arrays.deepToString(o));}}