結果

問題 No.2390 Udon Coupon (Hard)
ユーザー 👑 Mizar
提出日時 2023-07-03 20:00:17
言語 JavaScript
(node v23.5.0)
結果
AC  
実行時間 413 ms / 2,000 ms
コード長 2,876 bytes
コンパイル時間 194 ms
コンパイル使用メモリ 5,376 KB
実行使用メモリ 43,348 KB
最終ジャッジ日時 2024-10-06 01:33:24
合計ジャッジ時間 7,966 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff # 

const b64str = 'AGFzbQEAAAABDAFgB35+fn5+fn4BfgMCAQAFAwEAEQcSAgZtZW1vcnkCAAVzb2x2ZQAACuEEAd4EAgF/Cn4CQCABUA0AIABCAFMNACABIAR+Ig9CAVMNACABIAZ+IhBCAFcEQCAAIAN9IQkgBCEIA0AgCCAPWQ0CIAQgCHwhCCAJQn9VIAkgA30hCQ0ACwwBC0IAIAV9IREgACEKA0BCACEJIAohCANAAkAgDiAJIAt8IAggAX8gAn58IgwgDiAMVRshDiAGIAl8IgkgEFkNACAIIBF8IAggBX0hCEJ/VQ0BCwsgBCALfCILIA9ZDQEgCiADfSIKQn9VDQALCwJAIANQDQAgAEIAUw0AIAMgBn4iD0IBUw0AQgAhCyACIAN+IhBCAFcEQCAAIAV9IQkgBiEIA0AgCCAPWQ0CIAYgCHwhCCAJQn9VIAkgBX0hCQ0ACwwBC0IAIAF9IREgACEKA0BCACEJIAohCANAAkAgDSAJIAt8IAggA38gBH58IgwgDSAMVRshDSACIAl8IgkgEFkNACAIIBF8IAggAX0hCEJ/VQ0BCwsgBiALfCILIA9ZDQEgCiAFfSIKQn9VDQALC0IAIQkCQCAFUCAAQgBTcg0AIAIgBX4iD0IBUw0AQgAhCyAEIAV+IhBCAFcEQCAAIAF9IQogAiEIA0AgCCAPWQ0CIAIgCHwhCCAKQn9VIAogAX0hCg0ACwwBC0IAIAN9IREDQEIAIQogACEIA0ACQCAJIAogC3wgCCAFfyAGfnwiDCAJIAxVGyEJIAQgCnwiCiAQWQ0AIAggEXwgCCADfSEIQn9VDQELCyACIAt8IgsgD1kNASAAIAF9IgBCf1UNAAsLIA4gDSAOIA1VGyIAIAkgACAJVRsLAG8JcHJvZHVjZXJzAghsYW5ndWFnZQEEUnVzdAAMcHJvY2Vzc2VkLWJ5AwVydXN0Yx0xLjcwLjAgKDkwYzU0MTgwNiAyMDIzLTA1LTMxKQZ3YWxydXMGMC4xOS4wDHdhc20tYmluZGdlbgYwLjIuODcALA90YXJnZXRfZmVhdHVyZXMCKw9tdXRhYmxlLWdsb2JhbHMrCHNpZ24tZXh0';
let imports = {};
let wasm;
//const bytes = Buffer.from(b64str, 'base64');
const bytes = Uint8Array.from([...atob(b64str)].map(s=>s.charCodeAt(0)));
const wasmModule = new WebAssembly.Module(bytes);
const wasmInstance = new WebAssembly.Instance(wasmModule, imports);
wasm = wasmInstance.exports;

let l = require("fs").readFileSync("/dev/stdin", "utf8").trim().split("\n");
let n = BigInt(l[0]);
let [a1, b1] = l[1].split(" ").map(s => BigInt(s));
let [a2, b2] = l[2].split(" ").map(s => BigInt(s));
let [a3, b3] = l[3].split(" ").map(s => BigInt(s));

console.log(wasm.solve(n,a1,b1,a2,b2,a3,b3).toString());

/*

// WebAssembly Source Code (Rust):

use wasm_bindgen::prelude::*;

#[wasm_bindgen]
pub fn solve(n: i64, a1: i64, b1: i64, a2: i64, b2: i64, a3: i64, b3: i64) -> i64 {
    co_solve(n as i64, [(a1, b1), (a2, b2), (a3, b3)])
        .max(co_solve(n as i64, [(a2, b2), (a3, b3), (a1, b1)]))
        .max(co_solve(n as i64, [(a3, b3), (a1, b1), (a2, b2)]))
}

fn co_solve(n: i64, ab: [(i64, i64); 3]) -> i64 {
    let [(ap, bp), (aq, bq), (ar, br)] = ab;
    if ap == 0 {
        return 0;
    }
    let (imax, jmax) = (ap * bq, ap * br);
    let (mut r, mut i, mut di) = (0, 0, n);
    while i < imax && di >= 0 {
        let (mut j, mut dj) = (0, di);
        while j < jmax && dj >= 0 {
            r.chmax(dj / ap * bp + i + j);
            dj -= ar;
            j += br;
        }
        di -= aq;
        i += bq;
    }
    r
}

trait Change {
    fn chmax(&mut self, x: Self);
    fn chmin(&mut self, x: Self);
}
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) {
        if *self < x {
            *self = x;
        }
    }
    fn chmin(&mut self, x: T) {
        if *self > x {
            *self = x;
        }
    }
}


*/
0