結果
問題 | No.421 しろくろチョコレート |
ユーザー | uwi |
提出日時 | 2016-09-09 22:43:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,406 ms / 2,000 ms |
コード長 | 4,531 bytes |
コンパイル時間 | 3,920 ms |
コンパイル使用メモリ | 80,600 KB |
実行使用メモリ | 60,960 KB |
最終ジャッジ日時 | 2023-10-24 14:46:25 |
合計ジャッジ時間 | 20,737 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
53,500 KB |
testcase_01 | AC | 152 ms
60,880 KB |
testcase_02 | AC | 97 ms
59,640 KB |
testcase_03 | AC | 78 ms
54,012 KB |
testcase_04 | AC | 101 ms
57,364 KB |
testcase_05 | AC | 119 ms
55,932 KB |
testcase_06 | AC | 56 ms
53,500 KB |
testcase_07 | AC | 159 ms
56,208 KB |
testcase_08 | AC | 95 ms
59,452 KB |
testcase_09 | AC | 101 ms
55,472 KB |
testcase_10 | AC | 90 ms
55,096 KB |
testcase_11 | AC | 154 ms
56,200 KB |
testcase_12 | AC | 54 ms
53,484 KB |
testcase_13 | AC | 53 ms
53,432 KB |
testcase_14 | AC | 55 ms
53,492 KB |
testcase_15 | AC | 54 ms
52,456 KB |
testcase_16 | AC | 231 ms
60,792 KB |
testcase_17 | AC | 398 ms
60,596 KB |
testcase_18 | AC | 509 ms
60,764 KB |
testcase_19 | AC | 53 ms
53,488 KB |
testcase_20 | AC | 201 ms
58,296 KB |
testcase_21 | AC | 251 ms
60,776 KB |
testcase_22 | AC | 161 ms
56,220 KB |
testcase_23 | AC | 53 ms
53,488 KB |
testcase_24 | AC | 53 ms
53,496 KB |
testcase_25 | AC | 53 ms
53,488 KB |
testcase_26 | AC | 53 ms
53,492 KB |
testcase_27 | AC | 54 ms
53,500 KB |
testcase_28 | AC | 196 ms
60,600 KB |
testcase_29 | AC | 236 ms
60,604 KB |
testcase_30 | AC | 242 ms
60,780 KB |
testcase_31 | AC | 1,406 ms
60,856 KB |
testcase_32 | AC | 213 ms
60,884 KB |
testcase_33 | AC | 231 ms
60,688 KB |
testcase_34 | AC | 98 ms
59,088 KB |
testcase_35 | AC | 102 ms
58,936 KB |
testcase_36 | AC | 139 ms
58,536 KB |
testcase_37 | AC | 813 ms
60,644 KB |
testcase_38 | AC | 1,292 ms
60,792 KB |
testcase_39 | AC | 127 ms
58,032 KB |
testcase_40 | AC | 321 ms
56,456 KB |
testcase_41 | AC | 140 ms
54,348 KB |
testcase_42 | AC | 122 ms
56,236 KB |
testcase_43 | AC | 132 ms
58,308 KB |
testcase_44 | AC | 648 ms
58,468 KB |
testcase_45 | AC | 88 ms
54,996 KB |
testcase_46 | AC | 114 ms
55,960 KB |
testcase_47 | AC | 148 ms
58,392 KB |
testcase_48 | AC | 804 ms
60,752 KB |
testcase_49 | AC | 101 ms
59,624 KB |
testcase_50 | AC | 100 ms
57,268 KB |
testcase_51 | AC | 823 ms
58,428 KB |
testcase_52 | AC | 150 ms
56,332 KB |
testcase_53 | AC | 93 ms
54,812 KB |
testcase_54 | AC | 104 ms
59,836 KB |
testcase_55 | AC | 89 ms
55,088 KB |
testcase_56 | AC | 79 ms
53,588 KB |
testcase_57 | AC | 90 ms
55,404 KB |
testcase_58 | AC | 163 ms
58,312 KB |
testcase_59 | AC | 119 ms
55,768 KB |
testcase_60 | AC | 1,335 ms
60,960 KB |
testcase_61 | AC | 333 ms
60,640 KB |
testcase_62 | AC | 54 ms
53,492 KB |
testcase_63 | AC | 54 ms
53,496 KB |
testcase_64 | AC | 90 ms
58,664 KB |
ソースコード
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.BitSet; import java.util.InputMismatchException; public class N421 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); char[][] map = nm(n,m); boolean[][] g = new boolean[n*m][n*m]; int[] dr = { 1, 0, -1, 0 }; int[] dc = { 0, 1, 0, -1 }; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if((i+j) % 2 == 0 && map[i][j] == 'w'){ for(int k = 0;k < 4;k++){ int ni = i + dr[k], nj = j + dc[k]; if(ni >= 0 && ni < n && nj >= 0 && nj < m && map[ni][nj] == 'b'){ g[i*m+j][ni*m+nj] = true; } } } } } int mat = doBipartiteMatching(g); int w = 0, b = 0; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if(map[i][j] == 'w'){ w++; } if(map[i][j] == 'b'){ b++; } } } w -= mat; b -= mat; out.println(mat*100+Math.min(w, b)*10 + Math.max(w, b) - Math.min(w, b)); } public static int doBipartiteMatching(boolean[][] g) { int n = g.length; if(n == 0)return 0; int m = g[0].length; if(m == 0)return 0; int[] im = new int[m]; Arrays.fill(im, -1); BitSet visited = new BitSet(); int matched = 0; for(int i = 0;i < n;i++){ if(visit(g, i, visited, im)) { visited.clear(); matched++; } } return matched; } public static boolean visit(boolean[][] g, int cur, BitSet visited, int[] im) { if(cur == -1)return true; for(int i = visited.nextClearBit(0);i != g[cur].length;i = visited.nextClearBit(i+1)){ if(g[cur][i]){ visited.set(i); if(visit(g, im[i], visited, im)){ im[i] = cur; return true; } } } return false; } 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 N421().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)); } }