#562596 (Java21) No.636 硬貨の枚数2

提出ソース

結果

問題	No.636 硬貨の枚数2
ユーザー	narushimas
提出日時	2020-10-04 21:08:02
言語	Java21 (openjdk 21)
結果	AC
実行時間	94 ms / 2,000 ms
コード長	10,087 bytes
コンパイル時間	3,050 ms
コンパイル使用メモリ	86,804 KB
実行使用メモリ	39,124 KB
最終ジャッジ日時	2024-07-19 18:17:24
合計ジャッジ時間	8,038 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	45 ms 37,104 KB
testcase_01	AC	45 ms 36,784 KB
testcase_02	AC	43 ms 36,912 KB
testcase_03	AC	44 ms 36,916 KB
testcase_04	AC	44 ms 36,760 KB
testcase_05	AC	45 ms 37,116 KB
testcase_06	AC	45 ms 37,140 KB
testcase_07	AC	47 ms 36,972 KB
testcase_08	AC	47 ms 36,816 KB
testcase_09	AC	50 ms 36,732 KB
testcase_10	AC	49 ms 36,804 KB
testcase_11	AC	48 ms 36,988 KB
testcase_12	AC	47 ms 37,148 KB
testcase_13	AC	46 ms 36,972 KB
testcase_14	AC	49 ms 36,856 KB
testcase_15	AC	48 ms 37,016 KB
testcase_16	AC	47 ms 36,912 KB
testcase_17	AC	47 ms 36,904 KB
testcase_18	AC	47 ms 36,888 KB
testcase_19	AC	48 ms 36,784 KB
testcase_20	AC	50 ms 37,064 KB
testcase_21	AC	52 ms 36,952 KB
testcase_22	AC	52 ms 36,772 KB
testcase_23	AC	52 ms 37,112 KB
testcase_24	AC	70 ms 37,672 KB
testcase_25	AC	85 ms 38,456 KB
testcase_26	AC	55 ms 36,872 KB
testcase_27	AC	67 ms 37,672 KB
testcase_28	AC	56 ms 37,016 KB
testcase_29	AC	86 ms 38,636 KB
testcase_30	AC	55 ms 36,980 KB
testcase_31	AC	83 ms 38,580 KB
testcase_32	AC	53 ms 36,952 KB
testcase_33	AC	51 ms 36,888 KB
testcase_34	AC	92 ms 38,908 KB
testcase_35	AC	81 ms 38,952 KB
testcase_36	AC	83 ms 38,956 KB
testcase_37	AC	78 ms 38,792 KB
testcase_38	AC	88 ms 38,836 KB
testcase_39	AC	83 ms 38,952 KB
testcase_40	AC	81 ms 38,812 KB
testcase_41	AC	81 ms 38,848 KB
testcase_42	AC	80 ms 38,992 KB
testcase_43	AC	78 ms 39,080 KB
testcase_44	AC	81 ms 38,792 KB
testcase_45	AC	92 ms 39,004 KB
testcase_46	AC	82 ms 39,116 KB
testcase_47	AC	78 ms 39,064 KB
testcase_48	AC	79 ms 39,092 KB
testcase_49	AC	92 ms 39,024 KB
testcase_50	AC	91 ms 39,080 KB
testcase_51	AC	80 ms 39,124 KB
testcase_52	AC	80 ms 39,016 KB
testcase_53	AC	81 ms 39,072 KB
testcase_54	AC	48 ms 37,012 KB
testcase_55	AC	48 ms 36,764 KB
testcase_56	AC	48 ms 36,936 KB
testcase_57	AC	46 ms 36,784 KB
testcase_58	AC	47 ms 36,960 KB
testcase_59	AC	47 ms 36,916 KB
testcase_60	AC	45 ms 36,644 KB
testcase_61	AC	44 ms 36,824 KB
testcase_62	AC	45 ms 36,904 KB
testcase_63	AC	47 ms 37,016 KB
testcase_64	AC	82 ms 38,952 KB
testcase_65	AC	87 ms 38,932 KB
testcase_66	AC	94 ms 39,036 KB
testcase_67	AC	82 ms 38,744 KB
testcase_68	AC	81 ms 39,000 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

public class Main {
	static void solve() {
		var s = ns().toCharArray();
		int n = s.length;
		var dp = new long[n+1][2];
		fill(dp, linf);
		dp[0][0] = 0;
		for(int i=0;i<n;i++) {
			for(int j=0;j<2;j++) {
				for(int k=0;k<=10;k++) {
					int ns = s[i] - '0';
					int kpay = k == 10? 1 : k / 5 + k % 5;
					if(j == 0) {
						if(ns > k)continue;
						int r = k - ns;
						r = r % 5 + r / 5;
						dp[i+1][0] = min(dp[i+1][0], dp[i][j] + r + kpay);
						r = k - ns - 1;
						if(r < 0)continue;
						r = r % 5 + r / 5;
						dp[i+1][1] = min(dp[i+1][1], dp[i][j] + r + kpay);
					}
					else {
						int r = 10 + k - ns;
						r = r % 5 + r / 5;
						dp[i+1][0] = min(dp[i+1][0], dp[i][j] + r + kpay);
						r = 10 + k - ns - 1;
						r = r % 5 + r / 5;
						if(r < 0)continue;
						dp[i+1][1] = min(dp[i+1][1], dp[i][j] + r + kpay);
					}
				}
			}
		}
		out.println(dp[n][0]);
	}	
	
	//constants
	static final int inf = Integer.MAX_VALUE / 2;
	static final long linf = Long.MAX_VALUE / 3;
	static final double dinf = Double.MAX_VALUE / 3;
	static final long mod = (long) 1e9 + 7;
	static final int[] dx = { -1, 0, 1, 0 }, dy = { 0, -1, 0, 1 }, dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };
	static final double eps = 1e-10;
	
	//libraries
	static long[] cum(int a[]) {
		long[] cum = new long[a.length + 1];
		for(int i=0;i<a.length;i++) cum[i+1] = cum[i] + a[i];
		return cum;
	}
	static long[] cum(long a[]) {
		long[] cum = new long[a.length + 1];
		for(int i=0;i<a.length;i++) cum[i+1] = cum[i] + a[i];
		return cum;
	}
	static void reverse(int ar[]) {
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			int t = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = t;
		}
	}
	static void reverse(long ar[]) {
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			long t = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = t;
		}
	}
	static void reverse(double ar[]) {
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			double t = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = t;
		}
	}
	static void reverse(char ar[]) {
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			char t = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = t;
		}
	}
	static String getReverse(String s) {
		StringBuilder sb = new StringBuilder(s);
		return sb.reverse().toString();
	}
	static <T> void reverse(T[] ar) {
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			T t = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = t;
		}
	}
	static int[] concat(int x, int arr[]) {
		int ret[] = new int[arr.length + 1];
		System.arraycopy(arr, 0, ret, 1, ret.length - 1);
		ret[0] = x;
		return ret;
	}
	static int[] concat(int arr[], int x) {
		int ret[] = new int[arr.length + 1];
		System.arraycopy(arr, 0, ret, 0, ret.length - 1);
		ret[ret.length - 1] = x;
		return ret;
	}
	static long[] concat(long x, long arr[]) {
		long ret[] = new long[arr.length + 1];
		System.arraycopy(arr, 0, ret, 1, ret.length - 1);
		ret[0] = x;
		return ret;
	}
	static long[] concat(long arr[], long x) {
		long ret[] = new long[arr.length + 1];
		System.arraycopy(arr, 0, ret, 0, ret.length - 1);
		ret[ret.length - 1] = x;
		return ret;
	}
	static char[] concat(char x, char arr[]) {
		char ret[] = new char[arr.length + 1];
		System.arraycopy(arr, 0, ret, 0, ret.length - 1);
		ret[ret.length - 1] = x;
		return ret;
	}
	static char[] concat(char arr[], char x) {
		char ret[] = new char[arr.length + 1];
		System.arraycopy(arr, 0, ret, 0, ret.length - 1);
		ret[ret.length - 1] = x;
		return ret;
	}
	static int max(int x, int y) {
		return Math.max(x, y);
	}
	static int min(int x, int y) {
		return Math.min(x, y);
	}
	static int max(int x, int y, int z) {
		x = Math.max(x, y);
		x = Math.max(x, z);
		return x;
	}
	static int min(int x, int y, int z) {
		x = Math.min(x, y);
		x = Math.min(x, z);
		return x;
	}
	static long max(long x, long y) {
		return Math.max(x, y);
	}
	static long min(long x, long y) {
		return Math.min(x, y);
	}
	static long max(long x, long y, long z) {
		x = Math.max(x, y);
		x = Math.max(x, z);
		return x;
	}
	static long min(long x, long y, long z) {
		x = Math.min(x, y);
		x = Math.min(x, z);
		return x;
	}
	static double max(double x, double y) {
		return Math.max(x, y);
	}
	static double min(double x, double y) {
		return Math.min(x, y);
	}
	static double max(double x, double y, double z) {
		x = Math.max(x, y);
		x = Math.max(x, z);
		return x;
	}
	static double min(double x, double y, double z) {
		x = Math.min(x, y);
		x = Math.min(x, z);
		return x;
	}
	static void sort(int[] ar) {
		Arrays.sort(ar);
	}
	static void sort(long[] ar) {
		Arrays.sort(ar);
	}
	static void sort(double[] ar) {
		Arrays.sort(ar);
	}
	static void sort(char[] ar) {
		Arrays.sort(ar);
	}
	static void rsort(int[] ar) {
		Arrays.sort(ar);
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			int tmp = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = tmp;
		}
	}
	static void rsort(long[] ar) {
		Arrays.sort(ar);
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			long tmp = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = tmp;
		}
	}
	static void rsort(double[] ar) {
		Arrays.sort(ar);
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			double tmp = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = tmp;
		}
	}
	static void rsort(char[] ar) {
		Arrays.sort(ar);
		int len = ar.length;
		for (int i = 0; i < len / 2; i++) {
			char tmp = ar[i];
			ar[i] = ar[len - 1 - i];
			ar[len - 1 - i] = tmp;
		}
	}
	static void fill(int arr[], int x) {
		Arrays.fill(arr, x);
	}
	static void fill(long arr[], long x) {
		Arrays.fill(arr, x);
	}
	static void fill(boolean arr[], boolean x) {
		Arrays.fill(arr, x);
	}
	static void fill(double arr[], double x) {
		Arrays.fill(arr, x);
	}
	static void fill(int arr[][], int x) {
		for (int i = 0; i < arr.length; i++)
			Arrays.fill(arr[i], x);
	}
	static void fill(long arr[][], long x) {
		for (int i = 0; i < arr.length; i++)
			Arrays.fill(arr[i], x);
	}
	static void fill(double arr[][], double x) {
		for (int i = 0; i < arr.length; i++)
			Arrays.fill(arr[i], x);
	}
	static void fill(boolean arr[][], boolean x) {
		for (int i = 0; i < arr.length; i++)
			Arrays.fill(arr[i], x);
	}
	//MOD culc
	static long plus(long x, long y) {
		long res = (x + y) % mod;
		return res < 0 ? res + mod : res;
	}
	static long sub(long x, long y) {
		long res = (x - y) % mod;
		return res < 0 ? res + mod : res;
	}
	static long mul(long x, long y) {
		long res = (x * y) % mod;
		return res < 0 ? res + mod : res;
	}
	static long div(long x, long y) {
		long res = x * pow(y, mod - 2) % mod;
		return res < 0 ? res + mod : res;
	}
	static long pow(long x, long y) {
		if (y < 0)
			return 0;
		if (y == 0)
			return 1;
		if (y % 2 == 1)
			return (x * pow(x, y - 1)) % mod;
		long root = pow(x, y / 2);
		return root * root % mod;
	}
	public static void main(String[] args) throws Exception {
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}
	//input
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	private static 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 static boolean isSpaceChar(int c) {
		return !(c >= 33 && c <= 126);
	}
	private static int skip() {
		int b;
		while ((b = readByte()) != -1 && isSpaceChar(b))
			;
		return b;
	}
	@SuppressWarnings("unused")
	private static double nd() {
		return Double.parseDouble(ns());
	}
	@SuppressWarnings("unused")
	private static char nc() {
		return (char) skip();
	}
	private static String ns() {
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while (!(isSpaceChar(b))) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	private static 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);
	}
	@SuppressWarnings("unused")
	private static char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for (int i = 0; i < n; i++)
			map[i] = ns(m);
		return map;
	}
	@SuppressWarnings("unused")
	private static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}
	@SuppressWarnings("unused")
	private static long[] nla(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nl();
		return a;
	}
	@SuppressWarnings("unused")
	private static int[][] na(int n, int m){
		int[][] res = new int[n][m];
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				res[i][j] = ni();
			}
		}
		return res;
	}
	@SuppressWarnings("unused")
	private static long[][] nla(int n, int m){
		long[][] res = new long[n][m];
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				res[i][j] = nl();
			}
		}
		return res;
	}
	private static 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 static 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();
		}
	}
}

yukicoder

結果

テストケース

ソースコード