結果
問題 | No.455 冬の大三角 |
ユーザー |
![]() |
提出日時 | 2016-12-26 15:52:44 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 3,400 bytes |
コンパイル時間 | 2,424 ms |
コンパイル使用メモリ | 77,596 KB |
実行使用メモリ | 37,216 KB |
最終ジャッジ日時 | 2024-06-29 21:59:31 |
合計ジャッジ時間 | 7,679 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 54 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.util.NoSuchElementException;public class Main {public static void main(String[] args) {FastScanner sc = new FastScanner();int H = sc.nextInt();int W = sc.nextInt();int ptr = 0;int[][] star = new int[2][2];char[][] sky = new char[H][];for (int i = 0; i < H; i ++) {sky[i] = sc.next().toCharArray();for (int j = 0; j < W; j ++) {if (sky[i][j] == '*') {star[ptr ++] = new int[]{i, j};}}}if (star[0][1] != star[1][1]) {if (star[0][0] != H - 1) {sky[H - 1][star[0][1]] = '*';} else {sky[0][star[0][1]] = '*';}} else {if (star[0][1] != W - 1) {sky[star[0][0]][W - 1] = '*';} else {sky[star[0][0]][0] = '*';}}StringBuilder sb = new StringBuilder();for (int i = 0; i < H; i ++) {sb.append(sky[i]);sb.append("\n");}System.out.println(sb);}}class FastScanner {public static String debug = null;private final InputStream in = System.in;private int ptr = 0;private int buflen = 0;private byte[] buffer = new byte[1024];private boolean eos = false;private boolean hasNextByte() {if (ptr < buflen) {return true;} else {ptr = 0;try {if (debug != null) {buflen = debug.length();buffer = debug.getBytes();debug = "";eos = true;} else {buflen = in.read(buffer);}} catch (IOException e) {e.printStackTrace();}if (buflen < 0) {eos = true;return false;} else if (buflen == 0) {return false;}}return true;}private int readByte() {if (hasNextByte())return buffer[ptr++];elsereturn -1;}private static boolean isPrintableChar(int c) {return 33 <= c && c <= 126;}private void skipUnprintable() {while (hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;}public boolean isEOS() {return this.eos;}public boolean hasNext() {skipUnprintable();return hasNextByte();}public String next() {if (!hasNext())throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while (isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext())throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while (true) {if ('0' <= b && b <= '9') {n *= 10;n += b - '0';} else if (b == -1 || !isPrintableChar(b)) {return minus ? -n : n;} else {throw new NumberFormatException();}b = readByte();}}public int nextInt() {return (int) nextLong();}public long[] nextLongList(int n) {return nextLongTable(1, n)[0];}public int[] nextIntList(int n) {return nextIntTable(1, n)[0];}public long[][] nextLongTable(int n, int m) {long[][] ret = new long[n][m];for (int i = 0; i < n; i ++) {for (int j = 0; j < m; j ++) {ret[i][j] = nextLong();}}return ret;}public int[][] nextIntTable(int n, int m) {int[][] ret = new int[n][m];for (int i = 0; i < n; i ++) {for (int j = 0; j < m; j ++) {ret[i][j] = nextInt();}}return ret;}}