#275304 (Java21) No.719 Coprime

提出ソース

結果

問題	No.719 Coprime
ユーザー	uwi
提出日時	2018-07-27 23:47:54
言語	Java21 (openjdk 21)
結果	AC
実行時間	425 ms / 3,000 ms
コード長	5,613 bytes
コンパイル時間	3,949 ms
コンパイル使用メモリ	84,016 KB
実行使用メモリ	61,536 KB
最終ジャッジ日時	2023-09-18 15:25:08
合計ジャッジ時間	10,646 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	44 ms 49,440 KB
testcase_01	AC	44 ms 49,480 KB
testcase_02	AC	44 ms 49,672 KB
testcase_03	AC	45 ms 49,384 KB
testcase_04	AC	43 ms 47,340 KB
testcase_05	AC	44 ms 49,372 KB
testcase_06	AC	45 ms 49,528 KB
testcase_07	AC	45 ms 49,372 KB
testcase_08	AC	44 ms 49,660 KB
testcase_09	AC	44 ms 49,328 KB
testcase_10	AC	44 ms 49,664 KB
testcase_11	AC	46 ms 49,172 KB
testcase_12	AC	44 ms 49,384 KB
testcase_13	AC	45 ms 49,332 KB
testcase_14	AC	44 ms 49,312 KB
testcase_15	AC	44 ms 49,412 KB
testcase_16	AC	44 ms 49,348 KB
testcase_17	AC	44 ms 49,388 KB
testcase_18	AC	44 ms 49,324 KB
testcase_19	AC	44 ms 49,328 KB
testcase_20	AC	44 ms 49,392 KB
testcase_21	AC	45 ms 49,200 KB
testcase_22	AC	44 ms 49,460 KB
testcase_23	AC	44 ms 49,296 KB
testcase_24	AC	45 ms 49,324 KB
testcase_25	AC	44 ms 49,536 KB
testcase_26	AC	45 ms 49,344 KB
testcase_27	AC	45 ms 49,328 KB
testcase_28	AC	43 ms 49,684 KB
testcase_29	AC	43 ms 49,464 KB
testcase_30	AC	44 ms 49,440 KB
testcase_31	AC	44 ms 49,436 KB
testcase_32	AC	44 ms 49,492 KB
testcase_33	AC	45 ms 49,500 KB
testcase_34	AC	44 ms 49,364 KB
testcase_35	AC	45 ms 49,524 KB
testcase_36	AC	45 ms 49,384 KB
testcase_37	AC	45 ms 49,288 KB
testcase_38	AC	44 ms 49,200 KB
testcase_39	AC	45 ms 49,256 KB
testcase_40	AC	43 ms 47,320 KB
testcase_41	AC	45 ms 49,824 KB
testcase_42	AC	45 ms 49,364 KB
testcase_43	AC	45 ms 49,324 KB
testcase_44	AC	45 ms 49,392 KB
testcase_45	AC	45 ms 49,176 KB
testcase_46	AC	46 ms 49,324 KB
testcase_47	AC	46 ms 49,336 KB
testcase_48	AC	46 ms 49,316 KB
testcase_49	AC	47 ms 49,324 KB
testcase_50	AC	47 ms 49,316 KB
testcase_51	AC	47 ms 49,304 KB
testcase_52	AC	57 ms 50,384 KB
testcase_53	AC	88 ms 52,256 KB
testcase_54	AC	99 ms 52,420 KB
testcase_55	AC	168 ms 54,720 KB
testcase_56	AC	312 ms 61,536 KB
testcase_57	AC	315 ms 60,876 KB
testcase_58	AC	413 ms 61,072 KB
testcase_59	AC	425 ms 60,972 KB
testcase_60	AC	422 ms 61,460 KB

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

ソースコード

raw source code

package contest180727;
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 D4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] primes = sieveEratosthenes(n);
		
		int[] sprimes = sieveEratosthenes((int)Math.sqrt(n));
		int u = sprimes.length;
		
		int[][] sup = new int[1<<u][n+1];
		for(int i = 0;i < 1<<u;i++){
			Arrays.fill(sup[i], 1);
		}
		for(int i = 1;i <= n;i++){
			int v = i;
			int ptn = 0;
			for(int j = 0;j < u;j++){
				while(v % sprimes[j] == 0){
					ptn |= 1<<j;
					v /= sprimes[j];
				}
			}
			if(v == 1){
				sup[ptn][i] = i;
			}
		}
		
		for(int i = 0;i < 1<<u;i++){
			for(int j = 1;j <= n;j++){
				if(sup[i][j-1] > sup[i][j]){
					sup[i][j] = sup[i][j-1];
				}
			}
		}
		
		long[] dp = new long[1<<u];
		Arrays.fill(dp, -999999999L);
		dp[0] = 0;
		for(int p : primes){
			if(p*p > n){
				for(int i = (1<<u)-1;i >= 0;i--){
					int mask = (1<<u)-1^i;
					for(int j = mask;j >= 0;j--){ j &= mask; 
						// i -> i^j
						dp[i^j] = Math.max(dp[i^j], dp[i] + sup[j][n/p]*p);
					} // include j=0
				}
			}
		}
		
		for(int i = 0;i < 1<<u;i++){
			int mask = (1<<u)-1^i;
			for(int j = mask;j >= 0;j--){ j &= mask; 
				// i -> i^j
				dp[i^j] = Math.max(dp[i^j], dp[i] + sup[j][n]);
			} // include j=0
		}
		out.println(dp[(1<<u)-1]-1);
	}
	
	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");
//		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 D4().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)); }
}

yukicoder

結果

テストケース

ソースコード