結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | uwi |
提出日時 | 2015-11-27 23:56:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 243 ms / 4,000 ms |
コード長 | 6,413 bytes |
コンパイル時間 | 3,914 ms |
コンパイル使用メモリ | 86,300 KB |
実行使用メモリ | 57,364 KB |
最終ジャッジ日時 | 2024-05-01 16:41:00 |
合計ジャッジ時間 | 10,243 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
37,032 KB |
testcase_01 | AC | 48 ms
36,688 KB |
testcase_02 | AC | 49 ms
36,704 KB |
testcase_03 | AC | 50 ms
37,084 KB |
testcase_04 | AC | 62 ms
37,764 KB |
testcase_05 | AC | 49 ms
37,140 KB |
testcase_06 | AC | 52 ms
36,572 KB |
testcase_07 | AC | 103 ms
40,028 KB |
testcase_08 | AC | 188 ms
53,476 KB |
testcase_09 | AC | 156 ms
47,096 KB |
testcase_10 | AC | 108 ms
39,744 KB |
testcase_11 | AC | 153 ms
44,024 KB |
testcase_12 | AC | 52 ms
37,152 KB |
testcase_13 | AC | 95 ms
40,544 KB |
testcase_14 | AC | 89 ms
38,776 KB |
testcase_15 | AC | 106 ms
39,932 KB |
testcase_16 | AC | 97 ms
38,784 KB |
testcase_17 | AC | 141 ms
45,400 KB |
testcase_18 | AC | 194 ms
51,308 KB |
testcase_19 | AC | 195 ms
53,948 KB |
testcase_20 | AC | 85 ms
38,536 KB |
testcase_21 | AC | 200 ms
55,240 KB |
testcase_22 | AC | 218 ms
56,156 KB |
testcase_23 | AC | 205 ms
54,512 KB |
testcase_24 | AC | 217 ms
55,816 KB |
testcase_25 | AC | 230 ms
56,280 KB |
testcase_26 | AC | 242 ms
57,364 KB |
testcase_27 | AC | 214 ms
54,976 KB |
testcase_28 | AC | 243 ms
55,208 KB |
testcase_29 | AC | 87 ms
39,976 KB |
testcase_30 | AC | 229 ms
55,796 KB |
testcase_31 | AC | 224 ms
54,996 KB |
testcase_32 | AC | 179 ms
54,488 KB |
testcase_33 | AC | 173 ms
53,272 KB |
testcase_34 | AC | 190 ms
53,056 KB |
testcase_35 | AC | 185 ms
53,144 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; import java.util.Queue; public class Q769_3 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[][] a = new int[n][]; for(int i = 0;i < n;i++){ a[i] = na(m); } List<Queue<Integer>> nes = new ArrayList<>(); for(int i = 0;i < n*m;i++)nes.add(new ArrayDeque<Integer>()); DJSet ds = new DJSet(n*m); for(int i = 0;i < n;i++){ for(int j = 0;j < m-1;j++){ if(a[i][j] == a[i][j+1]){ ds.union(i*m+j, i*m+j+1); } } } for(int i = 0;i < n-1;i++){ for(int j = 0;j < m;j++){ if(a[i][j] == a[i+1][j]){ ds.union(i*m+j, (i+1)*m+j); } } } for(int i = 0;i < n;i++){ for(int j = 0;j < m-1;j++){ if(a[i][j] != a[i][j+1]){ nes.get(ds.root(i*m+j)).add(i*m+j<<1|0); nes.get(ds.root(i*m+j+1)).add(i*m+j<<1|0); } } } for(int i = 0;i < n-1;i++){ for(int j = 0;j < m;j++){ if(a[i][j] != a[i+1][j]){ nes.get(ds.root(i*m+j)).add(i*m+j<<1|1); nes.get(ds.root((i+1)*m+j)).add(i*m+j<<1|1); } } } for(int Q = ni();Q > 0;Q--){ int r = ni()-1, c = ni()-1, x = ni(); int root = ds.root(r*m+c); if(a[root/m][root%m] != x){ a[root/m][root%m] = x; Queue<Integer> merged = new ArrayDeque<>(); Queue<Integer> qr = nes.get(root); while(!qr.isEmpty()){ int e = qr.poll(); if((e&1) == 0){ int my = e>>>1, ot = (e>>>1)+1; if(!ds.equiv(my, ot)){ if(ds.root(my) != root){ Queue<Integer> lq = nes.get(ds.root(my)); merged = drain(merged, lq); } if(ds.root(ot) != root){ Queue<Integer> lq = nes.get(ds.root(ot)); merged = drain(merged, lq); } ds.union(my, ot); } }else{ int my = e>>>1, ot = (e>>>1)+m; if(!ds.equiv(my, ot)){ if(ds.root(my) != root){ Queue<Integer> lq = nes.get(ds.root(my)); merged = drain(merged, lq); } if(ds.root(ot) != root){ Queue<Integer> lq = nes.get(ds.root(ot)); merged = drain(merged, lq); } ds.union(my, ot); } } } root = ds.root(root); nes.set(root, merged); } } for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if(j > 0)out.print(" "); int root = ds.root(i*m+j); out.print(a[root/m][root%m]); } out.println(); } } static Queue<Integer> drain(Queue<Integer> a, Queue<Integer> b) { if(a == b)return a; if(a.size() >= b.size()){ while(!b.isEmpty())a.add(b.poll()); return a; }else{ while(!a.isEmpty())b.add(a.poll()); return b; } } public static class DJSet { public int[] upper; public DJSet(int n) { upper = new int[n]; Arrays.fill(upper, -1); } public int root(int x) { return upper[x] < 0 ? x : (upper[x] = root(upper[x])); } public boolean equiv(int x, int y) { return root(x) == root(y); } public boolean union(int x, int y) { x = root(x); y = root(y); if (x != y) { if (upper[y] < upper[x]) { int d = x; x = y; y = d; } upper[x] += upper[y]; upper[y] = x; } return x == y; } public int count() { int ct = 0; for (int u : upper) if (u < 0) ct++; return ct; } } void run() throws Exception { // int n = 200, m = 200; // int q = 50000; // Random gen = new Random(); // StringBuilder sb = new StringBuilder(); // sb.append(n + " "); // sb.append(n + " "); // for (int i = 0; i < n; i++) { // for(int j = 0;j < m;j++){ // sb.append((i+j)%2 + " "); // } // } // sb.append(q + " "); // for (int i = 0; i < q; i++) { // sb.append(1 + " " + 1 + " " + (i%2) + "\n"); // } // INPUT = sb.toString(); 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 Q769_3().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 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)); } }