#22590 (Java21) No.195 フィボナッチ数列の理解(2)

提出ソース

結果

問題	No.195 フィボナッチ数列の理解(2)
ユーザー	uwi
提出日時	2015-04-26 23:28:35
言語	Java21 (openjdk 21)
結果	AC
実行時間	91 ms / 5,000 ms
コード長	5,786 bytes
コンパイル時間	3,975 ms
コンパイル使用メモリ	83,312 KB
実行使用メモリ	52,692 KB
最終ジャッジ日時	2024-07-05 02:22:49
合計ジャッジ時間	6,618 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	69 ms 50,884 KB
testcase_01	AC	70 ms 51,192 KB
testcase_02	AC	79 ms 51,496 KB
testcase_03	AC	69 ms 51,184 KB
testcase_04	AC	53 ms 50,404 KB
testcase_05	AC	67 ms 51,408 KB
testcase_06	AC	71 ms 51,032 KB
testcase_07	AC	69 ms 51,076 KB
testcase_08	AC	68 ms 51,052 KB
testcase_09	AC	70 ms 51,280 KB
testcase_10	AC	79 ms 51,024 KB
testcase_11	AC	76 ms 51,192 KB
testcase_12	AC	82 ms 51,408 KB
testcase_13	AC	84 ms 51,496 KB
testcase_14	AC	91 ms 51,828 KB
testcase_15	AC	91 ms 52,692 KB
testcase_16	AC	52 ms 50,048 KB
testcase_17	AC	79 ms 51,172 KB
testcase_18	AC	54 ms 50,036 KB
testcase_19	AC	79 ms 51,364 KB
testcase_20	AC	54 ms 50,344 KB
testcase_21	AC	78 ms 51,416 KB
testcase_22	AC	53 ms 50,396 KB
testcase_23	AC	77 ms 51,456 KB
testcase_24	AC	53 ms 50,416 KB

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

ソースコード

raw source code

package contest;

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 Q382 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long[] ca = new long[100];
		long[] cb = new long[100];
		ca[0] = 1;
		cb[1] = 1;
		for(int i = 2;i <= 60;i++){
			ca[i] = ca[i-1] + ca[i-2];
			cb[i] = cb[i-1] + cb[i-2];
		}
		int[] xs = na(3);
		Arrays.sort(xs);
		if(xs[0] < xs[1] && xs[1] < xs[2]){
			long zu = Long.MAX_VALUE;
			long zv = Long.MAX_VALUE;
			for(int s = 1;s <= 60;s++){
				long v = -1;
				if(cb[s] != 0 && xs[1] - xs[0] * ca[s] > 0 && (xs[1] - xs[0] * ca[s]) % cb[s] == 0){
					v = (xs[1] - xs[0] * ca[s]) / cb[s];
				}
				if(v >= 0){
					for(int t = s+1;t <= 60;t++){
						if(xs[2] - xs[0] * ca[t] == v * cb[t]){
							long u = xs[0];
							while(true){
								// [u,v]
								if(u < zu || u == zu && v < zv){
									zu = u; zv = v;
								}
								
								long nu = v-u;
								if(nu > 0){
									v = u;
									u = nu;
								}else{
									break;
								}
							}
							break;
						}
					}
				}
			}
			for(int s = 0;s <= 60;s++){
				if(s == 1)continue;
				long u = -1;
				if(ca[s] != 0 && xs[1] - xs[0] * cb[s] > 0 && (xs[1] - xs[0] * cb[s]) % ca[s] == 0){
					u = (xs[1] - xs[0] * cb[s]) / ca[s];
				}
				if(u >= 0){
					for(int t = s+1;t <= 60;t++){
						if(xs[2] - xs[0] * cb[t] == u * ca[t]){
							long v = xs[0];
							while(true){
								// [u,v]
								if(u < zu || u == zu && v < zv){
									zu = u; zv = v;
								}
								
								long nu = v-u;
								if(nu > 0){
									v = u;
									u = nu;
								}else{
									break;
								}
							}
							break;
						}
					}
				}
			}
			
			if(zu == Long.MAX_VALUE){
				out.println(-1);
			}else{
				out.println(zu + " " + zv);
			}
		}else if(xs[0] == xs[1] && xs[1] == xs[2]){
			long min = xs[0];
			for(int s = 2;s <= 60;s++){
				// a+by=z
				long num = xs[0]-ca[s];
				if(num > 0 && num % cb[s] == 0){
					min = Math.min(min, num/cb[s]);
				}
			}
			out.println(1 + " " + min);
		}else{
			if(xs[1] < xs[2]){
				xs[1] = xs[2];
			}
			
			long zu = Long.MAX_VALUE;
			long zv = Long.MAX_VALUE;
			for(int s = 0;s <= 60;s++){
				long v = -1;
				if(cb[s] != 0 && xs[1] - xs[0] * ca[s] > 0 && (xs[1] - xs[0] * ca[s]) % cb[s] == 0){
					v = (xs[1] - xs[0] * ca[s]) / cb[s];
				}
				if(v > 0){
					long u = xs[0];
					while(true){
						// [u,v]
						if(u < zu || u == zu && v < zv){
							zu = u; zv = v;
						}
						
						long nu = v-u;
						if(nu > 0){
							v = u;
							u = nu;
						}else{
							break;
						}
					}
				}
			}
			for(int s = 0;s <= 60;s++){
				long u = -1;
				if(ca[s] != 0 && xs[1] - xs[0] * cb[s] > 0 && (xs[1] - xs[0] * cb[s]) % ca[s] == 0){
					u = (xs[1] - xs[0] * cb[s]) / ca[s];
				}
				if(u > 0){
					long v = xs[0];
					while(true){
						// [u,v]
						if(u < zu || u == zu && v < zv){
							zu = u; zv = v;
						}
						
						long nu = v-u;
						if(nu > 0){
							v = u;
							u = nu;
						}else{
							break;
						}
					}
				}
			}
			
			if(zu == Long.MAX_VALUE){
				out.println(-1);
			}else{
				out.println(zu + " " + zv);
			}
		}
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q382().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private 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 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

結果

テストケース

ソースコード