結果
問題 | No.409 ダイエット |
ユーザー | uwi |
提出日時 | 2016-08-06 00:58:46 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,929 bytes |
コンパイル時間 | 3,416 ms |
コンパイル使用メモリ | 85,060 KB |
実行使用メモリ | 46,768 KB |
最終ジャッジ日時 | 2024-04-24 16:04:29 |
合計ジャッジ時間 | 13,338 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
36,896 KB |
testcase_01 | AC | 44 ms
37,024 KB |
testcase_02 | AC | 44 ms
36,624 KB |
testcase_03 | AC | 45 ms
36,924 KB |
testcase_04 | AC | 46 ms
36,824 KB |
testcase_05 | AC | 45 ms
37,064 KB |
testcase_06 | AC | 46 ms
37,132 KB |
testcase_07 | AC | 45 ms
36,848 KB |
testcase_08 | AC | 45 ms
37,076 KB |
testcase_09 | AC | 46 ms
36,848 KB |
testcase_10 | AC | 46 ms
36,796 KB |
testcase_11 | AC | 46 ms
37,112 KB |
testcase_12 | AC | 46 ms
37,060 KB |
testcase_13 | AC | 46 ms
36,912 KB |
testcase_14 | AC | 47 ms
36,844 KB |
testcase_15 | RE | - |
testcase_16 | AC | 51 ms
36,744 KB |
testcase_17 | AC | 45 ms
36,736 KB |
testcase_18 | AC | 47 ms
36,880 KB |
testcase_19 | AC | 49 ms
37,080 KB |
testcase_20 | AC | 45 ms
36,904 KB |
testcase_21 | AC | 46 ms
36,736 KB |
testcase_22 | AC | 47 ms
37,036 KB |
testcase_23 | AC | 46 ms
36,748 KB |
testcase_24 | AC | 46 ms
36,932 KB |
testcase_25 | AC | 46 ms
36,864 KB |
testcase_26 | AC | 46 ms
37,012 KB |
testcase_27 | AC | 45 ms
37,116 KB |
testcase_28 | AC | 46 ms
36,476 KB |
testcase_29 | AC | 47 ms
36,964 KB |
testcase_30 | AC | 47 ms
36,824 KB |
testcase_31 | AC | 47 ms
36,968 KB |
testcase_32 | AC | 52 ms
36,788 KB |
testcase_33 | AC | 46 ms
36,996 KB |
testcase_34 | AC | 47 ms
36,496 KB |
testcase_35 | AC | 49 ms
36,492 KB |
testcase_36 | AC | 52 ms
36,972 KB |
testcase_37 | AC | 50 ms
37,112 KB |
testcase_38 | AC | 51 ms
36,984 KB |
testcase_39 | AC | 50 ms
36,788 KB |
testcase_40 | AC | 49 ms
36,992 KB |
testcase_41 | AC | 49 ms
36,964 KB |
testcase_42 | AC | 49 ms
37,244 KB |
testcase_43 | AC | 50 ms
37,256 KB |
testcase_44 | AC | 49 ms
36,844 KB |
testcase_45 | AC | 50 ms
37,136 KB |
testcase_46 | AC | 51 ms
37,036 KB |
testcase_47 | AC | 49 ms
36,988 KB |
testcase_48 | AC | 50 ms
36,712 KB |
testcase_49 | AC | 52 ms
37,200 KB |
testcase_50 | AC | 52 ms
36,744 KB |
testcase_51 | AC | 49 ms
37,112 KB |
testcase_52 | AC | 50 ms
37,048 KB |
testcase_53 | AC | 50 ms
37,164 KB |
testcase_54 | AC | 49 ms
37,140 KB |
testcase_55 | AC | 118 ms
44,016 KB |
testcase_56 | RE | - |
testcase_57 | AC | 135 ms
46,768 KB |
testcase_58 | AC | 119 ms
42,264 KB |
testcase_59 | AC | 132 ms
45,236 KB |
testcase_60 | AC | 110 ms
41,440 KB |
testcase_61 | AC | 134 ms
45,876 KB |
testcase_62 | AC | 133 ms
46,112 KB |
testcase_63 | AC | 135 ms
45,656 KB |
testcase_64 | AC | 123 ms
44,048 KB |
testcase_65 | AC | 138 ms
46,280 KB |
testcase_66 | AC | 138 ms
46,644 KB |
testcase_67 | AC | 134 ms
45,228 KB |
testcase_68 | AC | 138 ms
45,224 KB |
testcase_69 | AC | 133 ms
45,672 KB |
testcase_70 | AC | 137 ms
45,212 KB |
testcase_71 | AC | 125 ms
43,820 KB |
testcase_72 | AC | 143 ms
46,724 KB |
testcase_73 | AC | 138 ms
46,068 KB |
testcase_74 | AC | 127 ms
44,788 KB |
testcase_75 | AC | 145 ms
46,444 KB |
testcase_76 | AC | 128 ms
44,372 KB |
testcase_77 | AC | 124 ms
42,124 KB |
testcase_78 | AC | 124 ms
44,304 KB |
testcase_79 | AC | 116 ms
42,004 KB |
testcase_80 | AC | 149 ms
46,348 KB |
testcase_81 | AC | 148 ms
46,088 KB |
testcase_82 | AC | 134 ms
44,180 KB |
testcase_83 | AC | 148 ms
44,996 KB |
testcase_84 | AC | 139 ms
45,064 KB |
testcase_85 | AC | 71 ms
38,292 KB |
testcase_86 | AC | 130 ms
44,908 KB |
testcase_87 | AC | 138 ms
45,104 KB |
testcase_88 | AC | 115 ms
41,352 KB |
testcase_89 | AC | 141 ms
44,468 KB |
testcase_90 | AC | 111 ms
41,092 KB |
testcase_91 | AC | 143 ms
45,144 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class N409 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); long a = ni(), b = ni(), w = ni(); int[] d = Arrays.copyOf(na(n), n+1); long[] dp = new long[n+2]; dp[0] = w; // dp+b(x-t)(x-t-1)/2-a(x-t) // b/2*x^2+x((-bt-bt+b)/2-a)+dp+bt(t+1)/2+at int[] q = new int[n+2]; long[] qw = new long[n+2]; int qp = 0; for(int i = 1;i <= n+1;i++){ int x = i-1; long B = -b*x; long C = dp[x] + b*x*(x+1)/2+a*x; long lwhen = -9999999; while(qp > 0){ int lx = q[qp-1]; long LB = -b*lx; long LC = dp[lx] + b*lx*(lx+1)/2+a*lx; // B*x+C <= LB*x+LC long when = (C-LC+(LB-B-1))/(LB-B); if(qw[qp-1] >= when){ qp--; }else{ lwhen = when; break; } } q[qp] = x; qw[qp] = lwhen; qp++; int ind = Arrays.binarySearch(qw, 0, qp, i); if(ind < 0)ind = -ind-2; x = q[ind]; long val = dp[x] + b*(i-x)*(i-x-1)/2 - a*(i-x-1); dp[i] = val + d[i-1]; } out.println(dp[n+1]); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N409().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }