結果
問題 | No.27 板の準備 |
ユーザー | yuya178 |
提出日時 | 2017-11-06 22:40:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 73 ms / 5,000 ms |
コード長 | 4,504 bytes |
コンパイル時間 | 2,417 ms |
コンパイル使用メモリ | 88,948 KB |
実行使用メモリ | 52,760 KB |
最終ジャッジ日時 | 2023-08-27 04:48:00 |
合計ジャッジ時間 | 4,703 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
51,464 KB |
testcase_01 | AC | 72 ms
51,532 KB |
testcase_02 | AC | 72 ms
51,824 KB |
testcase_03 | AC | 72 ms
51,544 KB |
testcase_04 | AC | 63 ms
51,448 KB |
testcase_05 | AC | 61 ms
51,524 KB |
testcase_06 | AC | 72 ms
51,356 KB |
testcase_07 | AC | 73 ms
51,560 KB |
testcase_08 | AC | 73 ms
51,384 KB |
testcase_09 | AC | 73 ms
51,332 KB |
testcase_10 | AC | 60 ms
51,392 KB |
testcase_11 | AC | 72 ms
51,380 KB |
testcase_12 | AC | 73 ms
51,436 KB |
testcase_13 | AC | 72 ms
51,344 KB |
testcase_14 | AC | 72 ms
51,820 KB |
testcase_15 | AC | 59 ms
51,416 KB |
testcase_16 | AC | 73 ms
52,760 KB |
testcase_17 | AC | 72 ms
51,448 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; public class Main { InputStream is; PrintWriter out; String INPUT = ""; int MOD = 1000000007; int inf = 10000000; void solve() { int[] v = new int[4]; for(int i = 0; i < 4; i++){ v[i] = ni(); } int ans = inf; int[] dp = new int[100]; for(int a = 1; a <= 30; a++){ for(int b = a+1; b <= 30; b++){ for(int c = b+1; c <= 30; c++){ Arrays.fill(dp,inf); dp[0] = 0; for(int j = 0; j <= 30; j++){ dp[j+a] = Math.min(dp[j+a], dp[j]+1); } for(int j = 0; j <= 30; j++){ dp[j+b] = Math.min(dp[j+b], dp[j]+1); } for(int j = 0; j <= 30; j++){ dp[j+c] = Math.min(dp[j+c], dp[j]+1); } ans = Math.min(ans,dp[v[0]]+dp[v[1]]+dp[v[2]]+dp[v[3]]); } } } 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); } } }