結果
問題 | No.669 対決!!! 飲み比べ |
ユーザー |
![]() |
提出日時 | 2018-03-23 22:23:48 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 5,631 bytes |
コンパイル時間 | 704 ms |
コンパイル使用メモリ | 98,496 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-13 00:07:11 |
合計ジャッジ時間 | 1,437 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
/+ dub.sdl:name "D"dependency "dunkelheit" version=">=0.9.0"+/import std.stdio, std.algorithm, std.range, std.conv;// import dkh.foundation, dkh.scanner;int main() {Scanner sc = new Scanner(stdin);scope(exit) assert(!sc.hasNext);int n, k;sc.read(n, k);long[] a;sc.read(a);long grundy = a.map!(x => x%(k+1)).reduce!"a^b";if (grundy == 0) {writeln("NO");} else {writeln("YES");}return 0;}/* IMPORT /home/yosupo/Program/dunkelheit/source/dkh/container/stackpayload.d */// module dkh.container.stackpayload;struct StackPayload(T, size_t MINCAP = 4) if (MINCAP >= 1) {import core.exception : RangeError;private T* _data;private uint len, cap;@property bool empty() const { return len == 0; }@property size_t length() const { return len; }alias opDollar = length;inout(T)[] data() inout { return (_data) ? _data[0..len] : null; }ref inout(T) opIndex(size_t i) inout {version(assert) if (len <= i) throw new RangeError();return _data[i];}ref inout(T) front() inout { return this[0]; }ref inout(T) back() inout { return this[$-1]; }void reserve(size_t newCap) {import core.memory : GC;import core.stdc.string : memcpy;import std.conv : to;if (newCap <= cap) return;void* newData = GC.malloc(newCap * T.sizeof);cap = newCap.to!uint;if (len) memcpy(newData, _data, len * T.sizeof);_data = cast(T*)(newData);}void free() {import core.memory : GC;GC.free(_data);}void clear() {len = 0;}void insertBack(T item) {import std.algorithm : max;if (len == cap) reserve(max(cap * 2, MINCAP));_data[len++] = item;}alias opOpAssign(string op : "~") = insertBack;void removeBack() {assert(!empty, "StackPayload.removeBack: Stack is empty");len--;}}/* IMPORT /home/yosupo/Program/dunkelheit/source/dkh/foundation.d */// module dkh.foundation;static if (__VERSION__ <= 2070) {/*Copied by https://github.com/dlang/phobos/blob/master/std/algorithm/iteration.dCopyright: Andrei Alexandrescu 2008-.License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).*/template fold(fun...) if (fun.length >= 1) {auto fold(R, S...)(R r, S seed) {import std.algorithm : reduce;static if (S.length < 2) {return reduce!fun(seed, r);} else {import std.typecons : tuple;return reduce!fun(tuple(seed), r);}}}}/* IMPORT /home/yosupo/Program/dunkelheit/source/dkh/scanner.d */// module dkh.scanner;// import dkh.container.stackpayload;class Scanner {import std.stdio : File;import std.conv : to;import std.range : front, popFront, array, ElementType;import std.array : split;import std.traits : isSomeChar, isStaticArray, isArray;import std.algorithm : map;File f;this(File f) {this.f = f;}char[512] lineBuf;char[] line;private bool succW() {import std.range.primitives : empty, front, popFront;import std.ascii : isWhite;while (!line.empty && line.front.isWhite) {line.popFront;}return !line.empty;}private bool succ() {import std.range.primitives : empty, front, popFront;import std.ascii : isWhite;while (true) {while (!line.empty && line.front.isWhite) {line.popFront;}if (!line.empty) break;line = lineBuf[];f.readln(line);if (!line.length) return false;}return true;}private bool readSingle(T)(ref T x) {import std.algorithm : findSplitBefore;import std.string : strip;import std.conv : parse;if (!succ()) return false;static if (isArray!T) {alias E = ElementType!T;static if (isSomeChar!E) {auto r = line.findSplitBefore(" ");x = r[0].strip.dup;line = r[1];} else static if (isStaticArray!T) {foreach (i; 0..T.length) {bool f = succW();assert(f);x[i] = line.parse!E;}} else {StackPayload!E buf;while (succW()) {buf ~= line.parse!E;}x = buf.data;}} else {x = line.parse!T;}return true;}int unsafeRead(T, Args...)(ref T x, auto ref Args args) {if (!readSingle(x)) return 0;static if (args.length == 0) {return 1;} else {return 1 + read(args);}}void read(Args...)(auto ref Args args) {import std.exception;static if (args.length != 0) {enforce(readSingle(args[0]));read(args[1..$]);}}bool hasNext() {return succ();}}/*This source code generated by dunkelheit and include dunkelheit's source code.dunkelheit's Copyright: Copyright (c) 2016- Kohei Morita. (https://github.com/yosupo06/dunkelheit)dunkelheit's License: MIT License(https://github.com/yosupo06/dunkelheit/blob/master/LICENSE.txt)*/