結果

問題 No.409 ダイエット
ユーザー kenkooookenkoooo
提出日時 2016-08-13 05:49:56
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,057 bytes
コンパイル時間 4,339 ms
コンパイル使用メモリ 74,916 KB
実行使用メモリ 57,120 KB
最終ジャッジ日時 2023-08-07 12:28:04
合計ジャッジ時間 56,478 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,296 KB
testcase_01 AC 42 ms
49,556 KB
testcase_02 AC 41 ms
49,396 KB
testcase_03 AC 40 ms
49,332 KB
testcase_04 AC 41 ms
49,316 KB
testcase_05 AC 42 ms
49,204 KB
testcase_06 AC 42 ms
49,368 KB
testcase_07 AC 41 ms
49,252 KB
testcase_08 AC 42 ms
49,728 KB
testcase_09 AC 42 ms
49,388 KB
testcase_10 AC 41 ms
49,308 KB
testcase_11 AC 42 ms
49,196 KB
testcase_12 AC 42 ms
49,892 KB
testcase_13 AC 41 ms
49,364 KB
testcase_14 AC 42 ms
49,348 KB
testcase_15 AC 40 ms
49,356 KB
testcase_16 AC 40 ms
49,328 KB
testcase_17 AC 41 ms
49,432 KB
testcase_18 AC 41 ms
49,272 KB
testcase_19 AC 41 ms
49,548 KB
testcase_20 AC 44 ms
49,308 KB
testcase_21 AC 41 ms
49,204 KB
testcase_22 AC 41 ms
49,360 KB
testcase_23 AC 40 ms
49,392 KB
testcase_24 AC 40 ms
49,744 KB
testcase_25 AC 41 ms
49,196 KB
testcase_26 AC 42 ms
49,200 KB
testcase_27 AC 43 ms
49,224 KB
testcase_28 AC 41 ms
49,540 KB
testcase_29 AC 41 ms
49,520 KB
testcase_30 AC 42 ms
49,204 KB
testcase_31 AC 41 ms
49,440 KB
testcase_32 AC 41 ms
49,364 KB
testcase_33 AC 42 ms
49,456 KB
testcase_34 AC 41 ms
49,308 KB
testcase_35 AC 96 ms
54,496 KB
testcase_36 AC 96 ms
54,332 KB
testcase_37 AC 97 ms
54,024 KB
testcase_38 AC 97 ms
54,300 KB
testcase_39 AC 97 ms
54,336 KB
testcase_40 AC 100 ms
54,040 KB
testcase_41 WA -
testcase_42 AC 100 ms
54,316 KB
testcase_43 WA -
testcase_44 AC 97 ms
54,564 KB
testcase_45 WA -
testcase_46 AC 100 ms
54,200 KB
testcase_47 AC 100 ms
54,560 KB
testcase_48 AC 97 ms
54,136 KB
testcase_49 WA -
testcase_50 AC 97 ms
54,352 KB
testcase_51 AC 98 ms
54,272 KB
testcase_52 WA -
testcase_53 AC 100 ms
54,336 KB
testcase_54 AC 95 ms
54,272 KB
testcase_55 AC 889 ms
54,800 KB
testcase_56 AC 93 ms
52,924 KB
testcase_57 AC 1,720 ms
54,892 KB
testcase_58 AC 793 ms
54,576 KB
testcase_59 AC 1,098 ms
55,220 KB
testcase_60 AC 715 ms
55,308 KB
testcase_61 AC 1,514 ms
54,920 KB
testcase_62 AC 1,628 ms
54,848 KB
testcase_63 AC 1,514 ms
54,688 KB
testcase_64 AC 846 ms
54,636 KB
testcase_65 AC 1,569 ms
54,612 KB
testcase_66 AC 1,684 ms
54,896 KB
testcase_67 AC 1,314 ms
54,652 KB
testcase_68 AC 1,079 ms
55,416 KB
testcase_69 AC 1,485 ms
54,516 KB
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 AC 1,618 ms
55,056 KB
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 AC 837 ms
54,976 KB
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
testcase_81 WA -
testcase_82 WA -
testcase_83 WA -
testcase_84 WA -
testcase_85 WA -
testcase_86 AC 1,082 ms
54,984 KB
testcase_87 WA -
testcase_88 WA -
testcase_89 AC 1,222 ms
55,084 KB
testcase_90 AC 608 ms
55,248 KB
testcase_91 AC 1,298 ms
54,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

/*
                   _ooOoo_
                  o8888888o
                  88" . "88
                  (| -_- |)
                  O\  =  /O
               ____/`---'\____
             .'  \\|     |//  `.
            /  \\|||  :  |||//  \
           /  _||||| -:- |||||-  \
           |   | \\\  -  /// |   |
           | \_|  ''\---/''  |   |
           \  .-\__  `-`  ___/-. /
         ___`. .'  /--.--\  `. . __
      ."" '<  `.___\_<|>_/___.'  >'"".
     | | :  `- \`.;`\ _ /`;.`/ - ` : | |
     \  \ `-.   \_ __\ /__ _/   .-` /  /
======`-.____`-.___\_____/___.-`____.-'======
                   `=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
            pass System Test!
*/

public class yukicoder409 {
  private static class Task {
    final int INF = (int) 1e9;
    void solve(FastScanner in, PrintWriter out) {
      int N = in.nextInt();
      int A = in.nextInt();
      int B = in.nextInt();
      int W = in.nextInt();
      int[] D = in.nextIntArray(N);

      if (B == 0) {
        out.println(W - A * N);
        return;
      }

      long[] dp = new long[1001];
      Arrays.fill(dp, INF);
      dp[0] = 0;
      for (int i = 0; i < N; i++) {
        long[] next = new long[1001];
        Arrays.fill(next, INF);
        for (int j = 0; j < 1000; j++) {
          next[0] = Math.min(next[0], dp[j] + D[i]);
          next[j + 1] = Math.min(next[j + 1], dp[j] + B * (j + 1) - A);
        }
        dp = next;
      }

      long ans = INF;
      for (long d : dp) ans = Math.min(ans, d);
      out.println(ans + W);
    }
  }

  /**
   * ここから下はテンプレートです。
   */
  public static void main(String[] args) {
    OutputStream outputStream = System.out;
    FastScanner in = new FastScanner();
    PrintWriter out = new PrintWriter(outputStream);
    Task solver = new Task();
    solver.solve(in, out);
    out.close();
  }
  private static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int bufferLength = 0;

    private boolean hasNextByte() {
      if (ptr < bufferLength) {
        return true;
      } else {
        ptr = 0;
        try {
          bufferLength = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (bufferLength <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    double nextDouble() {
      return Double.parseDouble(next());
    }

    double[] nextDoubleArray(int n) {
      double[] array = new double[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextDouble();
      }
      return array;
    }

    double[][] nextDoubleMap(int n, int m) {
      double[][] map = new double[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextDoubleArray(m);
      }
      return map;
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int n) {
      int[] array = new int[n];
      for (int i = 0; i < n; i++) array[i] = nextInt();
      return array;
    }

    public long[] nextLongArray(int n) {
      long[] array = new long[n];
      for (int i = 0; i < n; i++) array[i] = nextLong();
      return array;
    }

    public String[] nextStringArray(int n) {
      String[] array = new String[n];
      for (int i = 0; i < n; i++) array[i] = next();
      return array;
    }

    public char[][] nextCharMap(int n) {
      char[][] array = new char[n][];
      for (int i = 0; i < n; i++) array[i] = next().toCharArray();
      return array;
    }
  }
}
0