結果

問題 No.13 囲みたい！
ユーザー ぴろずぴろず
提出日時 2015-02-14 22:38:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 70 ms / 5,000 ms
コード長 4,936 bytes
コンパイル時間 2,750 ms
コンパイル使用メモリ 77,964 KB
実行使用メモリ 37,656 KB
最終ジャッジ日時 2024-10-13 10:41:06
合計ジャッジ時間 3,588 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
36,752 KB
testcase_01 AC 51 ms
36,988 KB
testcase_02 AC 50 ms
36,532 KB
testcase_03 AC 59 ms
37,428 KB
testcase_04 AC 57 ms
36,932 KB
testcase_05 AC 62 ms
37,656 KB
testcase_06 AC 56 ms
37,112 KB
testcase_07 AC 60 ms
37,152 KB
testcase_08 AC 70 ms
37,272 KB
testcase_09 AC 60 ms
37,368 KB
testcase_10 AC 52 ms
36,776 KB
testcase_11 AC 58 ms
37,144 KB
testcase_12 AC 53 ms
37,120 KB
testcase_13 AC 55 ms
37,120 KB
testcase_14 AC 53 ms
36,660 KB
testcase_15 AC 52 ms
36,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no013;

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

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int w = io.nextInt();
		int h = io.nextInt();
		int[][] m = io.matrixInt(h, w);
		boolean[][] used = new boolean[h][w];
		for(int i=0;i<h;i++) {
			for(int j=0;j<w;j++) {
				if (used[i][j]) {
					continue;
				}
				if (dfs(m[i][j],i,j,-1,-1,m,used)) {
					System.out.println("possible");
					return;
				}
			}
		}
		System.out.println("impossible");
	}

	static int[] di = {0,1,0,-1};
	static int[] dj = {1,0,-1,0};
	static boolean dfs(int num,int i,int j,int bi,int bj,int[][] m,boolean[][] used) {
		used[i][j] = true;
		int w = m[0].length;
		int h = m.length;
		for(int k=0;k<4;k++) {
			int ni = i + di[k];
			int nj = j + dj[k];
			if (ni == bi && nj == bj) {
				continue;
			}
			if (ni < 0 || ni >= h || nj < 0 || nj >= w || m[i][j] != m[ni][nj]) {
				continue;
			}
			if (used[ni][nj] || dfs(num,ni,nj,i,j,m,used)) {
				return true;
			}
		}
		return false;
	}

}

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';
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	private void skipNewLine() {
		while (hasNextByte() && isNewLine(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public boolean hasNextLine() {
		skipNewLine();
		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) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		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[] arrayInt(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		return a;
	}

	public long[] arrayLong(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nextLong();
		return a;
	}

	public double[] arrayDouble(int n) {
		double[] a = new double[n];
		for (int i = 0; i < n; i++)
			a[i] = nextDouble();
		return a;
	}

	public void arrayInt(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[][] matrixInt(int n, int m) {
		int[][] a = new int[n][m];
		for (int i = 0; i < n; i++)
			a[i] = arrayInt(m);
		return a;
	}

	public char[][] charMap(int n, int m) {
		char[][] a = new char[n][m];
		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