結果

問題 No.384 マス埋めゲーム2
ユーザー kenkooookenkoooo
提出日時 2016-07-01 23:46:04
言語 Java19
(openjdk 21)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,253 bytes
コンパイル時間 3,813 ms
コンパイル使用メモリ 74,196 KB
実行使用メモリ 49,440 KB
最終ジャッジ日時 2023-08-02 06:26:56
合計ジャッジ時間 5,812 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,200 KB
testcase_01 RE -
testcase_02 AC 40 ms
49,384 KB
testcase_03 AC 40 ms
49,316 KB
testcase_04 AC 41 ms
49,368 KB
testcase_05 AC 43 ms
49,280 KB
testcase_06 AC 43 ms
49,036 KB
testcase_07 AC 42 ms
48,992 KB
testcase_08 AC 42 ms
49,188 KB
testcase_09 AC 43 ms
49,276 KB
testcase_10 AC 42 ms
49,292 KB
testcase_11 AC 42 ms
49,384 KB
testcase_12 AC 41 ms
49,144 KB
testcase_13 AC 42 ms
49,440 KB
testcase_14 AC 42 ms
49,244 KB
testcase_15 AC 43 ms
49,160 KB
testcase_16 AC 42 ms
49,356 KB
testcase_17 AC 43 ms
48,948 KB
testcase_18 AC 42 ms
48,980 KB
testcase_19 AC 42 ms
49,416 KB
testcase_20 AC 45 ms
49,044 KB
testcase_21 AC 44 ms
49,396 KB
testcase_22 AC 45 ms
49,396 KB
testcase_23 AC 42 ms
49,276 KB
testcase_24 AC 42 ms
49,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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");
    }
  }

  // Template
  public 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;
    }
  }
}
0