Submission #262848

#	Time	Username	Problem	Language	Result	Execution time	Memory
262848		idk321	Vision Program (IOI19_vision)	Java	33 / 100	153 ms	13728 KiB

vision

import java.util.Arrays;

public class vision {
	public void construct_network(int H, int W, int K) {
		int commands = 0;
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				if (j + K < W) {
					int[] command = {i * W + j, i * W + j + K};
					grader.add_and(command);
					commands++;
				}
				for (int k = i + 1; k < H; k++) {
					int remaining = K - k + i;
					if (remaining > 0) {
						if (j + remaining < W) {
							int[] command = {i * W + j, k * W + j + remaining};
							grader.add_and(command);
							commands++;
						}
						if (j - remaining >= 0) {
							int[] command = {i * W + j, k * W + j - remaining};
							//System.out.println(Arrays.toString(command));
							grader.add_and(command);
							commands++;
						}
					} else if (remaining == 0) {
						int[] command = {i * W + j, k * W + j};
						grader.add_and(command);
						commands++;
					}
				}
			}
		}

		int[] command = new int[commands];
		for (int i = H * W, j = 0; j < commands; i++, j++) command[j] = i;
		grader.add_or(command);
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19