結果

問題 No.460 裏表ちわーわ
ユーザー uwiuwi
提出日時 2016-12-11 00:05:26
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,928 bytes
コンパイル時間 4,936 ms
コンパイル使用メモリ 81,884 KB
実行使用メモリ 50,492 KB
最終ジャッジ日時 2024-11-29 02:34:32
合計ジャッジ時間 7,398 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,284 KB
testcase_01 AC 51 ms
50,216 KB
testcase_02 AC 50 ms
50,204 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 AC 51 ms
50,280 KB
testcase_06 AC 51 ms
50,144 KB
testcase_07 AC 53 ms
50,012 KB
testcase_08 AC 49 ms
50,284 KB
testcase_09 AC 50 ms
50,292 KB
testcase_10 AC 51 ms
49,932 KB
testcase_11 AC 49 ms
49,916 KB
testcase_12 AC 50 ms
50,064 KB
testcase_13 AC 50 ms
50,156 KB
testcase_14 AC 52 ms
50,324 KB
testcase_15 AC 53 ms
50,132 KB
testcase_16 AC 51 ms
50,232 KB
testcase_17 AC 50 ms
50,276 KB
testcase_18 AC 52 ms
50,420 KB
testcase_19 AC 52 ms
49,936 KB
testcase_20 AC 51 ms
50,164 KB
testcase_21 AC 50 ms
49,916 KB
testcase_22 AC 50 ms
50,064 KB
testcase_23 AC 51 ms
50,140 KB
testcase_24 AC 50 ms
50,264 KB
testcase_25 AC 48 ms
50,408 KB
testcase_26 RE -
testcase_27 AC 49 ms
50,268 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2016;
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 N460 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++){
			a[i] = na(m);
		}
		int[] b = new int[n];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				b[i] |= a[i][j]<<j;
			}
		}
		int[] min = new int[1<<m];
		Arrays.fill(min, 999);
		for(int i = 0;i < 1<<m;i++){
			int f = (i^i>>>1^i<<1)&(1<<m)-1;
			min[f] = Math.min(min[f], Integer.bitCount(i));
		}
		int mincost = 999;
		outer:
		for(int i = 0;i < 1<<m;i++){
			int[] lb = Arrays.copyOf(b, n);
			int f = (i^i>>>1^i<<1)&(1<<m)-1;
			lb[0] ^= f;
			lb[1] ^= f;
			int cost = Integer.bitCount(i);
			for(int j = 0;j < n-1;j++){
				if(min[lb[j]] == 999)continue outer;
				cost += min[lb[j]];
				lb[j+1] ^= lb[j];
				if(j+2 < n)lb[j+2] ^= lb[j];
			}
			if(lb[n-1] != 0)continue outer;
			mincost = Math.min(mincost, cost);
		}
		if(mincost == 999){
			out.println("Impossible");
		}else{
			out.println(mincost);
		}
	}
	
	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 N460().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