結果

問題 No.506 限られたジャパリまん
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-21 23:22:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 3,994 bytes
コンパイル時間 3,577 ms
コンパイル使用メモリ 74,496 KB
実行使用メモリ 53,760 KB
最終ジャッジ日時 2023-09-10 12:52:24
合計ジャッジ時間 5,171 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,232 KB
testcase_01 AC 44 ms
49,336 KB
testcase_02 AC 44 ms
49,080 KB
testcase_03 AC 42 ms
49,376 KB
testcase_04 AC 48 ms
49,144 KB
testcase_05 AC 47 ms
49,240 KB
testcase_06 AC 43 ms
49,320 KB
testcase_07 AC 43 ms
49,480 KB
testcase_08 AC 120 ms
53,620 KB
testcase_09 AC 102 ms
53,520 KB
testcase_10 AC 47 ms
49,284 KB
testcase_11 AC 109 ms
53,584 KB
testcase_12 AC 110 ms
53,760 KB
testcase_13 AC 43 ms
49,468 KB
testcase_14 AC 45 ms
49,788 KB
testcase_15 AC 43 ms
49,468 KB
testcase_16 AC 107 ms
53,616 KB
testcase_17 AC 47 ms
49,188 KB
testcase_18 AC 50 ms
49,296 KB
testcase_19 AC 60 ms
51,200 KB
testcase_20 AC 72 ms
53,536 KB
testcase_21 AC 54 ms
49,292 KB
testcase_22 AC 73 ms
53,196 KB
testcase_23 AC 64 ms
52,792 KB
testcase_24 AC 49 ms
49,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main {
  private static int H;
  private static int W;
  
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    H = sc.nextInt();
    W = sc.nextInt();
    int K = sc.nextInt();
    int P = sc.nextInt();
    
    String[] name = new String[K];
    int[][] j = new int[K][2];
    for (int i = 0; i < K; i ++) {
      j[i][0] = sc.nextInt();
      j[i][1] = sc.nextInt();
      name[i] = sc.next();
    }
    
    long max = 0;
    int maxIdx = 0;
    for (int i = 0; i < (1 << K); i ++) {
      if (Integer.bitCount(i) == P) {
        long now = count(j, i);
        if (now > max) {
          max = now;
          maxIdx = i;
        }
      }
    }
    
    System.out.println(max % mod);
    for (int i = 0; i < K; i ++) {
      if ((maxIdx & (1 << i)) != 0) {
        System.out.println(name[i]);
      }
    }
  }


  private static long mod = 1000000000 + 7;
  private static long count(int[][] jb, int bit) {
    long[][] dp = new long[H + 1][W + 1];
    boolean[][] f = new boolean[H + 1][W + 1];
    for (int i = 0; i < jb.length; i ++) {
      if ((bit & (1 << i)) == 0) {
        f[jb[i][0]][jb[i][1]] = true;
      }
    }
    dp[0][0] =1;
    for (int i = 0; i <= H; i ++) {
      for (int j= 0; j <= W; j ++) {
        if (!f[i][j]) {
          if (i > 0) dp[i][j] += dp[i - 1][j];
          if (j > 0) dp[i][j] += dp[i][j - 1];
        }
      }
    }
    return dp[H][W];
  }
}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else 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 void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		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 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() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0