結果
問題 | No.384 マス埋めゲーム2 |
ユーザー |
![]() |
提出日時 | 2016-07-01 23:46:04 |
言語 | Java (openjdk 23) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,253 bytes |
コンパイル時間 | 4,117 ms |
コンパイル使用メモリ | 77,848 KB |
実行使用メモリ | 36,676 KB |
最終ジャッジ日時 | 2024-10-12 01:25:31 |
合計ジャッジ時間 | 6,147 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 RE * 1 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.io.OutputStream;import java.io.PrintWriter;import java.util.NoSuchElementException;public class yukicoder384 {private static class Task {void solve(FastScanner in, PrintWriter out) {int H = in.nextInt(), W = in.nextInt(), N = in.nextInt(), K = in.nextInt();if ((H - 1 + W) % N == K % N) {out.println("YES");} else out.println("NO");}}// Templatepublic static void main(String[] args) {OutputStream outputStream = System.out;FastScanner in = new FastScanner();PrintWriter out = new PrintWriter(outputStream);Task solver = new Task();solver.solve(in, out);out.close();}private static class FastScanner {private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int bufferLength = 0;private boolean hasNextByte() {if (ptr < bufferLength) {return true;} else {ptr = 0;try {bufferLength = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (bufferLength <= 0) {return false;}}return true;}private int readByte() {if (hasNextByte()) return buffer[ptr++];else return -1;}private static boolean isPrintableChar(int c) {return 33 <= c && c <= 126;}private void skipUnprintable() {while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}boolean hasNext() {skipUnprintable();return hasNextByte();}public String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while (isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while (true) {if ('0' <= b && b <= '9') {n *= 10;n += b - '0';} else if (b == -1 || !isPrintableChar(b)) {return minus ? -n : n;} else {throw new NumberFormatException();}b = readByte();}}double nextDouble() {return Double.parseDouble(next());}double[] nextDoubleArray(int n) {double[] array = new double[n];for (int i = 0; i < n; i++) {array[i] = nextDouble();}return array;}double[][] nextDoubleMap(int n, int m) {double[][] map = new double[n][];for (int i = 0; i < n; i++) {map[i] = nextDoubleArray(m);}return map;}public int nextInt() {return (int) nextLong();}public int[] nextIntArray(int n) {int[] array = new int[n];for (int i = 0; i < n; i++) {array[i] = nextInt();}return array;}}}