結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-01-22 23:01:04 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 400 ms / 2,000 ms |
コード長 | 3,354 bytes |
コンパイル時間 | 3,537 ms |
コンパイル使用メモリ | 155,536 KB |
実行使用メモリ | 32,976 KB |
最終ジャッジ日時 | 2023-09-04 12:02:30 |
合計ジャッジ時間 | 31,453 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 200 ms
16,604 KB |
testcase_04 | AC | 203 ms
16,640 KB |
testcase_05 | AC | 185 ms
16,920 KB |
testcase_06 | AC | 184 ms
16,876 KB |
testcase_07 | AC | 273 ms
26,456 KB |
testcase_08 | AC | 272 ms
26,460 KB |
testcase_09 | AC | 77 ms
7,772 KB |
testcase_10 | AC | 76 ms
7,772 KB |
testcase_11 | AC | 355 ms
31,200 KB |
testcase_12 | AC | 347 ms
31,276 KB |
testcase_13 | AC | 224 ms
16,588 KB |
testcase_14 | AC | 223 ms
16,568 KB |
testcase_15 | AC | 200 ms
15,192 KB |
testcase_16 | AC | 201 ms
15,188 KB |
testcase_17 | AC | 371 ms
32,056 KB |
testcase_18 | AC | 378 ms
32,108 KB |
testcase_19 | AC | 324 ms
25,992 KB |
testcase_20 | AC | 326 ms
26,076 KB |
testcase_21 | AC | 351 ms
32,172 KB |
testcase_22 | AC | 347 ms
32,676 KB |
testcase_23 | AC | 231 ms
17,640 KB |
testcase_24 | AC | 233 ms
17,596 KB |
testcase_25 | AC | 38 ms
5,684 KB |
testcase_26 | AC | 37 ms
5,660 KB |
testcase_27 | AC | 123 ms
12,532 KB |
testcase_28 | AC | 123 ms
12,556 KB |
testcase_29 | AC | 152 ms
14,104 KB |
testcase_30 | AC | 151 ms
14,120 KB |
testcase_31 | AC | 202 ms
15,200 KB |
testcase_32 | AC | 201 ms
15,072 KB |
testcase_33 | AC | 151 ms
13,996 KB |
testcase_34 | AC | 150 ms
14,060 KB |
testcase_35 | AC | 197 ms
16,740 KB |
testcase_36 | AC | 197 ms
16,676 KB |
testcase_37 | AC | 40 ms
5,784 KB |
testcase_38 | AC | 40 ms
5,808 KB |
testcase_39 | AC | 32 ms
5,248 KB |
testcase_40 | AC | 33 ms
5,244 KB |
testcase_41 | AC | 70 ms
7,804 KB |
testcase_42 | AC | 70 ms
7,796 KB |
testcase_43 | AC | 56 ms
7,088 KB |
testcase_44 | AC | 366 ms
31,720 KB |
testcase_45 | AC | 157 ms
14,296 KB |
testcase_46 | AC | 53 ms
6,704 KB |
testcase_47 | AC | 264 ms
22,960 KB |
testcase_48 | AC | 242 ms
18,124 KB |
testcase_49 | AC | 248 ms
22,876 KB |
testcase_50 | AC | 192 ms
16,760 KB |
testcase_51 | AC | 10 ms
4,384 KB |
testcase_52 | AC | 327 ms
27,144 KB |
testcase_53 | AC | 375 ms
32,936 KB |
testcase_54 | AC | 392 ms
32,864 KB |
testcase_55 | AC | 388 ms
32,756 KB |
testcase_56 | AC | 394 ms
32,736 KB |
testcase_57 | AC | 397 ms
32,720 KB |
testcase_58 | AC | 392 ms
32,876 KB |
testcase_59 | AC | 389 ms
32,680 KB |
testcase_60 | AC | 379 ms
32,884 KB |
testcase_61 | AC | 364 ms
32,900 KB |
testcase_62 | AC | 386 ms
32,916 KB |
testcase_63 | AC | 389 ms
32,804 KB |
testcase_64 | AC | 393 ms
32,784 KB |
testcase_65 | AC | 386 ms
32,832 KB |
testcase_66 | AC | 386 ms
32,856 KB |
testcase_67 | AC | 400 ms
32,768 KB |
testcase_68 | AC | 380 ms
32,924 KB |
testcase_69 | AC | 359 ms
32,804 KB |
testcase_70 | AC | 364 ms
32,876 KB |
testcase_71 | AC | 351 ms
32,792 KB |
testcase_72 | AC | 397 ms
32,860 KB |
testcase_73 | AC | 385 ms
32,808 KB |
testcase_74 | AC | 392 ms
32,780 KB |
testcase_75 | AC | 384 ms
32,892 KB |
testcase_76 | AC | 381 ms
32,976 KB |
testcase_77 | AC | 381 ms
32,720 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt { static int M; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { if (a < 0) return (this = inv()^^(-a)); ModInt t2 = this, te = ModInt(1); for (long e = a; e; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } string toString() const { return x.to!string; } } void main() { try { for (; ; ) { const N = readInt(); const K = readLong(); ModInt.M = readInt(); auto A = new long[][](4, N); foreach (h; 0 .. 4) { foreach (i; 0 .. N) { A[h][i] = readLong(); } A[h].sort; } ModInt ans; foreach (i; 0 .. N) { long mn = long.max; long mx = long.min; foreach (h; 0 .. 4) { chmin(mn, A[h][i]); chmax(mx, A[h][i]); } ans += ModInt(mx - mn)^^K; } writeln(ans); } } catch (EOFException e) { } }