結果

問題 No.307 最近色塗る問題多くない？
ユーザー ぴろずぴろず
提出日時 2015-11-27 23:34:11
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,966 bytes
コンパイル時間 2,441 ms
コンパイル使用メモリ 79,596 KB
実行使用メモリ 61,836 KB
最終ジャッジ日時 2024-09-14 00:49:58
合計ジャッジ時間 11,521 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,244 KB
testcase_01 AC 55 ms
50,216 KB
testcase_02 AC 54 ms
50,072 KB
testcase_03 AC 56 ms
50,052 KB
testcase_04 AC 71 ms
50,440 KB
testcase_05 AC 56 ms
50,352 KB
testcase_06 AC 56 ms
50,316 KB
testcase_07 AC 123 ms
52,604 KB
testcase_08 WA -
testcase_09 AC 162 ms
56,456 KB
testcase_10 AC 111 ms
52,220 KB
testcase_11 AC 124 ms
52,224 KB
testcase_12 AC 56 ms
49,916 KB
testcase_13 AC 103 ms
52,036 KB
testcase_14 AC 103 ms
51,320 KB
testcase_15 AC 122 ms
52,164 KB
testcase_16 AC 105 ms
52,216 KB
testcase_17 AC 196 ms
57,876 KB
testcase_18 AC 531 ms
61,272 KB
testcase_19 AC 365 ms
61,368 KB
testcase_20 AC 77 ms
50,752 KB
testcase_21 AC 294 ms
60,740 KB
testcase_22 AC 270 ms
61,136 KB
testcase_23 AC 785 ms
61,836 KB
testcase_24 AC 384 ms
61,036 KB
testcase_25 AC 470 ms
61,064 KB
testcase_26 AC 792 ms
61,728 KB
testcase_27 AC 151 ms
54,928 KB
testcase_28 WA -
testcase_29 AC 90 ms
51,260 KB
testcase_30 AC 616 ms
61,320 KB
testcase_31 AC 165 ms
55,064 KB
testcase_32 AC 154 ms
55,032 KB
testcase_33 AC 160 ms
56,748 KB
testcase_34 AC 153 ms
54,952 KB
testcase_35 AC 158 ms
55,112 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no307;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Queue;

public class Main {
	static int[] di = {0,-1,0,1};
	static int[] dj = {1,0,-1,0};
	public static void main(String[] args) {
		IO io = new IO();
		int h = io.nextInt();
		int w = io.nextInt();
		int[][] a = io.nextIntMatrix(h, w);
		int q = io.nextInt();
		boolean flat = false;
		int flatcolor = -1;

		for(int i=0;i<q;i++) {
			int r = io.nextInt() - 1;
			int c = io.nextInt() - 1;
			int x = io.nextInt();
			if (a[r][c] == x) {
				continue;
			}
			if (flat) {
				flatcolor = x;
				continue;
			}
			int count = 1;
			Queue<Integer> queue = new ArrayDeque<>();
			a[r][c] = x;
			queue.offer(r | c << 8);
			while(!queue.isEmpty()) {
				int pos = queue.poll();
				int qi = pos & 0xFF;
				int qj = pos >> 8;
				for(int k=0;k<4;k++) {
					int ni = qi + di[k];
					int nj = qj + dj[k];
					if (ni < 0 || ni >= h || nj < 0 || nj >= w || a[ni][nj] == x) {
						continue;
					}
					a[ni][nj] = x;
					count++;
					queue.offer(ni | nj << 8);
				}
			}
			if (count == h * w) {
				flat = true;
				flatcolor = x;
			}
		}

		for(int i=0;i<h;i++) {
			for(int j=0;j<w;j++) {
				if (flat) {
					a[i][j] = flatcolor;
				}
				if (j > 0) {
					io.print(" ");
				}
				io.print(a[i][j]);
			}
			io.println();
		}
		io.flush();
	}

}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0