結果
問題 | No.555 世界史のレポート |
ユーザー | yuya178 |
提出日時 | 2017-11-09 21:16:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 128 ms / 2,000 ms |
コード長 | 4,233 bytes |
コンパイル時間 | 2,540 ms |
コンパイル使用メモリ | 80,924 KB |
実行使用メモリ | 42,300 KB |
最終ジャッジ日時 | 2024-11-24 07:32:59 |
合計ジャッジ時間 | 5,886 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 125 ms
42,220 KB |
testcase_01 | AC | 124 ms
41,892 KB |
testcase_02 | AC | 123 ms
42,112 KB |
testcase_03 | AC | 125 ms
41,992 KB |
testcase_04 | AC | 123 ms
42,112 KB |
testcase_05 | AC | 122 ms
42,004 KB |
testcase_06 | AC | 127 ms
42,204 KB |
testcase_07 | AC | 121 ms
42,000 KB |
testcase_08 | AC | 126 ms
42,108 KB |
testcase_09 | AC | 123 ms
41,952 KB |
testcase_10 | AC | 123 ms
42,092 KB |
testcase_11 | AC | 124 ms
42,012 KB |
testcase_12 | AC | 122 ms
42,008 KB |
testcase_13 | AC | 127 ms
42,108 KB |
testcase_14 | AC | 127 ms
41,908 KB |
testcase_15 | AC | 125 ms
42,128 KB |
testcase_16 | AC | 128 ms
42,228 KB |
testcase_17 | AC | 123 ms
42,088 KB |
testcase_18 | AC | 123 ms
42,300 KB |
testcase_19 | AC | 127 ms
41,984 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; import java.util.List; import java.util.ArrayList; import java.util.Comparator; import java.util.Arrays; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1000_000_007; int inf = 10000000; int max = 1000000; void solve() { int n = ni(); int c = ni(); int v = ni(); int[] dp = new int[max]; Arrays.fill(dp,999999); dp[1] = 0; for(int i = 1; i < max; i++){ int cost = c; for(int j = i*2; j < max; j+=i){ cost += v; dp[j] = Math.min(dp[j], dp[i]+cost); } } int ans = inf; for(int i = n; i < max; i++){ ans = Math.min(dp[i],ans); } out.println(ans); } 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"); } public static void main(String[] args) throws Exception { new Main().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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }