結果
問題 | No.669 対決!!! 飲み比べ |
ユーザー |
![]() |
提出日時 | 2018-12-29 11:00:36 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 127 ms / 2,000 ms |
コード長 | 4,125 bytes |
コンパイル時間 | 2,304 ms |
コンパイル使用メモリ | 78,076 KB |
実行使用メモリ | 78,364 KB |
最終ジャッジ日時 | 2024-10-01 15:08:34 |
合計ジャッジ時間 | 7,159 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
import java.io.OutputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.io.IOException;import java.io.BufferedReader;import java.io.Reader;import java.io.InputStreamReader;import java.io.InputStream;/*** Built using CHelper plug-in* Actual solution is at the top*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;MyInput in = new MyInput(inputStream);PrintWriter out = new PrintWriter(outputStream);TaskNo669 solver = new TaskNo669();solver.solve(1, in, out);out.close();}static class TaskNo669 {public void solve(int testNumber, MyInput in, PrintWriter out) {int n = in.nextInt(), k = in.nextInt();int[] a = in.nextIntArray(n);int[] gra = new int[(int) 1e7 + 1];for (int i = 0; i < (int) 1e7 + 1; i++) {gra[i] = i % (k + 1);}int nim = 0;for (int i : a) {nim ^= gra[i];}out.println(nim == 0 ? "NO" : "YES");}}static class MyInput {private final BufferedReader in;private static int pos;private static int readLen;private static final char[] buffer = new char[1024 * 8];private static char[] str = new char[500 * 8 * 2];private static boolean[] isDigit = new boolean[256];private static boolean[] isSpace = new boolean[256];private static boolean[] isLineSep = new boolean[256];static {for (int i = 0; i < 10; i++) {isDigit['0' + i] = true;}isDigit['-'] = true;isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;isLineSep['\r'] = isLineSep['\n'] = true;}public MyInput(InputStream is) {in = new BufferedReader(new InputStreamReader(is));}public int read() {if (pos >= readLen) {pos = 0;try {readLen = in.read(buffer);} catch (IOException e) {throw new RuntimeException();}if (readLen <= 0) {throw new MyInput.EndOfFileRuntimeException();}}return buffer[pos++];}public int nextInt() {int len = 0;str[len++] = nextChar();len = reads(len, isSpace);int i = 0;int ret = 0;if (str[0] == '-') {i = 1;}for (; i < len; i++)ret = ret * 10 + str[i] - '0';if (str[0] == '-') {ret = -ret;}return ret;}public char nextChar() {while (true) {final int c = read();if (!isSpace[c]) {return (char) c;}}}int reads(int len, boolean[] accept) {try {while (true) {final int c = read();if (accept[c]) {break;}if (str.length == len) {char[] rep = new char[str.length * 3 / 2];System.arraycopy(str, 0, rep, 0, str.length);str = rep;}str[len++] = (char) c;}} catch (MyInput.EndOfFileRuntimeException e) {}return len;}public int[] nextIntArray(final int n) {final int[] res = new int[n];for (int i = 0; i < n; i++) {res[i] = nextInt();}return res;}static class EndOfFileRuntimeException extends RuntimeException {}}}