結果

問題 No.307 最近色塗る問題多くない？
ユーザー uwiuwi
提出日時 2015-11-27 23:24:32
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,873 bytes
コンパイル時間 3,931 ms
コンパイル使用メモリ 80,864 KB
実行使用メモリ 64,288 KB
最終ジャッジ日時 2024-09-14 00:40:47
合計ジャッジ時間 11,992 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 8 TLE * 1 -- * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

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.InputMismatchException;

public class Q769 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int w = (m>>>6)+1;
		long[][] a = new long[n][w];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				int x = ni();
				if(x == 1){
					a[i][j>>>6] |= 1L<<j;
				}
			}
		}
		
		long[][] con = new long[n][w];
		long[][] ncon = new long[n][w];
		for(int Q = ni();Q > 0;Q--){
			int r = ni()-1, c = ni()-1, x = ni();
			if((a[r][c>>>6]>>>c&1) == x)continue;
			
			connected(r, c, a, con, ncon, m);
		}
		
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(j > 0)out.print(" ");
				out.print(a[i][j>>>6]>>>j&1);
			}
			out.println();
		}
	}
	
	void connected(int r, int c, long[][] a, long[][] con, long[][] ncon, int m)
	{
		int col = (int)(a[r][c>>>6]>>>c&1);
		int n = con.length;
		for(int i = 0;i < n;i++)Arrays.fill(con[i], 0L);
		con[r][c>>>6] = 1L<<c;
		int w = (m>>>6)+1;
		int prevbc = 1;
		while(true){
			for(int i = 0;i < n;i++){
				Arrays.fill(ncon[i], 0L);
			}
			for(int i = 0;i < n;i++){
				for(int j = 0;j < w;j++)ncon[i][j] |= con[i][j];
				if(i > 0)for(int j = 0;j < w;j++)ncon[i-1][j] |= con[i][j];
				if(i < n-1)for(int j = 0;j < w;j++)ncon[i+1][j] |= con[i][j];
				for(int j = 0;j < w;j++)ncon[i][j] |= con[i][j]>>>1;
				for(int j = 1;j < w;j++)ncon[i][j-1] |= con[i][j]<<63;
				for(int j = 0;j < w;j++)ncon[i][j] |= con[i][j]<<1;
				for(int j = 0;j < w-1;j++)ncon[i][j+1] |= con[i][j]>>>63;
			}
			for(int i = 0;i < n;i++){
				ncon[i][w-1] &= (1L<<m)-1;
				for(int j = 0;j < w;j++){
					if(col == 0){
						ncon[i][j] &= ~a[i][j];
					}else{
						ncon[i][j] &= a[i][j];
					}
				}
			}
			int bc = 0;
			for(int i = 0;i < n;i++){
				for(int j = 0;j < w;j++){
					bc += Long.bitCount(ncon[i][j]);
				}
			}
			if(prevbc == bc)break;
			long[][] dum = con; con = ncon; ncon = dum;
			prevbc = bc;
		}
//		for(int i = 0;i < n;i++){
//			for(int j = 0;j < w;j++){
//				tr(Long.toBinaryString(con[i][j]));
//			}
//		}
//		tr();
		
		for(int i = 0;i < n;i++){
			for(int j = 0;j < w;j++){
				a[i][j] ^= con[i][j];
			}
//			for(int j = 0;j < w;j++){
//				tr(Long.toBinaryString(a[i][j]));
//			}
		}
	}
	
	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().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