#506030 (Java21) No.1106 🦉 何事もバランスが大事

提出ソース

結果

問題	No.1106 🦉 何事もバランスが大事
ユーザー	uwi
提出日時	2020-07-03 21:50:56
言語	Java21 (openjdk 21)
結果	AC
実行時間	73 ms / 2,000 ms
コード長	3,781 bytes
コンパイル時間	5,207 ms
コンパイル使用メモリ	92,788 KB
実行使用メモリ	53,424 KB
最終ジャッジ日時	2023-10-17 01:16:07
合計ジャッジ時間	13,668 ms
ジャッジサーバーID （参考情報）	judge14 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 53,296 KB
testcase_01	AC	54 ms 52,352 KB
testcase_02	AC	56 ms 53,424 KB
testcase_03	AC	58 ms 52,368 KB
testcase_04	AC	73 ms 53,416 KB
testcase_05	AC	56 ms 53,416 KB
testcase_06	AC	55 ms 53,420 KB
testcase_07	AC	66 ms 52,384 KB
testcase_08	AC	60 ms 53,416 KB
testcase_09	AC	62 ms 52,708 KB
testcase_10	AC	60 ms 53,416 KB
testcase_11	AC	52 ms 53,416 KB
testcase_12	AC	57 ms 52,704 KB
testcase_13	AC	56 ms 53,412 KB
testcase_14	AC	59 ms 53,364 KB
testcase_15	AC	55 ms 53,412 KB
testcase_16	AC	57 ms 52,712 KB
testcase_17	AC	56 ms 52,388 KB
testcase_18	AC	57 ms 53,420 KB
testcase_19	AC	55 ms 53,420 KB
testcase_20	AC	55 ms 52,376 KB
testcase_21	AC	56 ms 53,408 KB
testcase_22	AC	56 ms 53,420 KB
testcase_23	AC	55 ms 52,368 KB
testcase_24	AC	53 ms 53,416 KB
testcase_25	AC	53 ms 53,408 KB
testcase_26	AC	53 ms 53,364 KB
testcase_27	AC	54 ms 53,424 KB
testcase_28	AC	65 ms 53,416 KB
testcase_29	AC	60 ms 53,424 KB
testcase_30	AC	59 ms 53,416 KB
testcase_31	AC	57 ms 53,420 KB
testcase_32	AC	57 ms 53,412 KB
testcase_33	AC	55 ms 53,412 KB
testcase_34	AC	56 ms 53,412 KB
testcase_35	AC	60 ms 53,408 KB
testcase_36	AC	53 ms 52,392 KB
testcase_37	AC	61 ms 53,412 KB
testcase_38	AC	60 ms 52,388 KB
testcase_39	AC	56 ms 53,412 KB
testcase_40	AC	59 ms 53,420 KB
testcase_41	AC	58 ms 53,372 KB
testcase_42	AC	55 ms 52,440 KB
testcase_43	AC	57 ms 52,408 KB
testcase_44	AC	55 ms 53,412 KB
testcase_45	AC	59 ms 52,388 KB
testcase_46	AC	58 ms 53,416 KB
testcase_47	AC	64 ms 52,404 KB
testcase_48	AC	57 ms 52,364 KB
testcase_49	AC	58 ms 51,376 KB
testcase_50	AC	58 ms 52,352 KB
testcase_51	AC	59 ms 53,412 KB
testcase_52	AC	55 ms 52,352 KB
testcase_53	AC	54 ms 53,416 KB
testcase_54	AC	56 ms 53,412 KB
testcase_55	AC	60 ms 52,356 KB
testcase_56	AC	55 ms 52,360 KB
testcase_57	AC	55 ms 53,412 KB
testcase_58	AC	55 ms 53,412 KB
testcase_59	AC	64 ms 53,360 KB
testcase_60	AC	57 ms 52,736 KB
testcase_61	AC	58 ms 52,372 KB
testcase_62	AC	58 ms 53,420 KB
testcase_63	AC	54 ms 52,404 KB
testcase_64	AC	54 ms 53,420 KB
testcase_65	AC	53 ms 52,400 KB
testcase_66	AC	56 ms 53,412 KB
testcase_67	AC	53 ms 53,416 KB
testcase_68	AC	53 ms 53,412 KB
testcase_69	AC	56 ms 52,716 KB
testcase_70	AC	54 ms 51,940 KB
testcase_71	AC	54 ms 51,372 KB
testcase_72	AC	54 ms 51,364 KB
testcase_73	AC	58 ms 53,416 KB
testcase_74	AC	55 ms 53,412 KB
testcase_75	AC	54 ms 53,420 KB
testcase_76	AC	54 ms 53,424 KB
testcase_77	AC	55 ms 53,424 KB
testcase_78	AC	52 ms 53,420 KB
testcase_79	AC	53 ms 53,420 KB
testcase_80	AC	54 ms 53,412 KB
testcase_81	AC	54 ms 53,416 KB

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

ソースコード

raw source code

package contest200703;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class F2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl();
		n++;
		List<Integer> ds = new ArrayList<>();
		while(n != 0){
			int m = (int)(n%5);
			if(m >= 3){
				m -= 5;
				n += 5;
			}
			ds.add(m);
			n /= 5;
		}
		int O = 80;
		long[] dp = new long[O*2+1];
		int e = O;
		for(int i = ds.size()-1;i >= 0;i--){
			long[] ndp = new long[O*2+1];
			for(int j = 0;j <= 2*O;j++){
				if(dp[j] == 0)continue;
				for(int k = -2;k <= 2;k++){
					ndp[j+k] += dp[j];
				}
			}
			
			if(i == ds.size()-1){
				for(int k = 1;k < ds.get(i);k++){
					ndp[e+k]++;
				}
			}else{
				for(int k = 1;k <= 2;k++){
					ndp[O+k]++;
				}
				for(int k = -2;k < ds.get(i);k++){
					ndp[e+k]++;
				}
			}
			e += ds.get(i);
			dp = ndp;
		}
		out.println(dp[O]);
	}
	
	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 F2().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)); }
}

yukicoder

結果

テストケース

ソースコード