結果
問題 | No.967 引き算をして門松列(その2) |
ユーザー |
👑 |
提出日時 | 2020-01-13 20:30:30 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 153 ms / 2,000 ms |
コード長 | 2,634 bytes |
コンパイル時間 | 754 ms |
コンパイル使用メモリ | 127,808 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 04:07:56 |
合計ジャッジ時間 | 2,106 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 10 |
ソースコード
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)); }enum INF = 10L^^18;void main() {try {for (; ; ) {const numCases = readInt();foreach (caseId; 0 .. numCases) {const A = readLong();const B = readLong();const C = readLong();const X = readLong();const Y = readLong();const Z = readLong();long[] xs;xs ~= 1;xs ~= 2;xs ~= 3;foreach (x; A - 2 .. A + 2 + 1) if (x > 0) xs ~= x;foreach (x; B - 2 .. B + 2 + 1) if (x > 0) xs ~= x;foreach (x; C - 2 .. C + 2 + 1) if (x > 0) xs ~= x;xs = xs.sort.uniq.array;const xsLen = cast(int)(xs.length);debug {writeln("xs = ", xs);}long ans = INF;foreach (j; 0 .. xsLen) {// center minforeach (i; j + 1 .. xsLen) foreach (k; j + 1 .. xsLen) {if (i != k) {if (xs[i] <= A && xs[j] <= B && xs[k] <= C) {chmin(ans, X * (A - xs[i]) + Y * (B - xs[j]) + Z * (C - xs[k]));}}}// center maxforeach (i; 0 .. j) foreach (k; 0 .. j) {if (i != k) {if (xs[i] <= A && xs[j] <= B && xs[k] <= C) {chmin(ans, X * (A - xs[i]) + Y * (B - xs[j]) + Z * (C - xs[k]));}}}}writeln((ans >= INF) ? -1 : ans);}}} catch (EOFException e) {}}