Submission #3324193

---

Source Code Expand

import java.util.*;
import java.awt.*;
import static java.lang.System.*;
import static java.lang.Math.*;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(in);
        int N=sc.nextInt();
        int H=sc.nextInt();
        int A=sc.nextInt();
        int B=sc.nextInt();
        int C=sc.nextInt();
        int D=sc.nextInt();
        int E=sc.nextInt();
        int ans=Integer.MAX_VALUE;
        Queue<Point> q=new ArrayDeque<>();
        Queue<Integer> d=new ArrayDeque<>();
        q.add(new Point(H,0));
        d.add(0);
        while(!q.isEmpty()){
            Point p=q.poll();
            int ManpukuP=p.x;
            int Shokuhi=p.y;
            int day=d.poll()+1;
            q.add(new Point(ManpukuP+B,Shokuhi+A));
            d.add(day);
            q.add(new Point(ManpukuP+D,Shokuhi+C));
            d.add(day);
            if(ManpukuP-E>0){
                q.add(new Point(ManpukuP-E,Shokuhi));
                d.add(day);
            }
            if(day-1==N){
                ans=min(ans,p.y);
            }
            if(day>N+1)break;
        }
        out.println(ans);
    }
}

Submission Info

Judge Result