#167793 (Java) No.506 限られたジャパリまん

• 問題: No.506 限られたジャパリまん
• ユーザー: Grenache
• 提出日時: 2017-04-21 23:32:16
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 5,264 bytes
• コンパイル時間: 3,729 ms
• コンパイル使用メモリ: 78,932 KB
• 実行使用メモリ: 57,712 KB
• 最終ジャッジ日時: 2024-06-28 04:13:51
• 合計ジャッジ時間: 8,930 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
other	AC * 12 WA * 13

ソースコード

import java.io.*;
import java.util.*;


public class Main_yukicoder506 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int h = sc.nextInt();
		int w = sc.nextInt();
		int k = sc.nextInt();
		int p = sc.nextInt();

		int[] x = new int[k];
		int[] y = new int[k];
		String[] n = new String[k];
		for (int i = 0; i < k; i++) {
			y[i] = sc.nextInt();
			x[i] = sc.nextInt();
			n[i] = sc.next();
		}

		long ret = 0;
		int retm = 0;

		for (int mask = 0; mask < 0x1 << k; mask++) {
			if (Integer.bitCount(mask) > p) {
				continue;
			}

			int[][] maze = new int[h + 1][w + 1];
			for (int i = 0; i < k; i++) {
				if ((mask & (0x1 << i)) == 0) {
					maze[y[i]][x[i]] = -1;
				}
			}

			long tmp = cnt(maze);
			if (tmp > ret) {
				ret = Math.max(ret, tmp);
				retm = mask;
			}
		}

		pr.println(ret);
		for (int i = 0; i < k; i++) {
			if ((retm & (0x1 << i)) != 0) {
				pr.println(n[i]);
			}
		}
	}

	private static long cnt(int[][] maze) {
		if (maze[0][0] == -1) {
			return 0;
		}

		int[] dx = {1, 0};
		int[] dy = {0, 1};

		int h = maze.length;
		int w = maze[0].length;

		maze[0][0] = 1;
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (maze[i][j] == -1) {
					continue;
				}
				for (int k = 0, size = dx.length; k < size; k++) {
					int nx = j + dx[k];
					int ny = i + dy[k];

					if (nx < 0 || nx >= w || ny < 0 || ny >= h) {
						continue;
					}

					if (maze[ny][nx] != -1) {
						maze[ny][nx] += maze[i][j];
					}
				}
			}
		}

		return maze[h - 1][w - 1];
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}