結果

問題 No.639 An Ordinary Sequence
ユーザー uwiuwi
提出日時 2018-01-26 22:28:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 45 ms / 1,000 ms
コード長 3,617 bytes
コンパイル時間 5,243 ms
コンパイル使用メモリ 78,012 KB
実行使用メモリ 49,600 KB
最終ジャッジ日時 2023-08-30 12:45:06
合計ジャッジ時間 6,831 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,536 KB
testcase_01 AC 44 ms
49,232 KB
testcase_02 AC 42 ms
49,216 KB
testcase_03 AC 42 ms
49,264 KB
testcase_04 AC 42 ms
47,172 KB
testcase_05 AC 42 ms
49,576 KB
testcase_06 AC 42 ms
49,484 KB
testcase_07 AC 42 ms
49,252 KB
testcase_08 AC 42 ms
49,208 KB
testcase_09 AC 42 ms
49,600 KB
testcase_10 AC 42 ms
49,264 KB
testcase_11 AC 41 ms
47,696 KB
testcase_12 AC 44 ms
49,244 KB
testcase_13 AC 43 ms
49,592 KB
testcase_14 AC 44 ms
49,408 KB
testcase_15 AC 44 ms
49,596 KB
testcase_16 AC 44 ms
49,536 KB
testcase_17 AC 43 ms
49,248 KB
testcase_18 AC 45 ms
49,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180126;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl();
		if(n == 0){
			out.println(1);
			return;
		}
		long[] vals = new long[1000];
		long[] offs = new long[1000];
		offs[0] = 0;
		offs[1] = 1;
		int p = 1;
		vals[0] = 1;
		while(true){
			long tar = offs[p];
			int id3 = Arrays.binarySearch(offs, 0, p+1, tar/3);
			if(id3 < 0)id3 = -id3-2;
			int id5 = Arrays.binarySearch(offs, 0, p+1, tar/5);
			if(id5 < 0)id5 = -id5-2;
			// x < offs[id3+1]*3
			long sup = Math.min(offs[id3+1]*3, offs[id5+1]*5);
			offs[p+1] = sup;
			vals[p] = vals[id3] + vals[id5];
			p++;
			if(offs[p] > n){
				out.println(vals[p-1]);
				return;
			}
		}
	}
	
	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 C().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)); }
}
0