結果
問題 | No.2104 Multiply-Add |
ユーザー |
👑 |
提出日時 | 2022-10-22 01:42:51 |
言語 | D (dmd 2.109.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,396 bytes |
コンパイル時間 | 891 ms |
コンパイル使用メモリ | 130,748 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-22 16:25:41 |
合計ジャッジ時間 | 4,799 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 2 |
other | AC * 10 WA * 22 |
ソースコード
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)); }alias Op = Tuple!(int, "typ", long, "k");alias Result = Tuple!(long, "g", Op[], "ops");Result solve(long a, long b) {Op[] ops;for (; ; ) {if (a == 0) {// (0, b)ops ~= Op(1, 1);// (b, b)ops ~= Op(2, -1);// (b, 0)swap(a, b);break;} else {const k = b / a;b %= a;ops ~= Op(2, -k);}if (b == 0) {// (a, 0)break;} else {const k = a / b;a %= b;ops ~= Op(1, -k);}}// (a, 0)if (a < 0) {// (a, 0)ops ~= Op(2, 1);// (a, a)ops ~= Op(1, -2);// (-a, a)ops ~= Op(2, 1);// (-a, 0)a = -a;}return Result(a, ops);}void main() {try {for (; ; ) {const A = readLong;const B = readLong;const C = readLong;const D = readLong;auto resAB = solve(A, B);auto resCD = solve(C, D);if (resAB.g == resCD.g) {writeln(resAB.ops.length + resCD.ops.length);foreach (ref op; resAB.ops) writeln(op.typ, " ", op.k);foreach_reverse (ref op; resCD.ops) writeln(1 ^ 2 ^ op.typ, " ", op.k);} else {writeln(-1);}}} catch (EOFException e) {}}