結果

問題 No.506 限られたジャパリまん
ユーザー uwiuwi
提出日時 2017-04-21 22:30:51
言語 Java21
(openjdk 21)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 4,736 bytes
コンパイル時間 5,881 ms
コンパイル使用メモリ 86,088 KB
実行使用メモリ 56,776 KB
最終ジャッジ日時 2024-06-28 04:09:03
合計ジャッジ時間 6,758 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,276 KB
testcase_01 AC 52 ms
49,920 KB
testcase_02 AC 52 ms
50,404 KB
testcase_03 AC 53 ms
50,312 KB
testcase_04 AC 58 ms
50,320 KB
testcase_05 AC 57 ms
50,028 KB
testcase_06 AC 53 ms
50,412 KB
testcase_07 AC 55 ms
50,124 KB
testcase_08 AC 133 ms
54,604 KB
testcase_09 AC 98 ms
54,356 KB
testcase_10 AC 56 ms
50,232 KB
testcase_11 AC 138 ms
54,688 KB
testcase_12 AC 110 ms
54,376 KB
testcase_13 AC 53 ms
50,344 KB
testcase_14 AC 53 ms
50,348 KB
testcase_15 AC 53 ms
50,132 KB
testcase_16 AC 180 ms
56,776 KB
testcase_17 AC 57 ms
50,104 KB
testcase_18 AC 60 ms
49,952 KB
testcase_19 AC 77 ms
50,556 KB
testcase_20 AC 76 ms
53,324 KB
testcase_21 AC 64 ms
50,548 KB
testcase_22 AC 92 ms
54,008 KB
testcase_23 AC 81 ms
52,988 KB
testcase_24 AC 57 ms
50,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170421;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni()+1, m = ni()+1, K = ni(), P = ni();
		boolean[][] g = new boolean[n][m];
		int[] ar = new int[K];
		int[] ac = new int[K];
		String[] names = new String[K];
		for(int i = 0;i < K;i++){
			ar[i] = ni();
			ac[i] = ni();
			names[i] = ns();
			g[ar[i]][ac[i]] = true;
		}
		double maxd = 0;
		long best = 0;
		int bestptn = 0;
		for(int i = 0;i < 1<<K;i++){
			if(Integer.bitCount(i) == P){
				for(int j = 0;j < K;j++){
					if(i<<~j<0){
						g[ar[j]][ac[j]] ^= true;
					}
				}
				double c = countd(g);
				if(c > maxd){
					maxd = c;
					best = count(g);
					bestptn = i;
				}
				
				for(int j = 0;j < K;j++){
					if(i<<~j<0){
						g[ar[j]][ac[j]] ^= true;
					}
				}
			}
		}
		out.println(best);
		for(int j= 0;j < K;j++){
			if(bestptn<<~j<0){
				out.println(names[j]);
			}
		}
	}
	
	int mod = 1000000007;
	
	long count(boolean[][] g)
	{
		int n = g.length;
		int m = g[0].length;
		int[][] dp = new int[n][m];
		if(g[0][0]){
			return 0L;
		}
		dp[0][0] = 1;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(i == 0 && j == 0)continue;
				if(g[i][j])continue;
				if(j-1 >= 0){
					dp[i][j] += dp[i][j-1];
				}
				if(i-1 >= 0){
					dp[i][j] += dp[i-1][j];
				}
				if(dp[i][j] >= mod){
					dp[i][j] -= mod;
				}
			}
		}
		return dp[n-1][m-1];
	}
	
	double countd(boolean[][] g)
	{
		int n = g.length;
		int m = g[0].length;
		double[][] dp = new double[n][m];
		if(g[0][0]){
			return 0.;
		}
		dp[0][0] = 1;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(i == 0 && j == 0)continue;
				if(g[i][j])continue;
				if(j-1 >= 0){
					dp[i][j] += dp[i][j-1];
				}
				if(i-1 >= 0){
					dp[i][j] += dp[i-1][j];
				}
			}
		}
		return dp[n-1][m-1];
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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