結果

問題 No.979 Longest Divisor Sequence
ユーザー nishi5451nishi5451
提出日時 2021-07-17 00:20:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,187 ms / 2,000 ms
コード長 3,988 bytes
コンパイル時間 2,411 ms
コンパイル使用メモリ 87,600 KB
実行使用メモリ 71,152 KB
最終ジャッジ日時 2024-07-06 11:53:05
合計ジャッジ時間 5,961 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
49,876 KB
testcase_01 AC 49 ms
50,000 KB
testcase_02 AC 49 ms
49,976 KB
testcase_03 AC 50 ms
50,024 KB
testcase_04 AC 49 ms
49,860 KB
testcase_05 AC 50 ms
50,000 KB
testcase_06 AC 49 ms
49,936 KB
testcase_07 AC 52 ms
49,956 KB
testcase_08 AC 50 ms
50,064 KB
testcase_09 AC 49 ms
50,040 KB
testcase_10 AC 112 ms
53,064 KB
testcase_11 AC 114 ms
52,776 KB
testcase_12 AC 114 ms
52,828 KB
testcase_13 AC 141 ms
52,900 KB
testcase_14 AC 1,187 ms
71,152 KB
testcase_15 AC 435 ms
62,884 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		int n = fs.nextInt();
		Map<Integer, Integer> map = new HashMap<>();
		int ans = 0;
		for(int i = 0; i < n; i++){
			int a = fs.nextInt();
			int max = 1;
			for(int j = 1; j*j <= a; j++){
				if(a%j == 0){
					int c1 = j;
					int c2 = a/j;
					if(c1 != a && map.containsKey(c1)) max = Math.max(max, map.get(c1)+1);
					if(c2 != a && map.containsKey(c2)) max = Math.max(max, map.get(c2)+1);
				}
			}
			map.put(a, max);
			ans = Math.max(ans, max);
		}
	
		PrintWriter pw = new PrintWriter(System.out);
		pw.println(ans);
		pw.close();
	}
}

class Util{
	static void print(int[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(long[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(char[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(double[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(Integer[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(Long[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
	static void print(String[] arr) {
		System.out.print("[");
		for(int i = 0; i < arr.length; i++){
			if(i == arr.length-1) System.out.println(arr[i] + "]");
			else System.out.print(arr[i] + ", ");
		}
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
}
0