#60701 (Java21) No.307 最近色塗る問題多くない？

提出ソース

結果

問題	No.307 最近色塗る問題多くない？
ユーザー	uwi
提出日時	2015-11-27 23:28:39
言語	Java21 (openjdk 21)
結果	MLE
実行時間	-
コード長	6,336 bytes
コンパイル時間	4,481 ms
コンパイル使用メモリ	90,276 KB
実行使用メモリ	710,268 KB
最終ジャッジ日時	2024-09-14 00:45:36
合計ジャッジ時間	14,678 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 48,348 KB
testcase_01	AC	54 ms 48,076 KB
testcase_02	AC	55 ms 48,164 KB
testcase_03	AC	53 ms 48,076 KB
testcase_04	MLE	-
testcase_05	AC	54 ms 49,808 KB
testcase_06	AC	128 ms 55,284 KB
testcase_07	AC	432 ms 99,076 KB
testcase_08	MLE	-
testcase_09	MLE	-
testcase_10	MLE	-
testcase_11	MLE	-
testcase_12	AC	57 ms 50,480 KB
testcase_13	AC	146 ms 53,564 KB
testcase_14	AC	106 ms 51,588 KB
testcase_15	AC	238 ms 67,040 KB
testcase_16	AC	215 ms 68,528 KB
testcase_17	AC	299 ms 72,396 KB
testcase_18	TLE	-
testcase_19	AC	211 ms 60,776 KB
testcase_20	AC	128 ms 53,416 KB
testcase_21	MLE	-
testcase_22	AC	228 ms 68,624 KB
testcase_23	AC	232 ms 65,800 KB
testcase_24	AC	238 ms 66,092 KB
testcase_25	AC	258 ms 66,472 KB
testcase_26	AC	328 ms 68,720 KB
testcase_27	MLE	-
testcase_28	TLE	-
testcase_29	AC	100 ms 51,400 KB
testcase_30	AC	256 ms 65,484 KB
testcase_31	MLE	-
testcase_32	AC	200 ms 61,920 KB
testcase_33	AC	184 ms 60,704 KB
testcase_34	AC	182 ms 58,932 KB
testcase_35	AC	190 ms 58,948 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

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<List<Integer>> nes = new ArrayList<>();
		for(int i = 0;i < n*m;i++)nes.add(new ArrayList<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;
				List<List<Integer>> mall = new ArrayList<>();
				List<Integer> merged = null;
				for(int e : nes.get(root)){
					if((e&1) == 0){
						int my = e>>>1, ot = (e>>>1)+1;
						if(!ds.equiv(my, ot)){
							if(ds.root(my) != root){
								List<Integer> y = nes.get(ds.root(my));
								if(merged == null || y.size() > merged.size()){
									if(merged != null)mall.add(merged);
									merged = y;
								}else{
									mall.add(y);
								}
							}
							if(ds.root(ot) != root){
								List<Integer> y = nes.get(ds.root(ot));
								if(merged == null || y.size() > merged.size()){
									if(merged != null)mall.add(merged);
									merged = y;
								}else{
									mall.add(y);
								}
							}
						}
						ds.union(my, ot);
					}else{
						int my = e>>>1, ot = (e>>>1)+m;
						if(!ds.equiv(my, ot)){
							if(ds.root(my) != root){
								List<Integer> y = nes.get(ds.root(my));
								if(merged == null || y.size() > merged.size()){
									if(merged != null)mall.add(merged);
									merged = y;
								}else{
									mall.add(y);
								}
							}
							if(ds.root(ot) != root){
								List<Integer> y = nes.get(ds.root(ot));
								if(merged == null || y.size() > merged.size()){
									if(merged != null)mall.add(merged);
									merged = y;
								}else{
									mall.add(y);
								}
							}
						}
						ds.union(my, ot);
					}
				}
				root = ds.root(root);
				if(merged == null){
					nes.set(root, new ArrayList<Integer>());
				}else{
					for(List<Integer> ma : mall)merged.addAll(ma);
					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();
		}
	}
	
	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
	{
		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)); }
}

yukicoder

結果

テストケース

ソースコード