結果
問題 | No.636 硬貨の枚数2 |
ユーザー | uwi |
提出日時 | 2018-01-19 21:32:15 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,490 bytes |
コンパイル時間 | 3,138 ms |
コンパイル使用メモリ | 80,756 KB |
実行使用メモリ | 51,688 KB |
最終ジャッジ日時 | 2023-08-26 00:02:47 |
合計ジャッジ時間 | 8,947 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
49,368 KB |
testcase_01 | AC | 36 ms
49,828 KB |
testcase_02 | AC | 37 ms
49,440 KB |
testcase_03 | AC | 37 ms
49,324 KB |
testcase_04 | AC | 36 ms
49,152 KB |
testcase_05 | AC | 35 ms
49,160 KB |
testcase_06 | AC | 36 ms
49,232 KB |
testcase_07 | AC | 34 ms
49,036 KB |
testcase_08 | AC | 36 ms
49,264 KB |
testcase_09 | AC | 38 ms
49,148 KB |
testcase_10 | AC | 37 ms
49,348 KB |
testcase_11 | AC | 37 ms
49,120 KB |
testcase_12 | AC | 36 ms
49,172 KB |
testcase_13 | AC | 36 ms
49,432 KB |
testcase_14 | WA | - |
testcase_15 | AC | 35 ms
49,376 KB |
testcase_16 | AC | 35 ms
49,600 KB |
testcase_17 | AC | 36 ms
49,184 KB |
testcase_18 | AC | 35 ms
49,324 KB |
testcase_19 | WA | - |
testcase_20 | AC | 36 ms
49,368 KB |
testcase_21 | AC | 36 ms
49,524 KB |
testcase_22 | AC | 35 ms
49,148 KB |
testcase_23 | AC | 39 ms
49,200 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
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 | AC | 47 ms
49,036 KB |
testcase_45 | AC | 47 ms
49,300 KB |
testcase_46 | AC | 47 ms
49,744 KB |
testcase_47 | AC | 45 ms
49,532 KB |
testcase_48 | AC | 44 ms
49,608 KB |
testcase_49 | AC | 43 ms
49,176 KB |
testcase_50 | AC | 43 ms
49,188 KB |
testcase_51 | AC | 43 ms
49,332 KB |
testcase_52 | AC | 44 ms
49,320 KB |
testcase_53 | AC | 44 ms
49,268 KB |
testcase_54 | AC | 37 ms
49,436 KB |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | AC | 35 ms
49,332 KB |
testcase_60 | AC | 35 ms
49,192 KB |
testcase_61 | AC | 34 ms
49,252 KB |
testcase_62 | AC | 36 ms
49,128 KB |
testcase_63 | AC | 37 ms
49,380 KB |
testcase_64 | AC | 42 ms
49,156 KB |
testcase_65 | WA | - |
testcase_66 | AC | 45 ms
49,156 KB |
testcase_67 | AC | 44 ms
50,440 KB |
testcase_68 | WA | - |
ソースコード
package contest180119; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] s = ns().toCharArray(); int n = s.length; int[] dp = new int[2]; dp[0] = 0; dp[1] = 1; int[] x = {0, 1, 2, 3, 2, 1, 2, 3, 4, 5, 1}; int[] y = {1, 2, 3, 3, 2, 1, 2, 3, 2, 1, 1}; // 100 // 87 for(int i = 0;i < n;i++){ int[] ndp = new int[2]; { int u = s[i]-'0'; ndp[0] = Math.min(dp[0] + x[u], dp[1] + y[u]); } { int u = s[i]-'0'+1; ndp[1] = Math.min(dp[0] + x[u], dp[1] + y[u]); } dp = ndp; } out.println(dp[0]); } 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 E().run(); } private byte[] inbuf = new byte[1024]; public 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)); } }