結果
問題 | No.979 Longest Divisor Sequence |
ユーザー | k_6101 |
提出日時 | 2020-02-01 14:25:05 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,916 bytes |
コンパイル時間 | 2,714 ms |
コンパイル使用メモリ | 81,156 KB |
実行使用メモリ | 61,360 KB |
最終ジャッジ日時 | 2024-09-18 19:59:02 |
合計ジャッジ時間 | 9,653 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
42,536 KB |
testcase_01 | AC | 136 ms
42,420 KB |
testcase_02 | AC | 138 ms
42,428 KB |
testcase_03 | AC | 140 ms
42,360 KB |
testcase_04 | AC | 136 ms
42,440 KB |
testcase_05 | AC | 138 ms
42,308 KB |
testcase_06 | AC | 137 ms
42,416 KB |
testcase_07 | AC | 138 ms
42,528 KB |
testcase_08 | AC | 136 ms
42,440 KB |
testcase_09 | AC | 143 ms
42,568 KB |
testcase_10 | AC | 295 ms
48,368 KB |
testcase_11 | AC | 289 ms
48,072 KB |
testcase_12 | AC | 296 ms
47,872 KB |
testcase_13 | AC | 886 ms
59,216 KB |
testcase_14 | TLE | - |
testcase_15 | AC | 1,268 ms
59,780 KB |
ソースコード
import static java.util.Comparator.*; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.PriorityQueue; import java.util.Queue; import java.util.Scanner; import java.util.Set; import java.util.TreeSet; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ========================================================== final int max = (int)3e5+1; int[] maxLen = new int[max]; List<Integer> fnc(int n) { List<Integer> ans = new ArrayList<>(); for (int i = 1; i*i <= n; i++) { if(n % i != 0) continue; ans.add(i); if(i*i != n) ans.add(n / i); } ans.sort(naturalOrder()); // for(int i : ans) out.print(i + " "); // out.println(""); return ans; } public void solve() { int N = ni(); int[] A = ndi(N); int ans = 0; for (int i = 0; i < N; i++) { if(A[i] == 1) { maxLen[1] = 1; } else { for(int x : fnc(A[i])){ if(x == A[i]) continue; maxLen[A[i]] = Math.max(maxLen[A[i]], maxLen[x] + 1); // out.println("maxLen[" + x + "] = " + maxLen[x] + " + 1"); // out.println(" --> maxLen[" + A[i] + "] = " + maxLen[A[i]] + ""); } } ans = Math.max(ans, maxLen[A[i]]); } out.println(ans); } // ------------------------------------------ // 入力 // ------------------------------------------ public int ni() { return sc.nextInt(); } public long nl() { return sc.nextLong(); } public String ns() { return sc.next(); } public char[] nc() { return sc.next().toCharArray(); } public int[] ndi(int N) { int[] ans = new int[N]; for (int i = 0; i < N; i++) { ans[i] = ni(); } return ans; } public long[] ndl(int N) { long[] ans = new long[N]; for (int i = 0; i < N; i++) { ans[i] = nl(); } return ans; } public String[] nds(int N) { String[] ans = new String[N]; for (int i = 0; i < N; i++) { ans[i] = ns(); } return ans; } public char[][] ndc(int N) { char[][] ans = new char[N][]; for (int i = 0; i < N; i++) { ans[i] = nc(); } return ans; } public int[][] nddi(int N, int S) { int[][] ans = new int[N][S]; for (int i = 0; i < N; i++) { for (int j = 0; j < S; j++) { ans[i][j] = ni(); } } return ans; } }