結果

問題 No.307 最近色塗る問題多くない？
ユーザー uwiuwi
提出日時 2015-11-27 23:43:08
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 6,318 bytes
コンパイル時間 4,247 ms
コンパイル使用メモリ 81,432 KB
実行使用メモリ 71,064 KB
最終ジャッジ日時 2023-10-12 01:10:43
合計ジャッジ時間 15,187 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
49,712 KB
testcase_01 AC 48 ms
49,828 KB
testcase_02 AC 43 ms
49,652 KB
testcase_03 AC 50 ms
49,696 KB
testcase_04 AC 85 ms
51,136 KB
testcase_05 AC 50 ms
49,716 KB
testcase_06 AC 54 ms
49,912 KB
testcase_07 AC 122 ms
56,556 KB
testcase_08 AC 229 ms
64,664 KB
testcase_09 AC 171 ms
60,804 KB
testcase_10 AC 259 ms
61,092 KB
testcase_11 AC 591 ms
71,064 KB
testcase_12 AC 52 ms
49,792 KB
testcase_13 AC 94 ms
54,256 KB
testcase_14 AC 98 ms
52,516 KB
testcase_15 AC 112 ms
52,332 KB
testcase_16 AC 92 ms
52,440 KB
testcase_17 AC 179 ms
59,344 KB
testcase_18 AC 211 ms
63,272 KB
testcase_19 AC 226 ms
64,020 KB
testcase_20 AC 82 ms
51,676 KB
testcase_21 AC 232 ms
66,788 KB
testcase_22 AC 262 ms
69,468 KB
testcase_23 AC 248 ms
66,656 KB
testcase_24 AC 251 ms
66,996 KB
testcase_25 AC 277 ms
67,320 KB
testcase_26 AC 291 ms
68,072 KB
testcase_27 TLE -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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_2 {
	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);
				}
			}
		}
		
		Queue<Queue<Integer>> mall = new ArrayDeque<>();
		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));
								while(!lq.isEmpty())merged.add(lq.poll());
							}
							if(ds.root(ot) != root){
								Queue<Integer> lq = nes.get(ds.root(ot));
								while(!lq.isEmpty())merged.add(lq.poll());
							}
							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));
								while(!lq.isEmpty())merged.add(lq.poll());
							}
							if(ds.root(ot) != root){
								Queue<Integer> lq = nes.get(ds.root(ot));
								while(!lq.isEmpty())merged.add(lq.poll());
							}
							ds.union(my, ot);
						}
					}
				}
				root = ds.root(root);
				nes.get(root).clear();
				nes.get(root).addAll(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();
		}
	}
	
	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_2().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)); }
}
0