結果

問題 No.636 硬貨の枚数2
ユーザー OlandOland
提出日時 2020-02-27 18:08:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 90 ms / 2,000 ms
コード長 7,383 bytes
コンパイル時間 2,840 ms
コンパイル使用メモリ 83,980 KB
実行使用メモリ 51,592 KB
最終ジャッジ日時 2024-10-13 15:59:17
合計ジャッジ時間 9,025 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
50,696 KB
testcase_01 AC 58 ms
50,452 KB
testcase_02 AC 58 ms
50,616 KB
testcase_03 AC 58 ms
50,700 KB
testcase_04 AC 58 ms
50,592 KB
testcase_05 AC 58 ms
50,596 KB
testcase_06 AC 57 ms
50,660 KB
testcase_07 AC 58 ms
50,424 KB
testcase_08 AC 57 ms
50,304 KB
testcase_09 AC 55 ms
50,472 KB
testcase_10 AC 56 ms
50,620 KB
testcase_11 AC 57 ms
50,612 KB
testcase_12 AC 58 ms
50,600 KB
testcase_13 AC 55 ms
50,708 KB
testcase_14 AC 61 ms
50,616 KB
testcase_15 AC 58 ms
50,592 KB
testcase_16 AC 61 ms
50,240 KB
testcase_17 AC 61 ms
50,216 KB
testcase_18 AC 58 ms
50,620 KB
testcase_19 AC 57 ms
50,616 KB
testcase_20 AC 58 ms
50,624 KB
testcase_21 AC 58 ms
50,604 KB
testcase_22 AC 57 ms
50,604 KB
testcase_23 AC 54 ms
50,552 KB
testcase_24 AC 76 ms
50,984 KB
testcase_25 AC 75 ms
51,228 KB
testcase_26 AC 60 ms
50,400 KB
testcase_27 AC 72 ms
50,808 KB
testcase_28 AC 61 ms
50,920 KB
testcase_29 AC 75 ms
51,228 KB
testcase_30 AC 67 ms
50,596 KB
testcase_31 AC 75 ms
51,120 KB
testcase_32 AC 63 ms
50,800 KB
testcase_33 AC 62 ms
50,524 KB
testcase_34 AC 82 ms
51,392 KB
testcase_35 AC 82 ms
51,448 KB
testcase_36 AC 83 ms
51,224 KB
testcase_37 AC 85 ms
51,204 KB
testcase_38 AC 90 ms
51,308 KB
testcase_39 AC 87 ms
51,504 KB
testcase_40 AC 85 ms
51,432 KB
testcase_41 AC 85 ms
51,480 KB
testcase_42 AC 87 ms
51,368 KB
testcase_43 AC 86 ms
51,140 KB
testcase_44 AC 85 ms
51,516 KB
testcase_45 AC 83 ms
51,252 KB
testcase_46 AC 89 ms
51,592 KB
testcase_47 AC 84 ms
51,368 KB
testcase_48 AC 84 ms
51,460 KB
testcase_49 AC 83 ms
51,188 KB
testcase_50 AC 79 ms
51,504 KB
testcase_51 AC 81 ms
51,388 KB
testcase_52 AC 81 ms
51,496 KB
testcase_53 AC 83 ms
51,484 KB
testcase_54 AC 56 ms
50,740 KB
testcase_55 AC 54 ms
50,584 KB
testcase_56 AC 56 ms
50,728 KB
testcase_57 AC 58 ms
50,440 KB
testcase_58 AC 57 ms
50,284 KB
testcase_59 AC 57 ms
50,296 KB
testcase_60 AC 56 ms
50,324 KB
testcase_61 AC 57 ms
50,572 KB
testcase_62 AC 55 ms
50,672 KB
testcase_63 AC 57 ms
50,276 KB
testcase_64 AC 85 ms
51,572 KB
testcase_65 AC 83 ms
51,508 KB
testcase_66 AC 81 ms
51,492 KB
testcase_67 AC 80 ms
51,416 KB
testcase_68 AC 84 ms
51,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        String S = "0" + in.nextStr();
        long INF = Long.MAX_VALUE / 2;
        long[][] dp = new long[2][S.length() + 1];
        Arrays.fill(dp[0], INF);
        Arrays.fill(dp[1], INF);
        dp[0][0] = 0;
        for(int i = 1; i <= S.length(); i++){
            int d = (S.charAt(S.length() - i) - '0');
            for(int c = 0; c < 2; c++){
                int num = d + c;
                if(num == 10){
                    dp[1][i] = Math.min(dp[1][i], dp[c][i - 1]);
                }else{
                    dp[0][i] = Math.min(dp[0][i], dp[c][i - 1] + num / 5 + num % 5);
                    if(num < 5) dp[0][i] = Math.min(dp[0][i], dp[c][i - 1] + 1 + (5 - num));
                    else dp[1][i] = Math.min(dp[1][i], dp[c][i - 1] + 1 + (num - 5));
                    dp[1][i] = Math.min(dp[1][i], dp[c][i - 1] + (10 - num) / 5 + (10 - num) % 5);
                }
            }
        }
        long ans = Math.min(dp[0][S.length()], dp[0][S.length() - 1]);
        out.println(ans);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0