結果

問題 No.979 Longest Divisor Sequence
ユーザー ziitaziita
提出日時 2020-02-02 19:53:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,023 ms / 2,000 ms
コード長 6,558 bytes
コンパイル時間 3,088 ms
コンパイル使用メモリ 92,420 KB
実行使用メモリ 64,076 KB
最終ジャッジ日時 2023-10-19 01:24:39
合計ジャッジ時間 7,409 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
56,552 KB
testcase_01 AC 79 ms
57,072 KB
testcase_02 AC 80 ms
57,076 KB
testcase_03 AC 80 ms
56,844 KB
testcase_04 AC 81 ms
56,796 KB
testcase_05 AC 89 ms
57,160 KB
testcase_06 AC 102 ms
56,804 KB
testcase_07 AC 93 ms
57,180 KB
testcase_08 AC 80 ms
57,092 KB
testcase_09 AC 83 ms
57,180 KB
testcase_10 AC 129 ms
58,608 KB
testcase_11 AC 132 ms
59,036 KB
testcase_12 AC 131 ms
58,688 KB
testcase_13 AC 370 ms
61,400 KB
testcase_14 AC 1,023 ms
64,076 KB
testcase_15 AC 611 ms
63,772 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    static int mod = 1_000_000_007;
    // int mod = 998244353;
    // long inf = Long.MAX_VALUE/2;
    int inf = Integer.MAX_VALUE/2;

    void solve(){
        int n = ni();
        int[] a = new int[n];
        for(int i = 0; i < n; i++){
            a[i] = ni();
        }
        int[] p = sieveEratosthenes(1000000);
        int[] dp = new int[300001];
        Arrays.fill(dp, -1);
        int ans = 0;
        for(int i = 0; i < n; i++){
            int[] ret = list_divisor(a[i],p);
            dp[a[i]] = 1;
            for(int j : ret){
                if(j==a[i]) continue;
                if(dp[j]!=-1) dp[a[i]] = Math.max(dp[a[i]], dp[j]+1);
            }
            ans = Math.max(ans, dp[a[i]]);
        }
        out.println(ans);
    }

    int[] list_divisor(int n, int[] p){
        int[][] res = factor(n, p);
        ArrayList<Integer> list = new ArrayList<>();
        f(0,1,list, res);
        int[] ans = new int[list.size()];
        int idx = 0;
        for(int i : list){
            ans[idx++] = i;
        }
        Arrays.sort(ans);
        return ans;
    }

    void f(int depth, int ans, ArrayList<Integer> list, int[][] res){
        if(depth==res.length){
            list.add(ans);
            return;
        }
        for(int i = 0; i <= res[depth][1]; i++){
            f(depth+1, ans*(int)Math.pow(res[depth][0],i), list, res);
        }
        return;
    }
 
    public static int[][] factor(int n, int[] primes)
    {
        int[][] ret = new int[9][2];
        int rp = 0;
        for(int p : primes){
            if(p * p > n)break;
            int i;
            for(i = 0;n % p == 0;n /= p, i++);
            if(i > 0){
                ret[rp][0] = p;
                ret[rp][1] = i;
                rp++;
            }
        }
        if(n != 1){
            ret[rp][0] = n;
            ret[rp][1] = 1;
            rp++;
        }
        return Arrays.copyOf(ret, rp);
    }
 
    public static int[] sieveEratosthenes(int n) {
		if (n <= 32) {
			int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
			for (int i = 0; i < primes.length; i++) {
				if (n < primes[i]) {
					return Arrays.copyOf(primes, i);
				}
			}
			return primes;
		}
 
		int u = n + 32;
		double lu = Math.log(u);
		int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
		ret[0] = 2;
		int pos = 1;
 
		int[] isnp = new int[(n + 1) / 32 / 2 + 1];
		int sup = (n + 1) / 32 / 2 + 1;
 
		int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
		for (int tp : tprimes) {
			ret[pos++] = tp;
			int[] ptn = new int[tp];
			for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
				ptn[i >> 5] |= 1 << (i & 31);
			for (int j = 0; j < sup; j += tp) {
				for (int i = 0; i < tp && i + j < sup; i++) {
					isnp[j + i] |= ptn[i];
				}
			}
		}
 
		// 3,5,7
		// 2x+3=n
		int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,
				9, 6, 16, 5, 15, 14 };
		int h = n / 2;
		for (int i = 0; i < sup; i++) {
			for (int j = ~isnp[i]; j != 0; j &= j - 1) {
				int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
				int p = 2 * pp + 3;
				if (p > n)
					break;
				ret[pos++] = p;
				if ((long) p * p > n)
					continue;
				for (int q = (p * p - 3) / 2; q <= h; q += p)
					isnp[q >> 5] |= 1 << q;
			}
		}
 
		return Arrays.copyOf(ret, pos);
	}

    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 Main().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) && 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)); }
 
}
0