結果

問題 No.409 ダイエット
ユーザー kenkooookenkoooo
提出日時 2016-08-13 07:48:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,073 bytes
コンパイル時間 3,982 ms
コンパイル使用メモリ 80,092 KB
実行使用メモリ 47,116 KB
最終ジャッジ日時 2024-11-07 16:29:15
合計ジャッジ時間 16,766 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
36,744 KB
testcase_01 AC 52 ms
36,856 KB
testcase_02 AC 50 ms
36,664 KB
testcase_03 AC 49 ms
36,660 KB
testcase_04 AC 48 ms
36,464 KB
testcase_05 AC 50 ms
36,660 KB
testcase_06 AC 48 ms
36,844 KB
testcase_07 AC 50 ms
37,012 KB
testcase_08 AC 50 ms
36,912 KB
testcase_09 AC 50 ms
37,024 KB
testcase_10 AC 50 ms
36,896 KB
testcase_11 AC 50 ms
36,892 KB
testcase_12 AC 51 ms
36,696 KB
testcase_13 AC 50 ms
36,704 KB
testcase_14 AC 49 ms
36,604 KB
testcase_15 AC 51 ms
36,700 KB
testcase_16 AC 50 ms
36,664 KB
testcase_17 AC 53 ms
36,816 KB
testcase_18 AC 51 ms
36,824 KB
testcase_19 AC 53 ms
36,828 KB
testcase_20 AC 50 ms
37,068 KB
testcase_21 AC 48 ms
36,864 KB
testcase_22 AC 48 ms
36,724 KB
testcase_23 AC 50 ms
36,664 KB
testcase_24 AC 54 ms
36,788 KB
testcase_25 AC 51 ms
36,920 KB
testcase_26 AC 51 ms
36,804 KB
testcase_27 AC 50 ms
36,444 KB
testcase_28 AC 50 ms
37,048 KB
testcase_29 AC 50 ms
36,892 KB
testcase_30 AC 53 ms
36,720 KB
testcase_31 AC 52 ms
36,740 KB
testcase_32 AC 53 ms
36,580 KB
testcase_33 AC 52 ms
36,532 KB
testcase_34 AC 52 ms
37,016 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 AC 102 ms
39,884 KB
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
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 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

public class yukicoder409 {
  private static class Task {
    class ConvexHullTrick {
      ArrayList<long[]> ls = new ArrayList<>();
      ConvexHullTrick() {
      }

      boolean check(long[] l1, long[] l2, long[] l3) {
        return (l2[0] - l1[0]) * (l3[1] - l2[1]) >=
          (l2[1] - l1[1]) * (l3[0] - l2[0]);
      }

      void add(long a, long b) {
        long[] l = new long[]{a, b};
        while (ls.size() >= 2 && check(ls.get(ls.size() - 2), ls.get(ls.size() - 1), l)) ls.remove(ls.size() - 1);
        ls.add(l);
      }

      long f(int k, long x) {
        long[] l = ls.get(k);
        return l[0] * x + l[1];
      }

      long query(long x) {
        int low = -1;
        int high = ls.size() - 1;
        while (high - low > 1) {
          int mid = (high + low) / 2;
          if (f(mid, x) >= f(mid + 1, x)) {
            low = mid;
          } else {
            high = mid;
          }
        }
        return f(high, x);
      }
    }

    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;
      }

      long[] dp = new long[N + 1];
      Arrays.fill(dp, INF);
      dp[0] = W;
      ConvexHullTrick deq = new ConvexHullTrick();
      deq.add(0, dp[0]);
      for (int i = 0; i < N; i++) {
        dp[i + 1] = D[i] - i * A + (B * i * (i + 1)) / 2 + deq.query(i);
        long a = -(i + 1) * B;
        long b = dp[i + 1] + (i + 1) * A + (B * (i + 1) * i) / 2;
        deq.add(a, b);
      }
      long res = INF;
      for (int i = 0; i <= N; i++)
        res = Math.min(res, dp[i] - A * (N - i) + B * (N - i) * (N - i + 1) / 2);
      out.println(res);

    }
  }

  /**
   * ここから下はテンプレートです。
   */
  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