提出 #31239434

---

ソースコード 拡げる

import java.io.*;
import java.util.*;

public class Main {

    static Scanner sc;
    static PrintWriter out;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        out = new PrintWriter(System.out);
        new Main().solve();
        out.flush();
    }

    public void solve() {
        int n = sc.nextInt();
        for(int i=0; i<n; i++) {
            out.println(solve2());
        }
    }

    long solve2() {
        long n = sc.nextInt();
        long a = sc.nextInt();
        long b = sc.nextInt();
        long x = sc.nextInt();
        long y = sc.nextInt();
        long z = sc.nextInt();

        if(a * x <= y && b * x <= z) {
            return n * x;
        }
        if(a * x <= y) {
            return (n / b) * z + (n % b) * x;
        }
        if(b * x <= z) {
            return (n / a) * y + (n % a) * x;
        }
        if(y*b > a*z) {
            long yy = y;
            long aa = a;
            y = z;
            a = b;
            z = yy;
            b = aa;
        }
        long min = x * n;
        long num = n / a * a;

        int it = 0;
        while(num >= 0 && it < 100000) {
            long rem = n - num;
            long c = (num / a) * y + rem / b * z + rem % b * x;
            min = Math.min(min, c);
            num -= a;
            it ++;
        }
        return min;

    }

}

提出情報

ジャッジ結果