結果

問題 No.5002 stick xor
ユーザー 37zigen37zigen
提出日時 2018-05-26 01:20:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 876 ms / 1,000 ms
コード長 4,032 bytes
コンパイル時間 29,446 ms
実行使用メモリ 25,128 KB
スコア 23,811
最終ジャッジ日時 2018-05-26 01:20:50
ジャッジサーバーID
（参考情報） 		judge9 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 839 ms
24,472 KB
testcase_01 AC 784 ms
24,864 KB
testcase_02 AC 853 ms
24,964 KB
testcase_03 AC 835 ms
22,972 KB
testcase_04 AC 775 ms
25,124 KB
testcase_05 AC 821 ms
24,480 KB
testcase_06 AC 774 ms
25,124 KB
testcase_07 AC 843 ms
22,976 KB
testcase_08 AC 800 ms
22,968 KB
testcase_09 AC 811 ms
24,468 KB
testcase_10 AC 834 ms
24,476 KB
testcase_11 AC 802 ms
24,472 KB
testcase_12 AC 857 ms
24,468 KB
testcase_13 AC 834 ms
24,476 KB
testcase_14 AC 821 ms
23,568 KB
testcase_15 AC 813 ms
24,476 KB
testcase_16 AC 826 ms
25,128 KB
testcase_17 AC 838 ms
25,116 KB
testcase_18 AC 845 ms
24,904 KB
testcase_19 AC 777 ms
24,476 KB
testcase_20 AC 786 ms
25,128 KB
testcase_21 AC 828 ms
24,468 KB
testcase_22 AC 780 ms
22,952 KB
testcase_23 AC 794 ms
24,696 KB
testcase_24 AC 781 ms
24,472 KB
testcase_25 AC 774 ms
22,968 KB
testcase_26 AC 821 ms
24,468 KB
testcase_27 AC 788 ms
24,464 KB
testcase_28 AC 845 ms
24,476 KB
testcase_29 AC 803 ms
24,464 KB
testcase_30 AC 876 ms
25,048 KB
testcase_31 AC 794 ms
24,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
	int N;
	int[][] curMap;
	int[][] A;

	void run() {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		int K = sc.nextInt();
		int[] L = new int[K];
		int[][] L_sort = new int[K][2];
		curMap = new int[N][N];
		for (int i = 0; i < K; ++i) {
			L[i] = sc.nextInt();
			L_sort[i][0] = L[i];
			L_sort[i][1] = i;
		}
		Arrays.sort(L_sort, new Comparator<int[]>() {
			@Override
			public int compare(int[] o1, int[] o2) {
				return Integer.compare(o1[0], o2[0]);
			}
		});
		A = new int[N][N];
		for (int i = 0; i < N; ++i) {
			char[] cs = sc.next().toCharArray();
			for (int j = 0; j < N; ++j) {
				A[i][j] = (int) (cs[j] - '0');
			}
			curMap[i] = Arrays.copyOf(A[i], A[i].length);
		}
		long[] list = new long[K];
		{
			boolean[] used = new boolean[K];
		/*	out: for (int i = 0; i < K; ++i) {
				for (int j = K - 1; j > i; --j) {
					if (used[L_sort[j][1]] || used[L_sort[i][1]])
						continue;
					int Len = L_sort[j][0] - L_sort[i][0];
					for (long x = 0; x + L_sort[j][0] <= N; ++x) {
						for (long y = 0; y < N; ++y) {
							boolean flag = true;
							for (long k = x + Len; k < x + L_sort[j][0]; ++k) {
								flag &= curMap[(int) k][(int) y] == 1;
							}
							if (flag) {
								long opi = (y + 1) << 32 | (x + 1 + L_sort[i][0]);
								long opj = (y + 1) << 32 | (x + 1);
								act(curMap, opi, L_sort[i][0]);
								act(curMap, opj, L_sort[j][0]);
								list[L_sort[i][1]] = opi;
								list[L_sort[j][1]] = opj;
								used[L_sort[i][1]] = true;
								used[L_sort[j][1]] = true;
								continue out;
							}
						}
					}
				}
			}*/
			for (int i = 0; i < K; ++i) {
				if (used[i])
					continue;
				long op = rnd(L[i]);
				list[i] = op;
				act(curMap, list[i], L[i]);
			}

		}

		for (int t = 0; t < 500000; ++t) {
			int i = (int) (Math.random() * K);
			int j = (int) (Math.random() * K);
			if (i == j)
				continue;
			long opi = rnd(L[i]);
			long opj = rnd(L[j]);
			if (act(curMap, list[i], L[i]) + act(curMap, list[j], L[j]) + act(curMap, opi, L[i])
					+ act(curMap, opj, L[j]) > 0) {
				list[i] = opi;
				list[j] = opj;
			} else {
				act(curMap, list[i], L[i]);
				act(curMap, list[j], L[j]);
				act(curMap, opi, L[i]);
				act(curMap, opj, L[j]);
			}
		}

		for (int i = 0; i < K; ++i) {
			out(list[i], L[i]);
		}
		
	}

	int act(int[][] map, long op, int L) {
		int ret = 0;
		int sign = (int) (op / Math.abs(op));
		op = Math.abs(op);
		int px = (int) op;
		int py = (int) (op >> 32);
		if (sign == 1) {
			for (int i = px; i <= px + L - 1; ++i) {
				for (int j = py; j <= py; ++j) {
					if (curMap[i - 1][j - 1] == 1)
						++ret;
					else
						--ret;
					curMap[i - 1][j - 1] ^= 1;
				}
			}
		} else {
			for (int i = px; i <= px; ++i) {
				for (int j = py; j <= py + L - 1; ++j) {
					if (curMap[i - 1][j - 1] == 1)
						++ret;
					else
						--ret;
					curMap[i - 1][j - 1] ^= 1;
				}
			}
		}
		return ret;
	}

	long rnd(int L) {
		while (true) {
			long px = (long) (Math.random() * N) + 1;
			long py = (long) (Math.random() * N) + 1;
			if (px + L <= N + 1) {
				return (px | (py << 32));
			} else if (py + L <= N + 1) {
				return (-(px | py << 32));
			} else {
				continue;
			}
		}
	}

	int getPt() {
		int ret = 0;
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) {
				if (A[i][j] == 0)
					--ret;
			}
		}
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) {
				if (curMap[i][j] == 0)
					++ret;
			}
		}
		return ret;
	}

	void out(long a, int L) {
		int sign = (int) (a / Math.abs(a));
		a = Math.abs(a);
		int px = (int) a;
		int py = (int) (a >> 32);
		if (sign == 1) {
			System.out.println(px + " " + py + " " + (px + L - 1) + " " + py);
		} else {
			System.out.println(px + " " + py + " " + px + " " + (py + L - 1));
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}
0