結果

問題 No.409 ダイエット
ユーザー kenkooookenkoooo
提出日時 2016-08-13 05:59:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,360 ms / 2,000 ms
コード長 5,134 bytes
コンパイル時間 4,455 ms
コンパイル使用メモリ 74,500 KB
実行使用メモリ 53,876 KB
最終ジャッジ日時 2023-09-08 17:07:12
合計ジャッジ時間 46,104 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,232 KB
testcase_01 AC 44 ms
49,496 KB
testcase_02 AC 44 ms
49,116 KB
testcase_03 AC 43 ms
49,224 KB
testcase_04 AC 44 ms
49,352 KB
testcase_05 AC 44 ms
49,220 KB
testcase_06 AC 44 ms
49,356 KB
testcase_07 AC 43 ms
49,352 KB
testcase_08 AC 44 ms
49,404 KB
testcase_09 AC 44 ms
49,352 KB
testcase_10 AC 43 ms
49,028 KB
testcase_11 AC 45 ms
49,292 KB
testcase_12 AC 44 ms
49,356 KB
testcase_13 AC 42 ms
49,212 KB
testcase_14 AC 43 ms
49,240 KB
testcase_15 AC 43 ms
49,216 KB
testcase_16 AC 45 ms
49,228 KB
testcase_17 AC 43 ms
49,312 KB
testcase_18 AC 42 ms
49,032 KB
testcase_19 AC 42 ms
49,360 KB
testcase_20 AC 43 ms
49,288 KB
testcase_21 AC 42 ms
49,176 KB
testcase_22 AC 41 ms
49,204 KB
testcase_23 AC 43 ms
49,212 KB
testcase_24 AC 43 ms
49,352 KB
testcase_25 AC 44 ms
49,404 KB
testcase_26 AC 43 ms
49,116 KB
testcase_27 AC 44 ms
49,184 KB
testcase_28 AC 43 ms
49,224 KB
testcase_29 AC 44 ms
49,592 KB
testcase_30 AC 44 ms
49,352 KB
testcase_31 AC 44 ms
49,212 KB
testcase_32 AC 44 ms
49,408 KB
testcase_33 AC 43 ms
49,352 KB
testcase_34 AC 44 ms
49,116 KB
testcase_35 AC 96 ms
52,336 KB
testcase_36 AC 99 ms
52,176 KB
testcase_37 AC 97 ms
52,364 KB
testcase_38 AC 93 ms
52,228 KB
testcase_39 AC 96 ms
52,588 KB
testcase_40 AC 99 ms
52,176 KB
testcase_41 AC 101 ms
51,936 KB
testcase_42 AC 94 ms
52,164 KB
testcase_43 AC 93 ms
52,096 KB
testcase_44 AC 97 ms
52,228 KB
testcase_45 AC 98 ms
52,160 KB
testcase_46 AC 96 ms
52,180 KB
testcase_47 AC 96 ms
52,192 KB
testcase_48 AC 95 ms
52,236 KB
testcase_49 AC 100 ms
52,492 KB
testcase_50 AC 96 ms
51,980 KB
testcase_51 AC 100 ms
52,024 KB
testcase_52 AC 98 ms
52,204 KB
testcase_53 AC 97 ms
52,244 KB
testcase_54 AC 93 ms
52,488 KB
testcase_55 AC 714 ms
52,612 KB
testcase_56 AC 93 ms
52,644 KB
testcase_57 AC 1,359 ms
52,960 KB
testcase_58 AC 644 ms
52,520 KB
testcase_59 AC 873 ms
52,784 KB
testcase_60 AC 582 ms
53,204 KB
testcase_61 AC 1,223 ms
52,792 KB
testcase_62 AC 1,285 ms
51,184 KB
testcase_63 AC 1,201 ms
52,812 KB
testcase_64 AC 693 ms
52,700 KB
testcase_65 AC 1,254 ms
52,852 KB
testcase_66 AC 1,324 ms
52,816 KB
testcase_67 AC 1,049 ms
52,724 KB
testcase_68 AC 876 ms
53,052 KB
testcase_69 AC 1,186 ms
52,532 KB
testcase_70 AC 1,124 ms
53,100 KB
testcase_71 AC 683 ms
52,708 KB
testcase_72 AC 1,360 ms
52,652 KB
testcase_73 AC 1,253 ms
52,840 KB
testcase_74 AC 831 ms
53,332 KB
testcase_75 AC 1,262 ms
53,876 KB
testcase_76 AC 946 ms
52,700 KB
testcase_77 AC 660 ms
52,496 KB
testcase_78 AC 749 ms
53,040 KB
testcase_79 AC 615 ms
52,688 KB
testcase_80 AC 1,294 ms
52,588 KB
testcase_81 AC 1,247 ms
53,768 KB
testcase_82 AC 958 ms
52,712 KB
testcase_83 AC 1,023 ms
52,740 KB
testcase_84 AC 854 ms
52,628 KB
testcase_85 AC 190 ms
52,840 KB
testcase_86 AC 839 ms
52,584 KB
testcase_87 AC 1,133 ms
52,908 KB
testcase_88 AC 521 ms
52,548 KB
testcase_89 AC 959 ms
53,112 KB
testcase_90 AC 497 ms
52,796 KB
testcase_91 AC 1,036 ms
52,888 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 long INF = (long) 1e18;
    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;
      }

      final int width = 1007;

      long[][] dps = new long[2][width + 1];
      Arrays.fill(dps[0], INF);
      dps[0][0] = 0;
      for (int i = 0; i < N; i++) {
        long[] dp = dps[i % 2];
        long[] next = dps[(i + 1) % 2];
        Arrays.fill(next, INF);
        for (int j = 0; j < width; 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);
        }
      }

      long ans = INF;
      for (long d : dps[N % 2]) 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