結果
問題 | No.455 冬の大三角 |
ユーザー | yuya178 |
提出日時 | 2017-11-14 17:36:30 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,740 bytes |
コンパイル時間 | 2,310 ms |
コンパイル使用メモリ | 82,556 KB |
実行使用メモリ | 52,216 KB |
最終ジャッジ日時 | 2024-11-25 02:08:58 |
合計ジャッジ時間 | 7,461 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,244 KB |
testcase_01 | AC | 49 ms
50,132 KB |
testcase_02 | AC | 49 ms
50,368 KB |
testcase_03 | AC | 51 ms
50,176 KB |
testcase_04 | AC | 49 ms
50,316 KB |
testcase_05 | AC | 48 ms
49,780 KB |
testcase_06 | WA | - |
testcase_07 | AC | 48 ms
49,940 KB |
testcase_08 | AC | 71 ms
50,904 KB |
testcase_09 | AC | 50 ms
50,000 KB |
testcase_10 | WA | - |
testcase_11 | AC | 49 ms
50,096 KB |
testcase_12 | AC | 53 ms
50,316 KB |
testcase_13 | AC | 51 ms
50,376 KB |
testcase_14 | AC | 50 ms
50,200 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 48 ms
49,848 KB |
testcase_18 | AC | 48 ms
50,280 KB |
testcase_19 | AC | 49 ms
49,992 KB |
testcase_20 | AC | 49 ms
50,212 KB |
testcase_21 | AC | 47 ms
49,972 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 47 ms
50,088 KB |
testcase_25 | AC | 49 ms
50,296 KB |
testcase_26 | AC | 48 ms
50,308 KB |
testcase_27 | AC | 51 ms
50,024 KB |
testcase_28 | AC | 50 ms
50,144 KB |
testcase_29 | AC | 60 ms
49,992 KB |
testcase_30 | AC | 58 ms
50,372 KB |
testcase_31 | AC | 54 ms
50,236 KB |
testcase_32 | AC | 56 ms
50,208 KB |
testcase_33 | AC | 70 ms
50,340 KB |
testcase_34 | AC | 48 ms
49,836 KB |
testcase_35 | AC | 56 ms
50,192 KB |
testcase_36 | AC | 53 ms
50,208 KB |
testcase_37 | AC | 53 ms
50,216 KB |
testcase_38 | AC | 51 ms
50,220 KB |
testcase_39 | AC | 69 ms
50,356 KB |
testcase_40 | AC | 57 ms
50,244 KB |
testcase_41 | AC | 54 ms
50,408 KB |
testcase_42 | AC | 52 ms
50,252 KB |
testcase_43 | AC | 51 ms
50,000 KB |
testcase_44 | AC | 57 ms
49,920 KB |
testcase_45 | AC | 59 ms
49,888 KB |
testcase_46 | AC | 55 ms
49,840 KB |
testcase_47 | AC | 55 ms
49,876 KB |
testcase_48 | AC | 52 ms
52,216 KB |
testcase_49 | AC | 49 ms
50,424 KB |
testcase_50 | WA | - |
testcase_51 | AC | 49 ms
50,176 KB |
testcase_52 | AC | 50 ms
50,088 KB |
testcase_53 | AC | 52 ms
50,252 KB |
testcase_54 | AC | 50 ms
50,372 KB |
testcase_55 | AC | 51 ms
50,092 KB |
testcase_56 | WA | - |
ソースコード
import java.io.*; import java.util.*; import java.math.*; import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = 10000000; void solve() { int h = ni(); int w = ni(); char[][] map = nm(h,w); int[][] a = new int[2][2]; int r = 0; for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ if(map[i][j]=='*'){ a[r] = new int[]{i,j}; r++; } } } int[] v = new int[]{a[0][0]-a[1][0],a[0][1]-a[1][1]}; int ansx = -1; int ansy = -1; for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ int[] z = new int[]{a[0][0]-i,a[0][1]-j}; double x1 = (double)z[0]/v[0]; double y1 = (double)z[1]/v[1]; if(x1==y1) continue; else{ ansx = i; ansy = j; } } } for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ if(i==ansx && j==ansy){ out.print("*"); } else out.print(map[i][j]); } out.println(); } } 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"); } public static void main(String[] args) throws Exception { new Main().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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }