結果

問題 No.1398 調和の魔法陣 (構築)
ユーザー CuriousFairy315CuriousFairy315
提出日時 2020-06-23 16:02:31
言語 Java21
(openjdk 21)
結果
AC  
実行時間 200 ms / 3,153 ms
コード長 9,680 bytes
コンパイル時間 2,700 ms
コンパイル使用メモリ 86,612 KB
実行使用メモリ 60,356 KB
最終ジャッジ日時 2023-10-17 23:11:18
合計ジャッジ時間 34,317 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
53,500 KB
testcase_01 AC 55 ms
53,492 KB
testcase_02 AC 54 ms
53,504 KB
testcase_03 AC 53 ms
53,504 KB
testcase_04 AC 53 ms
53,496 KB
testcase_05 AC 54 ms
52,484 KB
testcase_06 AC 184 ms
59,332 KB
testcase_07 AC 57 ms
53,496 KB
testcase_08 AC 192 ms
60,356 KB
testcase_09 AC 185 ms
60,204 KB
testcase_10 AC 54 ms
53,504 KB
testcase_11 AC 187 ms
59,928 KB
testcase_12 AC 56 ms
53,496 KB
testcase_13 AC 187 ms
59,716 KB
testcase_14 AC 186 ms
59,760 KB
testcase_15 AC 56 ms
53,504 KB
testcase_16 AC 187 ms
59,584 KB
testcase_17 AC 200 ms
59,888 KB
testcase_18 AC 197 ms
59,904 KB
testcase_19 AC 193 ms
57,812 KB
testcase_20 AC 56 ms
53,500 KB
testcase_21 AC 187 ms
58,192 KB
testcase_22 AC 188 ms
59,852 KB
testcase_23 AC 55 ms
51,444 KB
testcase_24 AC 191 ms
59,760 KB
testcase_25 AC 58 ms
52,552 KB
testcase_26 AC 191 ms
59,692 KB
testcase_27 AC 191 ms
59,860 KB
testcase_28 AC 57 ms
52,544 KB
testcase_29 AC 188 ms
60,168 KB
testcase_30 AC 56 ms
53,504 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder_4589;

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.BitSet;
import java.util.NoSuchElementException;

public class Main {

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

	public Main() {
		InputChecker ic = new InputChecker(System.in);
		java.io.PrintWriter out = new java.io.PrintWriter(System.out);
		solve(ic, out);
		out.flush();
		ic.checkEOF();
	}

	public void solve(InputChecker ic, java.io.PrintWriter out) {
		int W = ic.nextInt(1, 600);
		ic.nextChar(' ');
		int H = ic.nextInt(1, 600);
		ic.nextChar(' ');
		int X = ic.nextInt(0, 81);
		ic.readNewLine();
		int[][] magic = new int[H][W];
		if (X > 36 / (W % 3 == 2 ? 1 : 2) / (H % 3 == 2 ? 1 : 2)) {
			out.println(-1);
			return;
		}
		switch(W % 3) {
			case 0:
				switch (H % 3) {
					case 0:
						for (int y = 1;y < H;y += 3) {
							for (int x = 1;x < W;x += 3) {
								magic[y][x] = X;
							}
						}
						break;
					case 1:
						for (int y = 0;y < H;y += 3) {
							for (int x = 1;x < W;x += 3) {
								magic[y][x] = X;
							}
						}
						break;
					case 2:
						for (int y = 0;y < H;y += 3) {
							for (int x = 1;x < W;x += 3) {
								magic[y][x] = Math.min(9, X);
								magic[y + 1][x] = X - magic[y][x];
							}
						}
				}
				break;
			case 1:
				switch (H % 3) {
					case 0:
						for (int y = 1;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = X;
							}
						}
						break;
					case 1:
						for (int y = 0;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = X;
							}
						}
						break;
					case 2:
						for (int y = 0;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = Math.min(9, X);
								magic[y + 1][x] = X - magic[y][x];
							}
						}
				}
				break;
			case 2:
				switch (H % 3) {
					case 0:
						for (int y = 1;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = Math.min(9, X);
								magic[y][x + 1] = X - magic[y][x];
							}
						}
						break;
					case 1:
						for (int y = 0;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = Math.min(9, X);
								magic[y][x + 1] = X - magic[y][x];
							}
						}
						break;
					case 2:
						for (int y = 0;y < H;y += 3) {
							for (int x = 0;x < W;x += 3) {
								magic[y][x] = Math.min(9, X);
								magic[y + 1][x] = Math.min(9, X - magic[y][x]);
								magic[y][x + 1] = Math.min(9, X - magic[y][x] - magic[y + 1][x]);
								magic[y + 1][x + 1] = Math.min(9, X - magic[y][x] - magic[y + 1][x] - magic[y][x + 1]);
							}
						}
				}
				break;
		}
		for (int y = 0;y < H;++ y) {
			for (int x = 0;x < W;++ x) out.print(magic[y][x]);
			out.println();
		}

	}
	public static class CharSet {
		private final BitSet set = new BitSet(256);

		public void add(char... c) {
			for (char i : c) set.set(i);
		}

		public void add(CharSet... s) {
			for (CharSet i : s) set.or(i.set);
		}

		public boolean contains(char... c) {
			for (char i : c) if (!set.get(i)) return false;
			return true;
	 	}

		public boolean contains(String s) {
			return contains(s.toCharArray());
	 	}

		private static final class Chars extends CharSet {
			public Chars(char... c) {
				super.add(c);
			}
			public Chars(CharSet... s) {
				super.add(s);
			}
			@Override
			public void add(char... c) {
				throw new UnsupportedOperationException();
			}
			@Override
			public void add(CharSet... s) {
				throw new UnsupportedOperationException();
			}
		}

		public static final CharSet NUMBER = new Chars('0','1','2','3','4','5','6','7','8','9');
		public static final CharSet LOWER = new Chars('a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z');
		public static final CharSet UPPER = new Chars('A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z');
		public static final CharSet ALPHABET = new Chars(LOWER, UPPER);

	}
	public static class InputChecker {
		private InputStream in;
		private final byte[] buffer = new byte[1024];
		private final byte[] undo = new byte[1024];
		private int undoSize = 0;
		private int read = 0;
		private int length = 0;

		public InputChecker(InputStream in) {
			this.in = in;
		}

		public final void setInputStream(InputStream in) {
			this.in = in;
		}

		public final void setInputStream(File in) {
			try {
				this.in = new FileInputStream(in);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		private boolean hasNextByte() {
			if (undoSize > 0) return true;
			if (read < length) return true;
			read = 0;
			try {
				length = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			return length > 0;
		}

		private byte readByte() {
			if (hasNextByte()) return undoSize > 0 ? undo[--undoSize] : buffer[read++];
			throw new NoSuchElementException();
		}

		private void undo(byte b) {
			undo[undoSize ++] = b;
		}

		private void undo(char c) {
			if ((c & 0xFF80) == 0) {
				undo((byte)c);
				return;
			}
			undo((byte)(c & 0x3F | 0x80));
			if ((c & 0xF800) == 0) {
				undo((byte)(c >> 6 & 0x1F | 0xC0));
			} else {
				undo((byte)(c >> 6 & 0x3F | 0x80));
				undo((byte)(c >> 12 | 0xE0));
			}
		}

		public final boolean hasNext() {
			return hasNextByte();
		}

		public final char nextChar() {
			byte b = readByte();
			if ((b & 0x80) == 0) return (char)b;
			if ((b & 0x20) == 0) return (char)((b & 0x1F) << 6 | (readByte() & 0x3F));
			return (char)((b & 0xF) << 12 | (readByte() & 0x3F) << 6 | (readByte() & 0x3F));
		}

		public final char nextChar(char estimate) {
			char c = nextChar();
			if (estimate == c) return estimate;
			undo(c);
			throw new AssertionError();
		}

		public final char nextChar(CharSet estimate) {
			char c = nextChar();
			if (estimate.contains(c)) return c;
			undo(c);
			throw new AssertionError();
		}

		public final void readNewLine() {
			char c = nextChar();
			if (c == '\r') {
				c = nextChar();
				if (c != '\n') undo(c);
				return;
			} else if (c == '\n') return;
			undo(c);
			throw new AssertionError();
		}

		public final void checkEOF() {
			if (hasNextByte()) throw new AssertionError();
		}

		public final String next(CharSet contains) {
			StringBuilder sb = new StringBuilder();
			try {
				do {
					char c = nextChar();
					if (!contains.contains(c)) {
						undo(c);
						return sb.toString();
					}
					sb.append(c);
				} while(true);
			} catch (NoSuchElementException e) {
				if (sb.length() <= 0) throw new AssertionError();
				return sb.toString();
			}
		}

		public final int nextInt() {
			byte b = readByte();
			int n = 0;
			if (b == '-') {
				if (!isNumber(b = readByte())) {
					undo(b);
					throw new NumberFormatException();
				}
				try {
					if (b == '0') {
						if (!isNumber(b = readByte())) {
							undo(b);
							return 0;
						}
						throw new NumberFormatException();
					}
					do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte()));
					undo(b);
				} catch (NoSuchElementException e) {
				}
				return n;
			}
			if (!isNumber(b)) {
				undo(b);
				throw new NumberFormatException();
			}
			try {
				if (b == '0') {
					if (!isNumber(b = readByte())) {
						undo(b);
						return 0;
					}
					throw new NumberFormatException();
				}
				do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte()));
				undo(b);
			} catch (NoSuchElementException e) {
			}
			return n;
		}

		public final int nextInt(int min, int max) {
			int n = nextInt();
			if (min <= n && n <= max) return n;
			throw new NumberFormatException();
		}

		private static boolean isNumber(byte c) {
			return '0' <= c && c <= '9';
		}

		public final long nextLong() {
			byte b = readByte();
			long n = 0;
			if (b == '-') {
				if (!isNumber(b = readByte())) {
					undo(b);
					throw new NumberFormatException();
				}
				try {
					if (b == '0') {
						if (!isNumber(b = readByte())) {
							undo(b);
							return 0;
						}
						throw new NumberFormatException();
					}
					do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte()));
					undo(b);
				} catch (NoSuchElementException e) {
				}
				return n;
			}
			if (!isNumber(b)) {
				undo(b);
				throw new NumberFormatException();
			}
			try {
				if (b == '0') {
					if (!isNumber(b = readByte())) {
						undo(b);
						return 0;
					}
					throw new NumberFormatException();
				}
				do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte()));
				undo(b);
			} catch (NoSuchElementException e) {
			}
			return n;
		}

		public final long nextLong(long min, long max) {
			long n = nextLong();
			if (min <= n && n <= max) return n;
			throw new NumberFormatException();
		}

		public final double nextDouble() {
			StringBuilder sb = new StringBuilder();
			byte b = readByte();
			if (b == '-') {
				sb.append(b);
				b = readByte();
			}
			if (b == '0') {
				sb.append(b);
				b = readByte();
			} else {
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			if (b == '.') {
				sb.append(b);
				b = readByte();
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			if (b == 'e' || b == 'E') {
				sb.append(b);
				b = readByte();
				if (b == '-' || b == '+') {
					sb.append(b);
					b = readByte();
				}
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			undo(b);
			return Double.parseDouble(sb.toString());
		}
	}
}
0