結果

問題 No.5002 stick xor
ユーザー uwiuwi
提出日時 2018-05-25 23:32:02
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,900 bytes
コンパイル時間 56,141 ms
スコア 0
最終ジャッジ日時 2018-05-25 23:33:00
ジャッジサーバーID
（参考情報） 		judge8 /
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 TLE -
testcase_02 TLE -
testcase_03 TLE -
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 TLE -
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 TLE -
testcase_29 TLE -
testcase_30 TLE -
testcase_31 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180525;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class AGreedy2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[] L;
	long[] b, tb;
	int n, K;
	
	void solve()
	{
		n = ni(); K = ni();
		L = na(K);
		char[][] map = nm(n, n);
		b = new long[n];
		tb = new long[n];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(map[i][j] == '1'){
					b[i] |= 1L<<j;
					tb[j] |= 1L<<i;
				}
			}
		}
		
		anss = new int[K][];
		greedy();
		
		for(int[] ans : anss){
			out.printf("%d %d %d %d\n", ans[0]+1, ans[1]+1, ans[2]+1, ans[3]+1);
		}
	}
	
	int[][] anss;
	
	void greedy()
	{
		int[][] li = new int[K][];
		for(int i = 0;i < K;i++){
			li[i] = new int[]{L[i], i};
		}
		Arrays.sort(li, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return -(a[0] - b[0]);
			}
		});
		
		for(int[] l : li){
			int v = l[0], ind = l[1];
			int minscore = 999999;
			int argw = -1;
			int argi = -1, argj = -1;
			for(int i = 0;i < n;i++){
				for(int j = 0;j+v <= n;j++){
					for(int k = 0;k < v;k++){
						b[i] ^= 1L<<j+k;
					}
					int score = score(b);
					for(int k = 0;k < v;k++){
						b[i] ^= 1L<<j+k;
					}
					if(score < minscore){
						minscore = score;
						argi = i;
						argj = j;
						argw = 0;
					}
				}
			}
			for(int j = 0;j < n;j++){
				for(int i = 0;i+v <= n;i++){
					for(int k = 0;k < v;k++){
						b[i+k] ^= 1L<<j;
					}
					int score = score(b);
					for(int k = 0;k < v;k++){
						b[i+k] ^= 1L<<j;
					}
					if(score < minscore){
						minscore = score;
						argi = i;
						argj = j;
						argw = 1;
					}
				}
			}
			if(argw == 0){
				anss[ind] = new int[]{argi, argj, argi, argj+v-1};
				for(int k = 0;k < v;k++){
					b[argi] ^= 1L<<argj+k;
				}
			}else{
				anss[ind] = new int[]{argi, argj, argi+v-1, argj};
				for(int k = 0;k < v;k++){
					b[argi+k] ^= 1L<<argj;
				}
			}
		}
	}
	
	int score(long[] b)
	{
		int ret = 0;
		for(long h : b){
			ret += Long.bitCount(h);
		}
		return ret;
	}
	
	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 AGreedy2().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